Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,254,406 papers from all fields of science
Search
Sign In
Create Free Account
Floorplan (microelectronics)
Known as:
Floor planning
, Floorplan (integrated circuits)
, Floorplanning
In electronic design automation, a floorplan of an integrated circuit is a schematic representation of tentative placement of its major functional…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Arithmetic logic unit
Barrel shifter
Binary tree
CPU cache
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A Multi-Granularity Power Modeling Methodology for Embedded Processors
Young-Hwan Park
,
S. Pasricha
,
F. Kurdahi
,
N. Dutt
IEEE Transactions on Very Large Scale Integration…
2011
Corpus ID: 6849825
With power becoming a major constraint for multiprocessor embedded systems, it is becoming important for designers to…
Expand
Highly Cited
2007
Highly Cited
2007
An ILP algorithm for post-floorplanning voltage-island generation considering power-network planning
W. Lee
,
Hung-Yi Liu
,
Yao-Wen Chang
IEEE/ACM International Conference on Computer…
2007
Corpus ID: 17715150
Power optimization is a crucial concern for modem circuit designs. Multiple supply voltages (MSV's) provide an effective…
Expand
Highly Cited
2004
Highly Cited
2004
Temporal floorplanning using the T-tree formulation
Ping-Hung Yuh
,
Chia-Lin Yang
,
Yao-Wen Chang
IEEE/ACM International Conference on Computer…
2004
Corpus ID: 11238909
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and…
Expand
Highly Cited
2003
Highly Cited
2003
Microarchitecture evaluation with physical planning
J. Cong
,
Ashok Jagannathan
,
G. Reinman
,
Michail Romesis
Proceedings - Design Automation Conference
2003
Corpus ID: 759994
Conventionally, microarchitecture designs are mainly guided by the maximum throughput (measured as IPC) and fail to evaluate the…
Expand
Highly Cited
2003
Highly Cited
2003
Combining wire swapping and spacing for low-power deep-submicron buses
E. Macii
,
M. Poncino
,
S. Salerno
ACM Great Lakes Symposium on VLSI
2003
Corpus ID: 16116463
We propose an approach for reducing the energy consumption of address buses that targets both the switching and the crosstalk…
Expand
1999
1999
DYNASTY: A Temporal Floorplanning Based CAD Framework for Dynamically Reconfigurable Logic Systems
M. Vasilko
International Conference on Field-Programmable…
1999
Corpus ID: 24272796
This paper presents DYNASTY–a new CAD framework aimed at supporting research of design techniques, algorithms and methodologies…
Expand
1999
1999
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
K. Bazargan
,
R. Kastner
,
M. Sarrafzadeh
Proceedings Tenth IEEE International Workshop on…
1999
Corpus ID: 14067330
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the…
Expand
1998
1998
Evolutionary algorithms, simulated annealing, and Tabu search: a comparative study
H. Youssef
,
S. M. Sait
,
H. Adiche
Optics & Photonics
1998
Corpus ID: 62609017
Evolutionary algorithms, simulated annealing (SA), and Tabu Search (TS) are general iterative algorithms for combinatorial…
Expand
Highly Cited
1992
Highly Cited
1992
Anatomy of a Silicon Compiler
R. Brodersen
1992
Corpus ID: 54127172
1. Introduction and History R.W. Brodersen. Part I: Framework and Design Entry. 2. The OCT Data Manager R. Spickelmier, B.C…
Expand
1990
1990
A 100 MHz 64-tap FIR digital filter in a 0.8 mu m BiCMOS gate array
T. Yoshino
,
R. Jain
,
Ping Yang
,
H. Davis
,
W. Gass
,
Ashwin H. Shah
37th IEEE International Conference on Solid-State…
1990
Corpus ID: 29419177
A 64-tap FIR (finite-impulse-response) digital filter fabricated in a 0.8- mu m, triple-level interconnect, BiCMOS gate-array…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE