Minimization algorithms of number logic elements in implementation of linear mappings
In the article, we propose an efficient algorithm to minimize the number of logic elements in the hardware implementation of large size linear mapping, presented by linear Boolean functions (LBF). The essence of the algorithm is to use the structural data on the description of the binary tree to determine the overall logic elements XOR. An algorithm based on obtained binary tree is constructed to synthesize logic schema.