Open AccessAn Efficient Algorithm for the Calculation of Generalized Adding and Arithmetic Transforms From Disjoint Cubes of Boolean Functions
Author(s) -
B.J. Falkowski,
Chip-Hong Chang
Publication year - 1998
Publication title -
vlsi design
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.123
H-Index - 24
eISSN - 1065-514X
pISSN - 1026-7123
DOI - 10.1155/1999/45607
Subject(s) - disjoint sets , boolean function , truth table , algorithm , maximum satisfiability problem , representation (politics) , mathematics , table (database) , boolean expression , discrete mathematics , arithmetic , computer science , data mining , politics , political science , law
A new algorithm is given that converts a reduced representation of Boolean functions inthe form of disjoint cubes to Generalized Adding and Arithmetic spectra. Since theknown algorithms that generate Adding and Arithmetic spectra always start from thetruth table of Boolean functions the method presented computes faster with a smallercomputer memory. The method is extremely efficient for such Boolean functions thatare described by only few disjoint cubes and it allows the calculation of only selectedspectral coefficients, or all the coefficients can be calculated in parallel
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom