Please use this identifier to cite or link to this item:
|Title:||Efficient algorithm for the calculation of generalized adding and arithmetic transforms from disjoint cubes of Boolean functions|
|Citation:||Falkowski, B.J.,Chang, C.-H. (1999). Efficient algorithm for the calculation of generalized adding and arithmetic transforms from disjoint cubes of Boolean functions. VLSI Design 9 (2) : 135-146. ScholarBank@NUS Repository.|
|Abstract:||A new algorithm is given that converts a reduced representation of Boolean functions in the form of disjoint cubes to Generalized Adding and Arithmetic spectra. Since the known algorithms that generate Adding and Arithmetic spectra always start from the truth table of Boolean functions the method presented computes faster with a smaller computer memory. The method is extremely efficient for such Boolean functions that are described by only few disjoint cubes and it allows the calculation of only selected spectral coefficients, or all the coefficients can be calculated in parallel.|
|Source Title:||VLSI Design|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.