A bijection between permutations and floorplans, and its applications

Eyal Ackerman; Gill Barequet; Ron Y. Pinter

doi:10.1016/j.dam.2006.03.018

A bijection between permutations and floorplans, and its applications

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Research output: Contribution to journal › Article › peer-review

Abstract

A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic floorplans equals the number of Baxter permutations [B. Yao, H. Chen, C.K. Cheng, R.L. Graham, Floorplan representations: complexity and connections, ACM Trans. Design Automation Electron. Systems 8(1) (2003) 55-80]. We present a simple and efficient bijection between Baxter permutations and mosaic floorplans with applications to integrated circuits design. Moreover, this bijection has two additional merits: (1) It also maps between separable permutations and slicing floorplans; and (2) it suggests enumerations of mosaic floorplans according to various structural parameters.

Original language	English
Pages (from-to)	1674-1684
Number of pages	11
Journal	Discrete Applied Mathematics
Volume	154
Issue number	12
DOIs	https://doi.org/10.1016/j.dam.2006.03.018
State	Published - 15 Jul 2006
Externally published	Yes

Keywords

Baxter permutations
Mosaic floorplans
Separable permutations
Slicing floorplans

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2006.03.018

Cite this

@article{511a1a7d9315455c8ef8f4646182e96f,

title = "A bijection between permutations and floorplans, and its applications",

abstract = "A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic floorplans equals the number of Baxter permutations [B. Yao, H. Chen, C.K. Cheng, R.L. Graham, Floorplan representations: complexity and connections, ACM Trans. Design Automation Electron. Systems 8(1) (2003) 55-80]. We present a simple and efficient bijection between Baxter permutations and mosaic floorplans with applications to integrated circuits design. Moreover, this bijection has two additional merits: (1) It also maps between separable permutations and slicing floorplans; and (2) it suggests enumerations of mosaic floorplans according to various structural parameters.",

keywords = "Baxter permutations, Mosaic floorplans, Separable permutations, Slicing floorplans",

author = "Eyal Ackerman and Gill Barequet and Pinter, {Ron Y.}",

year = "2006",

month = jul,

day = "15",

doi = "10.1016/j.dam.2006.03.018",

language = "English",

volume = "154",

pages = "1674--1684",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - A bijection between permutations and floorplans, and its applications

AU - Ackerman, Eyal

AU - Barequet, Gill

AU - Pinter, Ron Y.

PY - 2006/7/15

Y1 - 2006/7/15

N2 - A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic floorplans equals the number of Baxter permutations [B. Yao, H. Chen, C.K. Cheng, R.L. Graham, Floorplan representations: complexity and connections, ACM Trans. Design Automation Electron. Systems 8(1) (2003) 55-80]. We present a simple and efficient bijection between Baxter permutations and mosaic floorplans with applications to integrated circuits design. Moreover, this bijection has two additional merits: (1) It also maps between separable permutations and slicing floorplans; and (2) it suggests enumerations of mosaic floorplans according to various structural parameters.

AB - A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic floorplans equals the number of Baxter permutations [B. Yao, H. Chen, C.K. Cheng, R.L. Graham, Floorplan representations: complexity and connections, ACM Trans. Design Automation Electron. Systems 8(1) (2003) 55-80]. We present a simple and efficient bijection between Baxter permutations and mosaic floorplans with applications to integrated circuits design. Moreover, this bijection has two additional merits: (1) It also maps between separable permutations and slicing floorplans; and (2) it suggests enumerations of mosaic floorplans according to various structural parameters.

KW - Baxter permutations

KW - Mosaic floorplans

KW - Separable permutations

KW - Slicing floorplans

UR - http://www.scopus.com/inward/record.url?scp=33646901979&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2006.03.018

DO - 10.1016/j.dam.2006.03.018

M3 - Article

AN - SCOPUS:33646901979

SN - 0166-218X

VL - 154

SP - 1674

EP - 1684

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 12

ER -

A bijection between permutations and floorplans, and its applications

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this