Optimizing method for logic circuit and logic circuit optimizing system

Claim 2

A logic circuit partitioning system comprising: logic circuit network generating means for inputting a logical expression group comprising one or more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; matrix generating means for inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; matrix partitioning means for inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating means; and logic circuit network partitioning means for partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network.

Claim 3

A logic circuit partitioning system as set forth in claim 1, wherein said logic circuit network partitioning means compares the matrix generated by said matrix generating means and the partial matrix extracted by said matrix partitioning means to detect mutually matching row, and the node on said logic circuit network corresponding to the matched row into the logical expression group.

Claim 4

A logic circuit partitioning system as set forth in claim 1, which further comprises transitional fan-in matrix generating means for detecting a row corresponding to the node having a transitional fan-in in said logic circuit network, among the matrix generated by said matrix generating means and generating a transitional fan-in matrix taking a transitional fan-in row obtained from a logical OR of said row and the row which transfers the transitional fan-in to said row in question as a row element, and wherein said matrix partitioning means extracts said partial matrix from said transitional fan-in matrix generated by said transitional fan-in matrix generating means in place of the matrix generated by said matrix generating means.

Claim 5

A logic circuit partitioning system as set forth in claim 3, wherein said transitional fan-in matrix partitioning means repeats detection of said transitional fan-in with respect to one row within a range satisfying a predetermined constraint.

Claim 6

A logic circuit partitioning system as set forth in claim 4, wherein said predetermined constraint is a maximum value of number of elements as a result of logical OR of the row corresponding the node having said transitional fan-in and the row corresponding to the node associated with said transitional fan-in, and said transitional fan-in matrix generating means repeats detection of said transitional fan-in within a range where said number of elements of the result of logical OR does not exceed said maximum value.

Claim 7

A logic circuit partitioning system as set forth in claim 4, wherein said predetermined constraint is a maximum value of the number of levels of said transitional fan-in, and said transitional fan-in matrix generating means repeats detection of said transitional fan-in within a range where the number of levels of said transitional fan-in does not exceed said maximum value.

Claim 8

A logic circuit partitioning system as set forth in claim 4, wherein said transitional fan-in matrix generating means terminates detection of the transitional fan-in for the row in question when the transition fan-in of the row in question reaches the main input of the logic circuit network.

Claim 9

A logic circuit partitioning method comprising the steps of: inputting a logical expression group comprising one or more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating step; and partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network.

Claim 10

A logic circuit partitioning method comprising the steps of: inputting a logical expression group comprising one or more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating step; and partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network.

Claim 11

A logic circuit partitioning method as set forth in claim 8, which further comprises a step of detecting a row corresponding to the node having a transitional fan-in in said logic circuit network, among the matrix generated by said matrix generating means and generating a transitional fan-in matrix taking a transitional fan-in row obtained from a logical OR of said row and the row which transfers the transitional fan-in to said row in question as a row element, and wherein said step of extracting said partial matrix extracts the partial matrix from said transitional fan-in matrix generated by said transitional fan-in matrix generating step in place of the matrix generated by said matrix generating step.

Claim 12

A logic circuit partitioning method as set forth in claim 9, wherein said transitional fan-in matrix partitioning step is repeated for detection of said transitional fan-in with respect to one row within a range satisfying a predetermined constraint.

Claim 13

A logic circuit partitioning method as set forth in claim 10, wherein said predetermined constraint is a maximum value of number of elements as a result of logical OR of the row corresponding the node having said transitional fan-in and the row corresponding to the node associated with said transitional fan-in, and said transitional fan-in matrix generating step is repeated for detection of said transitional fan-in within a range where said number of elements of the result of logical OR does not exceed said maximum value.

Claim 14

A logic circuit partitioning method as set forth in claim 10, wherein said predetermined constraint is a maximum value of the number of levels of said transitional fan-in, and said transitional fan-in matrix generating means repeats detection of said transitional fan-in within a range where the number of levels of said transitional fan-in does not exceed said maximum value.

Claim 15

A logic circuit partitioning method as set forth in claim 10, wherein said transitional fan-in matrix generating step is terminated detection of the transitional fan-in for the row in question when the transition fan-in of the row in question reaches the main input of the logic circuit network.

Claim 16

A logic circuit optimizing system comprising: logic circuit network generating means for inputting a logical expression group comprising one or more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; matrix generating means for inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; matrix partitioning means for inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating means; logic circuit network partitioning means for partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network; optimizing means for optimizing the partial circuit; logic circuit updating means for updating said logic circuit network by connecting the optimized partial circuit to the corresponding portion of the logic circuit network; and logical expression outputting means for inputting the updated logic circuit network, converting the updated logic circuit network into the logical expression group, and outputting the logical expression group.

Claim 17

A logic circuit optimizing system comprising: logic circuit network generating means for inputting a logical expression group comprising one or more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; matrix generating means for inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; matrix partitioning means for inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating means; logic circuit network partitioning means for partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network; optimizing means for optimizing the partial circuit; logic circuit updating means for updating said logic circuit network by connecting the optimized partial circuit to the corresponding portion of the logic circuit network; and logical expression outputting means for inputting the updated logic circuit network, converting the updated logic circuit network into the logical expression group, and outputting the logical expression group.

Claim 18

A logic circuit optimizing system as set forth in claim 14, wherein said logic optimizing means performs optimization of said logic circuit by executing at least a logic decomposition process.

Claim 19

A logic circuit optimizing system as set forth in claim 14, which further comprises transitional fan-in matrix generating means for detecting a row corresponding to the node having a transitional fan-in in said logic circuit network, among the matrix generated by said matrix generating means and generating a transitional fan-in matrix taking a transitional fan-in row obtained from a logical OR of said row and the row which transfers the transitional fan-in to said row in question as a row element, and wherein said matrix partitioning means extracts said partial matrix from said transitional fan-in matrix generated by said transitional fan-in matrix generating means in place of the matrix generated by said matrix generating means.

Claim 20

A logic circuit optimizing system as set forth in claim 16, wherein said transitional fan-in matrix partitioning means repeats detection of said transitional fan-in with respect to one row within a range satisfying a predetermined constraint.

Claim 21

A logic circuit optimizing method comprising the steps of: inputting a logical expression group comprising one ore more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating means; partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network; optimizing the partial circuit; updating said logic circuit network by connecting the optimized partial circuit to the corresponding portion of the logic circuit network; and inputting the updated logic circuit network, converting the updated logic circuit network into the logical expression group, and outputting the logical expression group.

Claim 22

A logic circuit optimizing method comprising the steps of: inputting a logical expression group comprising one ore more logical expressions and generating a logic circuit network having one or more nodes and branches, wherein each node corresponds to each logical expression and each branch corresponds to a relationship between each logical expression; inputting the generated logical circuit network and generating a matrix comprising rows and columns, wherein each row corresponds to the node in said logical circuit network and each column corresponds to an input of said logical circuit and node, and an arbitrary value is given for each element in the column corresponding to the input for the node corresponding to each row; inputting the generated matrix and extracting a partial matrix containing at least two rows and columns with the arbitrary value at every elements therein from said matrix generated from said matrix generating means; partitioning a partial circuit corresponding to said partial matrix extracted from said matrix, from said logic circuit network; optimizing the partial circuit; updating said logic circuit network by connecting the optimized partial circuit to the corresponding portion of the logic circuit network; and inputting the updated logic circuit network, converting the updated logic circuit network into the logical expression group, and outputting the logical expression group.

Claim 23

A logic circuit optimizing system as set forth in claim 18, wherein said logic optimizing step is performed for optimization of said logic circuit by executing at least a logic decomposition process.

Claim 24

A logic circuit optimizing method as set forth in claim 18, which further comprises a step of detecting a row corresponding to the node having a transitional fan-in in said logic circuit network, among the matrix generated by said matrix generating means and generating a transitional fan-in matrix taking a transitional fan-in row obtained from a logical OR of said row and the row which transfers the transitional fan-in to said row in question as a row element, and wherein said step of extracting said partial matrix extracts the partial matrix from said transitional fan-in matrix generated by said transitional fan-in matrix generating step in place of the matrix generated by said matrix generating step.

Claim 25

A logic circuit optimizing system as set forth in claim 20, wherein said logic optimizing step is performed for optimization of said logic circuit by executing at least a logic decomposition process.