This Article 
 Bibliographic References 
 Add to: 
Incorporating Yield Enhancement into the Floorplanning Process
June 2000 (vol. 49 no. 6)
pp. 532-541

Abstract—The traditional goals of the floorplanning process for a new integrated circuit have been minimizing the total chip area and reducing the routing cost, i.e., the total length of the interconnecting wires. Recently, it has been shown that, for certain types of chips, the floorplan can affect the yield of the chip as well. Consequently, it becomes desirable to consider the expected yield, in addition to the cost of routing, when selecting a floorplan. The goal of this paper is to investigate the two seemingly unrelated, and often conflicting, objectives of yield enhancement and routing complexity minimization. We analyze the possible trade-offs between the two and then present a constructive algorithm for incorporating yield enhancement as a secondary objective into the floorplanning process, with the main objective still being the minimization of the overall routing costs.

[1] H.B. Bakoglu, Circuits, Interconnections, and Packaging for VLSI Reading, Mass.: Addison-Wesley, 1990.
[2] V. Chankong and Y.Y. Haimes, Multiobjective Decision Making: Theory and Methodology. New York: North-Holland, 1983.
[3] G. Evans, “Overview of Techniques for Solving Multiobjective Mathematical Programs,” Management Science, vol. 30, no. 11, pp. 1,268-1,282, Nov. 1984.
[4] T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout. Chichester, U.K.: Wiley, 1990.
[5] I. Koren, Z. Koren, and C.H. Stapper, "A Unified Negative-Binomial Distribution for Yield Analysis of Defect-Tolerant Circuits," IEEE Trans. Computers, vol. 42, no. 6, pp. 724-733, June 1993.
[6] I. Koren, Z. Koren, and C.H. Stapper, “A Statistical Study of Defect Maps of Large Area VLSI ICs,” IEEE Trans. VLSI Systems, vol. 2, pp. 249-256, June 1994.
[7] I. Koren and Z. Koren, “Floorplanning of Memory ICs: Routing Complexity vs. Yield,” Proc. Int'l Symp. Microelectronic Manufacturing Technologies—Yield, Reliability, and Failure Analysis (MMT04), May 1999.
[8] I. Koren and Z. Koren, “Defect Tolerant VLSI Circuits: Techniques and Yield Analysis,” Proc. IEEE, vol. 86, pp. 1,817-1,836, Sept. 1998.
[9] I. Koren and Z. Koren, “Yield and Routing Objectives in Floorplanning,” Proc. 1998 IEEE Int'l Symp. Defect and Fault Tolerance in VLSI Systems, pp. 28-36, Nov. 1998.
[10] Z. Koren and I. Koren, “On the Effect of Floorplanning on the Yield of Large Area Integrated Circuits,” IEEE Trans. VLSI Systems, vol. 5, pp. 3-14, Mar. 1997.
[11] H. Nakano, M. Nakajima, Y. Nakakura, T. Yoshida, Y. Goi, Y. Nakai, R. Segawa, T. Kishida, and H. Kadota, “An 80-Mflops (Peak) 64-b Microprocessor for Parallel Computer,” IEEE J. Solid–State Circuits, vol. 27, no. 3, pp. 365-372, 1992.
[12] C.H. Stapper, “Defect Density Distribution for LSI Yield Calculations,” IEEE Trans. Electron Devices, vol. 20, pp. 655-657, July 1973.
[13] T. Sugibayashi et al., “A 1-Gb DRAM for File Applications,” IEEE J. Solid-State Circuits, vol. 30, pp. 1,277-1,280, Nov. 1995.
[14] J.D. Gould and C.H. Lewis, "Designing for Usability: Key Principles and What Designers Think," Comm. ACM, vol. 28, no. 3, Mar. 1985, pp. 300-311.
[15] S. Wimer, I. Koren, and I. Cederbaum, “Optimal Aspect Ratios of Building Blocks in VLSI,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 139-145, Feb. 1989.
[16] T. Yamagata et al., “A Distributed Globally Replaceable Redundancy Scheme for Sub-Half-Micron ULSI Memories and Beyond,” IEEE J. Solid-State Circuits, vol. 31, pp. 195-201, Feb. 1996.
[17] J.-H. Yoo et al., “A 32-Bank 1Gb Self-Strobing Synchronous DRAM with 1GB/s Bandwidth,” IEEE J. Solid-State Circuits, vol. 31, pp. 1,635-1,643, Nov. 1996.

Index Terms:
Floorplanning, memory ICs, microprocessor, redundancy, routing complexity, yield.
Israel Koren, Zahava Koren, "Incorporating Yield Enhancement into the Floorplanning Process," IEEE Transactions on Computers, vol. 49, no. 6, pp. 532-541, June 2000, doi:10.1109/12.862213
Usage of this product signifies your acceptance of the Terms of Use.