Patent
1997-09-25
1999-10-26
Teska, Kevin
39550004, G06F 1750
Patent
active
059742429
ABSTRACT:
Methods and computer programs for logic circuit design minimization with Identity cell representation is provided which can simplify logic circuit design by combining and minimizing Identity cells and thereby reducing the number of gates in the logic circuit. All possible Identity cells from a given logic function are generated by combining every possible pair of logic terms, then equivalent Identity cell terms are eliminated and the best subset of Identity cell terms which covers all the minterms of the given logic function is provided.
The I-cell term representation is sufficiently broad in its scope to allow representation of sub-functions such as ABC+ABC as a single entity that can be readily used for minimization which may be advantageously used in logic circuit fabrication and design. Since I-cell representation includes sum of products, EXOR, EXNOR and other logic terms, fewer terms will be needed to represent a given Boolean function, and a much more simplified, inexpensive and advantageous optimal logic design structure will be obtained.
REFERENCES:
patent: 4792909 (1988-12-01), Serlet
patent: 5243538 (1993-09-01), Okuzawa et al.
patent: 5522063 (1996-05-01), Ashar et al.
patent: 5524082 (1996-06-01), Horstmann et al.
patent: 5594656 (1997-01-01), Tamisier
patent: 5708594 (1998-01-01), Iwashita et al.
patent: 5734798 (1998-03-01), Allred
patent: 5754454 (1998-05-01), Pixley et al.
patent: 5805462 (1998-09-01), Poirot et al.
Nishitani et al., "Lower bounds on size of periodic functions in exclusivR sum-of-products expressions", IEICE Trans. Fundamentals, vol. E77-A, No. 3, pp. 475-582, Mar. 1994.
Johnson, E.L. et al., "Digital Design: A Pragmatic Approach", PWS Engineering, Boston, Massachusetts, pp. 39-48, Jan. 1987.
Damarla, T. and Karpovsky, M., "Fault Detection in Combinational Networks by Reed-Muller Transforms", IEEE Trans. Computers, vol. 38, No. 6, Jun. 1989, pp. 788-797.
Bryant, Randal E., "Graph-Based Algorithms for Boolean Function Manipulation", IEEE Trans. Computers, vol. C-35, No. 8, Aug. 1986, pp. 677-691.
Damarla T. Raju
Su Wei
Kik Phallaka
Tereschuk George B.
Teska Kevin
The United States of America as represented by the Secretary of
Zelenka Michael
LandOfFree
Methods and computer programs for minimizing logic circuit desig does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods and computer programs for minimizing logic circuit desig, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and computer programs for minimizing logic circuit desig will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-773691