DocumentCode :
1195821
Title :
Minimisation of fixed-polarity AND/XOR canonical networks
Author :
Tsai, C.-C. ; Marek-Sadowska, M.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
Volume :
141
Issue :
6
fYear :
1994
fDate :
11/1/1994 12:00:00 AM
Firstpage :
369
Lastpage :
374
Abstract :
A method for extracting the cubes of the generalised Reed-Muller (GRM) form of a Boolean function with a given polarity is presented. The method does not require exponential space and time complexity and it achieves the lower-bound time complexity. The proof of the method´s correctness constitutes the first half of the paper. Also, a separate heuristic algorithm to find the optimal polarity that requires the least number of cubes in the GRM representation is proposed. The algorithm is fast and derives the polarity for variables and extracts all cubes simultaneously. It is based on the concept of a Boolean centre for vertices, which emulates the centre of gravity concept in geometry. The experimental results for the heuristic algorithm agree strongly with the authors observations and analysis
Keywords :
Boolean functions; Reed-Muller codes; computational complexity; logic circuits; minimisation; Boolean function; fixed-polarity AND/XOR canonical networks minimisation; generalised Reed-Muller form; heuristic algorithm; lower-bound time complexity;
fLanguage :
English
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2387
Type :
jour
DOI :
10.1049/ip-cdt:19941505
Filename :
331622
Link To Document :
بازگشت