Method of minimizing area for fanout chains in high-speed networ

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

H03K 1920

Patent

active

056489110

ABSTRACT:
The method for efficiently providing an optimized fanout network includes the steps of providing a series chain of inverters for driving a number of loads. Each load is assigned to a given location of the inverter chain according to the polarity and the required time of the load. Tree-covering techniques are used in conjunction with dynamic programming to minimize the total area of the fanout chain by selecting and sizing the gates to be used in the fanout chain. With such an arrangement, a minimal area fanout chain which satisfies the timing constraints of each load is provided.

REFERENCES:
patent: 4625127 (1986-11-01), Lee et al.
patent: 4882698 (1989-11-01), Young
patent: 5043914 (1991-08-01), Nishiyama et al.
patent: 5218551 (1993-06-01), Agrawal et al.
patent: 5245549 (1993-09-01), Shoji et al.
patent: 5317601 (1994-05-01), Riordan et al.
Chaudhary, Kamal et al, A Near Optimal Algorithm for Technology Mapping Minimizing Area Under Delay Constraints; 29th ACM/IEEE Design Automation Conference, IEEE Computer Society Press, paper 30.4, Jun. 1992, pp. 492-498.
Detjeus, Ewald, et al., Technology Mapping in MIS, IEEE International Conference on Computer-Aided Design (ICCAD-87), Computer Society Press of IEEE, 1987, pp. 116-119.
Fishburn, John P., LATTIS: An Iterative Speedup Heuristic for Mapped Logic, 29th ACM/IEEE Design Automation Conference, IEEE Computer Society Press, paper 30.3, pp. 488-491.
Kodandapani, K. et al, A Simple Algorithm for Fanout Optimization using High-Performance Buffer Libraries, presented Nov. 8th at International Conference of Computer Aided Design (ICCAD-93), California, 1993, pp. 1-6.
Sapatnekar, Sachin Suresh, A Convex Programming Approach to Problems in VLSI Design, University of Illinois at Urbana-Champain, Ph. D. Thesis, 1992, pp. 1-169.
Touati, Herve' J., Performance-Oriented Technology Mapping, University of California, Berkeley, Ph. D. Thesis, 1990, pp. 1-139.
Lin et al., "A Fast and Efficient Algorithm for Determining Fanout Trees in Large Networks", European Design Automation Conference, 1991, pp. 539-544.
Lioy, "On the Equivalence of Fanout-Point Faults", IEEE Transactions on Computers, Mar. 1993, pp. 268-271.
Gupta et al., "Timing Optimizations in a High-Level Synthesis System", Custom Integrated Circuits Conference, 1990, pp. 14.1.1-14.1.4.
Min et al., "FanHat: Fanout Oriented Hierarchical Automatic Test Generation System", University of Texas at Austin, 1989, pp. 470-473.
Fishburn, "LATTIS: An Iterative Speedup Heuristic for Mapped Logic", Design Automation Conference, 1992, pp. 488 491.
Cong, "An Improved Graph-Based FPGA Technology Mapping Algorithm for Delay Optimization", Computer Design ICCD '92, 1992, pp. 154-158.
Singh et al., "A Heuristic Algorithm for the Fanout Problem", Design Automation Conference, 1990, pp. 357-360.
Chaudhary, "A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints", Design Automation Conference, 1992, pp. 492-498.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method of minimizing area for fanout chains in high-speed networ does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of minimizing area for fanout chains in high-speed networ, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of minimizing area for fanout chains in high-speed networ will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1496412

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.