By Topic

Generation of multi-polarity arithmetic transform from reduced representation of Boolean functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. J. Falkowski ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Chip-Hong Chang

A new algorithm is given that converts a reduced representation of Boolean functions in the form of disjoint cubes to multi-polarity arithmetic spectrum. Since the known algorithms that generate arithmetic spectrum always start from the truth table of Boolean functions the method presented computes faster with a smaller required memory. The algorithm 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, of all the coefficients which can be calculated in parallel

Published in:

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on  (Volume:3 )

Date of Conference:

30 Apr-3 May 1995