Redundancy removal using quasi-algebraic methods
First Claim
1. A computer-based method for optimizing the ultimate implementation of a logic network by identifying redundancies in signal paths caused by reconverging signals, comprising the steps of:
- (a) identifying Boolean sum and product nodes in a database model of a logic network;
(b) determining whether a convergent signal exists for each of said Boolean sum and product nodes;
(c) identifying a redundant term for each of said Boolean sum and product nodes having a convergent signal; and
(d) removing said redundant term from said database model.
1 Assignment
0 Petitions
Accused Products
Abstract
A method is provided to remove redundancies in multi-level logic networks caused by reconverging signals at Boolean sum and product nodes. Generally, sum and product nodes which have potential redundancies are first identified. For each reconvergent signal at each of the nodes, it is determined whether it introduces redundancies using nondestructive Boolean analysis. No two-level expansion is made of the logic network. Moreover, for each confirmed redundancy, a redundant term is identified using Boolean analysis. Finally, the redundancy is removed, if desirable.
-
Citations
22 Claims
-
1. A computer-based method for optimizing the ultimate implementation of a logic network by identifying redundancies in signal paths caused by reconverging signals, comprising the steps of:
-
(a) identifying Boolean sum and product nodes in a database model of a logic network; (b) determining whether a convergent signal exists for each of said Boolean sum and product nodes; (c) identifying a redundant term for each of said Boolean sum and product nodes having a convergent signal; and (d) removing said redundant term from said database model. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer system having access to a computer readable medium which has computer program logic recorded thereon, said logic establishing a network configuration in accordance with a plurality of protocols of a network architecture, said computer system comprising:
-
first means for identifying Boolean sum and product nodes in a database model of a logic network; means for determining whether a convergent signal exists for each of said Boolean sum and product nodes; second means for identifying a redundant term for each of said Boolean sum and product nodes having a convergent signal; and means for removing said redundant term from said database model. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A method for removing redundancies in a logic network, comprising the steps of:
-
(1) building a logic model of the logic network; (2) analyzing said logic model in order to generate a list of sum nodes and product nodes, wherein said list only contains sum nodes and product nodes that have a potential redundancy; (3) identifying redundancies in said logic model by analyzing all pin pairs of said sum nodes and said product nodes, wherein for each pair of pins said identifying step includes, (i) selecting a pair of pins; (ii) identifying a leaf set for each pin in said pair of pins; (iii) comparing said leaf sets to determine whether said leaf sets have any leaves in common, wherein a common leaf is indicative of a redundancy; and (iv) performing a Boolean analysis on said redundancy to determine a redundant term; and (4) removing said redundant term from said logic network. - View Dependent Claims (20, 21, 22)
-
Specification