Low complexity linear decomposition at the disjoint cubes domain

Authors:
Osnat Keren
Affiliations:
School of Engineering, Bar Ilan University, Isreal
Venue:
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Year:
2006

Citing 4
Cited 0

Calculation of the Rademacher-Walsh spectrum from a reduced representation of Boolean functions

EURO-DAC '92 Proceedings of the conference on European design automation
Finite Orthogonal Series in Design of Digital Devices

Finite Orthogonal Series in Design of Digital Devices
Remarks on calculation of autocorrelation on finite dyadic groups by local transformations of decision diagrams

EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Reduction of sizes of decision diagrams by autocorrelation functions

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear decomposition proved to be efficient technique for reducing the number of terms and literal of two-level implementation of logic functions. The decomposed system consists of linear function followed by nonlinear function of minimal realization cost. The complexity of determining the linear part makes this approach inapplicable for systems of large number of inputs when represented by truth table or decision diagrams. This paper presents a method for linearization of systems represented as a set of disjoint cubes. The reduction in complexity is achieved by a) calculation of the autocorrelation function on the disjoint cubes domain; b) representing the linear part as a superposition of linear transforms of a special form. Experimental benchmark results allow comparing the proposed technique with known linearization methods, and show the high efficiency of the proposed approach.