Minimisation of fixed-polarity AND/XOR canonical networks

TitleMinimisation of fixed-polarity AND/XOR canonical networks
Publication TypeJournal Article
Year of Publication1994
AuthorsTsai, C-C, Marek-Sadowska, M
JournalComputers and Digital Techniques, IEE Proceedings -
Pagination369 -374
Date Publishednov
KeywordsBoolean function, Boolean functions, computational complexity, fixed-polarity AND/XOR canonical networks minimisation, generalised Reed-Muller form, heuristic algorithm, logic circuits, lower-bound time complexity, minimisation, Reed-Muller codes
AbstractA 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