DocumentCode
1271597
Title
Efficient polarity conversion for large Boolean functions
Author
Wang, L. ; Almaini, A.E.A. ; Bystrov, A.
Author_Institution
Sch. of Eng., Napier Univ., Edinburgh, UK
Volume
146
Issue
4
fYear
1999
fDate
7/1/1999 12:00:00 AM
Firstpage
197
Lastpage
204
Abstract
The concept of polarity for canonical sum-of-products (SOP) Boolean functions is introduced. This facilitates efficient conversion between SOP and fixed polarity Reed-Muller (FPRM) forms. New algorithms are presented for the bidirectional conversion between the two paradigms. Multiple segment and multiple pointer techniques are employed to achieve fast conversion for large Boolean functions. Experimental results are given using a personal computer with a Cyrix 6×86-166 CPU and 32 MB RAM. The results show that the algorithm is very efficient in terms of time and space for large Boolean functions
Keywords
Boolean functions; Reed-Muller codes; logic design; 32 MB RAM; bidirectional conversion; canonical sum-of-products; fixed polarity Reed-Muller forms; large Boolean functions; multiple pointer techniques; polarity conversion;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:19990525
Filename
806222
Link To Document