Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2006-09-05
2006-09-05
Chiang, Jack (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000
Reexamination Certificate
active
07103868
ABSTRACT:
Boolean circuits are designed with minimal depth by calculating the depth of an existing circuit. Those subtrees having a non-regular root cell (i.e., cells having other than one child or having a child of a type different from the cell) are balanced by constructing a new subtree. The cells are then iteratively transformed with parent and/or grandparent cells to reduce the depth of the circuit. The transformation may include balancing the subtree to make the parent cell the same type as the selected cell, or by creating a new cell as parent to the selected cell.
REFERENCES:
patent: 4998219 (1991-03-01), Frauenglass
patent: 5721809 (1998-02-01), Park
patent: 6124736 (2000-09-01), Yamashita et al.
patent: 6505322 (2003-01-01), Yamashita et al.
patent: 6931424 (2005-08-01), Joseph
patent: 2003/0084411 (2003-05-01), Moskewicz et al.
patent: 2004/0060019 (2004-03-01), Secatch et al.
Chaudhary, Kamal et al., “A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Contraints”, Proceedings, 29thACE/IEEE Design Automation Conference, 1992, pp. 492-498
Chaudhary, Kamal et al., “Computing the Area vesus Delay Trade-Off Curves in Technology Mapping”, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 14, No. 12, Dec. 1995, pp. 1480-1488.
Timing-Driven Logic Bi-Decomposition, Jun. 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits, vol. 22, iss. 6, pp. 675-685—Author(s)—Cortadella.
Andreev Alexander E.
Nikitin Andrey A.
Chiang Jack
Dimyan Magid Y.
LSI Logic Corporation
Westman Champlin & Kelly
LandOfFree
Optimizing depths of circuits for Boolean functions does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Optimizing depths of circuits for Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing depths of circuits for Boolean functions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3578645