Log in

Relevant bibliographies by topics / Floorplanning

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Floorplanning'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Floorplanning.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Floorplanning"

1

Shanavas, I. Hameem, and Ramaswamy Kannan Gnanamurthy. "Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms." VLSI Design 2011 (October 12, 2011): 1–9. http://dx.doi.org/10.1155/2011/896241.

Full text

Abstract:

Minimizing the wirelength plays an important role in physical design automation of very large-scale integration (VLSI) chips. The objective of wirelength minimization can be achieved by finding an optimal solution for VLSI physical design components like partitioning and floorplanning. In VLSI circuit partitioning, the problem of obtaining a minimum delay has prime importance. In VLSI circuit floorplanning, the problem of minimizing silicon area is also a hot issue. Reducing the minimum delay in partitioning and area in floorplanning helps to minimize the wirelength. The enhancements in partitioning and floorplanning have influence on other criteria like power, cost, clock speed, and so forth. Memetic Algorithm (MA) is an Evolutionary Algorithm that includes one or more local search phases within its evolutionary cycle to obtain the minimum wirelength by reducing delay in partitioning and by reducing area in floorplanning. MA applies some sort of local search for optimization of VLSI partitioning and floorplanning. The algorithm combines a hierarchical design technique like genetic algorithm and constructive technique like Simulated Annealing for local search to solve VLSI partitioning and floorplanning problem. MA can quickly produce optimal solutions for the popular benchmark.

APA, Harvard, Vancouver, ISO, and other styles

2

Yu, Shenglu, Shimin Du, and Chang Yang. "A Deep Reinforcement Learning Floorplanning Algorithm Based on Sequence Pairs." Applied Sciences 14, no. 7 (March 29, 2024): 2905. http://dx.doi.org/10.3390/app14072905.

Full text

Abstract:

In integrated circuit (IC) design, floorplanning is an important stage in obtaining the floorplan of the circuit to be designed. Floorplanning determines the performance, size, yield, and reliability of very large-scale integration circuit (VLSI) ICs. The results obtained in this step are necessary for the subsequent continuous processes of chip design. From a computational perspective, VLSI floorplanning is an NP-hard problem, making it difficult to be efficiently solved by classical optimization techniques. In this paper, we propose a deep reinforcement learning floorplanning algorithm based on sequence pairs (SP) to address the placement problem. Reinforcement learning utilizes an agent to explore the search space in sequence pairs to find the optimal solution. Experimental results on the international standard test circuit benchmarks, MCNC and GSRC, demonstrate that the proposed deep reinforcement learning floorplanning algorithm based on sequence pairs can produce a superior solution.

APA, Harvard, Vancouver, ISO, and other styles

3

HE, RUINING, GUOQIANG LIANG, YUCHUN MA, YU WANG, and JINIAN BIAN. "UNIFICATION OF PR REGION FLOORPLANNING AND FINE-GRAINED PLACEMENT FOR DYNAMIC PARTIALLY RECONFIGURABLE FPGAS." Journal of Circuits, Systems and Computers 22, no. 04 (April 2013): 1350020. http://dx.doi.org/10.1142/s0218126613500205.

Full text

Abstract:

Dynamic Partially Reconfiguration (DPR) designs provide additional benefits compared to traditional FPGA application. However, due to the lack of support from automatic design tools in current design flow, designers have to manually define the dimensions and positions of Partially Reconfigurable Regions (PR Regions). The following fine-grained placement for system modules is also limited because it takes the floorplanning result as a rigid region constraint. Therefore, the manual floorplanning is laborious and may lead to inferior fine-grained placement results. In this paper, we propose to integrate PR Region floorplanning with fine-grained placement to achieve the global optimization of the whole DPR system. Effective strategies for tuning PR Region floorplanning and apposite analytical evaluation models are customized for DPR designs to handle the co-optimization for both PR Regions and static region. Not only practical reconfiguration cost and specific reconfiguration constraints for DPR system are considered, but also the congestion estimation can be relaxed by our approach. Especially, we established a two-stage stochastic optimization framework which handles different objectives in different optimization stages so that automated floorplanning and global optimization can be achieved in reasonable time. Experimental results demonstrate that due to the flexibility benefit from the unification of PR Region floorplanning and fine-grained placement, our approach can improve 20.9% on critical path delay, 24% on reconfiguration delay, 12% on congestion, and 8.7% on wire length compared to current DPR design method.

APA, Harvard, Vancouver, ISO, and other styles

4

PEDRAM, MASSOUD, and ERNEST S. KUH. "BEAR-FP: A ROBUST FRAMEWORK FOR FLOORPLANNING." International Journal of High Speed Electronics and Systems 03, no. 01 (March 1992): 137–70. http://dx.doi.org/10.1142/s0129156492000060.

Full text

Abstract:

This paper presents a hierarchical floorplanning approach for macrocell layouts which is based on the bottom-up clustering, shape function computation, and top-down floorplan optimization with integrated global routing and pin assignment. This approach provides means for specifying and techniques for satisfying a wide range of constraints (physical, topological, timing) and is, therefore, able to generate floorplans for a number of different layout styles. A systematic and efficient optimization procedure during the selection of suitable floorplan patterns that integrates floorplanning, global routing and pin assignment, a new pin assignment technique based on linear assignment and driven by the global routing solution and floorplan topology, and an effective timing-driven floorplanning scheme are among the other novel features of the floorplanner. These techniques have been incorporated in BEAR-FP, a macrocell layout system developed at the University of California, Berkeley. Results on various placement and floorplanning benchmarks are quite good.

APA, Harvard, Vancouver, ISO, and other styles

5

Jiang, Zhongjie, Zhiqiang Li, and Zhenjie Yao. "Multi-Objective Optimization in 3D Floorplanning." Electronics 13, no. 9 (April 27, 2024): 1696. http://dx.doi.org/10.3390/electronics13091696.

Full text

Abstract:

Three-dimensional integrated circuits can significantly mitigate the challenges posed by shrinking feature sizes and enable heterogeneous integration. This paper focuses on the 3D floorplanning problem. We formulate it as a multi-objective optimization issue and employ multi-objective simulated annealing to simultaneously optimize area, wirelength and number of vias. During the optimization process, neighboring solutions are explored in the design space through inter-layer or intra-layer perturbations, and decision criteria for the exploration process are formulated based on the dominance relationship of solutions. Test results on the GSRC benchmark demonstrate that our approach delivers superior performance in optimizing area and wirelength. Compared to 2D floorplanning, our method reduces the area by approximately 49% and the wirelength by 21%. Compared to other similar 3D floorplanning methods, we raise the success rate in satisfying the fixed-outline constraint to 100% and improve the wirelength by 3%. The multi-objective simulated annealing method proposed in this paper can effectively address the 3D floorplanning problem.

APA, Harvard, Vancouver, ISO, and other styles

6

Xiang, H., X. Tang, and M. D. F. Wong. "Bus-Driven Floorplanning." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23, no. 11 (November 2004): 1522–30. http://dx.doi.org/10.1109/tcad.2004.836728.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ma, Qiang, Zaichen Qian, Evangeline F. Y. Young, and Hai Zhou. "MSV-Driven Floorplanning." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 30, no. 8 (August 2011): 1152–62. http://dx.doi.org/10.1109/tcad.2011.2131890.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

WANG, LIN. "FAST ALGORITHMS FOR THERMAL-AWARE FLOORPLANNING." Journal of Circuits, Systems and Computers 23, no. 07 (June 2, 2014): 1450098. http://dx.doi.org/10.1142/s0218126614500984.

Full text

Abstract:

Thermal-aware floorplanning is an effective way to solve the thermal problem in modern integrated circuit (IC) designs. Existing thermal-aware floorplanning methods are all based on simulated annealing (SA), genetic algorithms (GAs) or linear programming (LP), which are quite time-consuming. In this paper, we propose two fast algorithms for thermal-aware floorplanning, a greedy algorithm based on the less-flexibility-first (LFF) principle and a hybrid algorithm combining the greedy algorithm and an SA-based refinement. The greedy algorithm can fast obtain a locally optimized floorplan with reduced area and temperature. The hybrid method can get similar results compared with pure SA-based approaches but it is still much faster.

APA, Harvard, Vancouver, ISO, and other styles

9

Laudis, Lalin L., and Amit Kumar Sinha. "Metaheuristic Approach for VLSI 3D-Floorplanning." International Journal of Scientific Research 2, no. 12 (June 1, 2012): 202–3. http://dx.doi.org/10.15373/22778179/dec2013/62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Balasubramanian, Srinath, Arunapriya Panchanathan, Bharatiraja Chokkalingam, Sanjeevikumar Padmanaban, and Zbigniew Leonowicz. "Module Based Floorplanning Methodology to Satisfy Voltage Island and Fixed Outline Constraints." Electronics 7, no. 11 (November 15, 2018): 325. http://dx.doi.org/10.3390/electronics7110325.

Full text

Abstract:

Multiple supply voltage is the most prevalent method for low power reduction in the design of modern Integrated circuits. Floorplanning process in this design performs positioning of functional blocks in the layout satisfying both fixed outline and voltage island constraints. The floorplans while satisfying these two significant constraints causes significant rise in wirelength and congestion. In this paper, a congestion and wirelength aware floorplanning algorithm is proposed which allows effective placement of functional blocks in the layout to satisfying fixed outline and voltage island constraints simultaneously. To perform voltage island floorplanning, the proposed algorithm uses Skewed binary tree representation scheme to operate the functional blocks in its predefined voltage level. The proposed methodology determines the feasible dimensions of the functional blocks in the representation which aids the placement process for the reduction of congestion and wirelength. With these optimal dimensions of the functional blocks, floorplanning is also performed for the layouts of aspect 1:1, 2:1, and 3:1, to evaluate the ability of proposed algorithm for satisfying the fixed outline constraint. The proposed methodology is implemented in the layout of InternationalWorkshop on Logic and Synthesis (IWLS) benchmarks circuits for experimental purpose. The resulting floorplans were iteratively optimized for optimal reduction of wirelength and congestion. Experimental results show that the proposed methodology outperforms existing state-of-the-art approaches in wirelength reduction by about 18.65% and in congestion reduction by around 63%, while delivering the 30.35% power consumption.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Floorplanning"

1

Perumalla, Anvesh Kumar. "A Genetic Algorithm for ASIC Floorplanning." Wright State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=wright1484236480221006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Quiring, Artur [Verfasser]. "Routing-driven Multiobjective 3D Floorplanning / Artur Quiring." München : Verlag Dr. Hut, 2016. http://d-nb.info/1120763010/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chow, Chee-Seng. "Phoenix : an interactive hierarchical topological floorplanning placer." Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/77677.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; and, (B.S.)--Massachusetts Institute of Technology, Dept. of Physics; and, (B.S.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.
Bibliography: leaf 141.
by Chee-Seng Chow.
M.S.
B.S.

APA, Harvard, Vancouver, ISO, and other styles

4

Pang, Yingxin. "Floorplanning algorithms for VLSI physical design automation /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9970677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chandrasekharan, Athira. "Accelerating Incremental Floorplanning of Partially Reconfigurable Designs to Improve FPGA Productivity." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/34499.

Full text

Abstract:

FPGA implementation tool turnaround time has unfortunately not kept pace with FPGA density advances. It is difficult to parallelize place-and-route algorithms without sacrificing determinism or quality of results. We approach the problem in a different way for development environments in which some circuit speed and area optimization may be sacrificed for improved implementation and debug turnaround. The PATIS floorplanner enables dynamic modular design, which accelerates non-local changes to the physical layout arising from design exploration and the addition of debug circuitry. We focus in this work on incremental and speculative floorplanning in PATIS, to accommodate minor design changes and to proactively generate possible floorplan variants. Current floorplan topology is preserved to minimize ripple effects and maintain reasonable module aspect ratios. The design modules are run-time reconfigurable to enable concurrent module implementation by independent invocations of the standard FPGA tools running on separate cores or hosts.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

6

Raja, Gopalan Sureshwar. "Timing-Aware Automatic Floorplanning of Partially Reconfigurable Designs for Accelerating FPGA Productivity." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/34993.

Full text

Abstract:

FPGA implementation tool speed has not kept pace with the increase in design size and FPGA density. It is difficult to parallelize place-and-route algorithms without sacrificing determinism or quality of results. We address the implementation problem using a divide-and-conquer approach. The PATIS automatic floorplanner enables dynamic modular design, which sacrifices some design speed and area optimization for faster implementation of layout changes, including addition of debug logic. Automatic generation of a timing-driven floorplan for a partially reconfigurable design aims to remove the need for implementation iterations to meet all constraints. Floorplan speculation may anticipate small changes to a design. Although PATIS supports incremental design, complete re-implementation is still rapid because the partial bitstream for each block is generated by independent concurrent invocations of the standard Xilinx tools.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

7

Almohanadi, A. H. "Application of analytical placement techniques for floorplanning in VLSI design." Thesis, University of Kent, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Iyer, Krishnakumar R. "Tabu search algorithm for a thermal aware VLSI floorplanning application." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1384426610.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Healy, Michael Benjamin. "Performance and Temperature Aware Floorplanning Optimization for 2D and 3D Microarchitectures." Thesis, Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10562.

Full text

Abstract:

The main objective of this thesis is to develop a physical design tool that is capable of being used by microarchitects to evaluate the impact of their design decisions on the physical design aspects of future microprocessor development. For deep submicron technology wire delay will scale increasingly badly compared to gate delay and so will become a major bottleneck to performance improvement. Three dimensional integrated circuits (3D ICs) offer a new method of dealing with non-linear wire latency by allowing shorter interconnects that act within their linear region. Thermal considerations in 3D ICs will be more important than traditional designs however, so this problem must also be addressed. This thesis presents a microarchitectural floorplanning tool that will help computer architects to attack the wire delay problem early in the design stages of higher performance microprocessors by including consideration of design for 3D ICs. Consideration of the new problems that occur due to the move to 3D and inherent difficulties with deep submicron design is included. Experiments demonstrate that this tool can generate microprocessor floorplans that include many objectives and continue to enhance performance into the next generation of high performance design.

APA, Harvard, Vancouver, ISO, and other styles

10

Fernando, Pradeep R. "Genetic algorithm based two-dimensional and three-dimensional floorplanning for VLSI ASICs." [Tampa, Fla] : University of South Florida, 2006. http://purl.fcla.edu/usf/dc/et/SFE0001549.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Floorplanning"

1

Jabri, Marwan A. An Artificial Intelligence Approach to Integrated Circuit Floorplanning. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-84489-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

An artificial intelligence approach to integrated circuit floorplanning. Berlin: Springer-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jabri, Marwan A. Artificial Intelligence Approach to Integrated Circuit Floorplanning. Springer London, Limited, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

An Artificial Intelligence Approach to Integrated Circuit Floorplanning. Springer, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Floorplanning"

1

Lienig, Jens. "Floorplanning." In Layoutsynthese elektronischer Schaltungen, 61–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49815-6_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lee, Seungjun, and Jan Rabaey. "Interactive Floorplanning." In The Kluwer International Series in Engineering and Computer Science, 103–26. Boston, MA: Springer US, 1992. http://dx.doi.org/10.1007/978-1-4615-3570-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jabri, Marwan A. "Integrated Circuit Floorplanning." In Lecture Notes in Engineering, 9–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-84489-8_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lengauer, Thomas. "Placement, Assignment, and Floorplanning." In Combinatorial Algorithms for Integrated Circuit Layout, 303–77. Wiesbaden: Vieweg+Teubner Verlag, 1990. http://dx.doi.org/10.1007/978-3-322-92106-2_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Emmert, John M., Akash Randhar, and Dinesh Bhatia. "Fast floorplanning for FPGAs." In Lecture Notes in Computer Science, 129–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055240.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sherwani, Naveed A. "Placement, Floorplanning and Pin Assignment." In Algorithms for VLSI Physical Design Automation, 159–203. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4757-2219-2_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Hung-Ming, Martin D. F. Wong, Hai Zhou, Fung-Yu Young, Hannah H. Yang, and Naveed Sherwani. "Integrated Floorplanning and Interconnect Planning." In Network Theory and Applications, 1–18. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-3415-7_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sherwani, Naveed. "Placement, Floorplanning and Pin Assignment." In Algorithms for VLSI Physical Design Automation, 175–221. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2351-2_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Deng, Yangdong Steve, and Wojciech P. Maly. "Floorplanning for 2.5-D Integration." In 3-Dimensional VLSI, 83–116. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-04157-0_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Koranne, Sandeep. "Floorplanning: VLSI and other Applications." In Practical Computing on the Cell Broadband Engine, 401–7. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-1-4419-0308-2_21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Floorplanning"

1

Hua Xiang, Xiaoping Tang, and M. D. F. Wong. "Bus-Driven Floorplanning." In ICCAD-2003. International Conference on Computer Aided Design. IEEE, 2003. http://dx.doi.org/10.1109/iccad.2003.159672.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Feng, Yan, Dinesh P. Mehta, and Hannah Yang. "Constrained "Modern" Floorplanning." In the 2003 international symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/640000.640030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Kahng, Andrew B. "Classical floorplanning harmful?" In the 2000 international symposium. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/332357.332401.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Casu, Mario R., and Luca Macchiarulo. "Floorplanning for throughput." In the 2004 international symposium. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/981066.981081.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xu, Gang, Ruiqi Tian, Martin D. Wong, and Alfred J. Reich. "Shuttle mask floorplanning." In Photomask Technology, edited by Kurt R. Kimmel and Wolfgang Staud. SPIE, 2003. http://dx.doi.org/10.1117/12.517568.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Browning, David, Ayman El Ansary, and Mohamed Shalaby. "System floorplanning optimization." In 2011 International Conference on Energy Aware Computing (ICEAC 2011). IEEE, 2011. http://dx.doi.org/10.1109/iceac.2011.6403631.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Browning, David W., Ayman M. El Ansary, and Mohamed Shalaby. "System floorplanning optimization." In 2012 International Conference on Energy Aware Computing (ICEAC). IEEE, 2012. http://dx.doi.org/10.1109/iceac.2012.6471007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cheng, Chung-Kuan, Frank M. Johannes, and Malgorzata Marek-Sadowska. "Session details: Floorplanning." In DAC04: The 41st Annual Design Automation Conference 2004. New York, NY, USA: ACM, 2004. http://dx.doi.org/10.1145/3246096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Scheffer, Lou. "Session details: Floorplanning." In ISPD04: International Symposium on Physical Design 2004. New York, NY, USA: ACM, 2004. http://dx.doi.org/10.1145/3248500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cong, J. "Session details: Floorplanning." In ISPD05: International Symposium on Physical Design 2005. New York, NY, USA: ACM, 2005. http://dx.doi.org/10.1145/3249483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Floorplanning"

1

Sankaranarayanan, Karthik, Sivakumar Velusamy, Kevin Skadron, and Mircea Stan. Microarchitectural Floorplanning for Thermal Management: A Technical Report. Fort Belvoir, VA: Defense Technical Information Center, May 2005. http://dx.doi.org/10.21236/ada436653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mohapatra, Sucheta. Dynamic Through-Silicon Via Clustering in 3D IC Floorplanning for Early Performance Optimization. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.7437.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!