Manipulation and optimisation techniques for Boolean logic

In this study, new techniques and algorithms are presented, for the derivation and optimisation of mixed polarity Reed Muller (MPRM) and mixed polarity dual Reed Muller (MPDRM) functions. The first algorithm is used for bidirectional conversion between fixed polarity dual Reed Muller (FPDRM) and MPD...

Full description

Saved in:
Bibliographic Details
Published inIET computers & digital techniques Vol. 4; no. 3; pp. 227 - 239
Main Authors AL JASSANI, B. A, URQUHART, N, ALMAINI, A. E. A
Format Journal Article
LanguageEnglish
Published Stevenage Institution of Engineering and Technology 01.05.2010
John Wiley & Sons, Inc
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:In this study, new techniques and algorithms are presented, for the derivation and optimisation of mixed polarity Reed Muller (MPRM) and mixed polarity dual Reed Muller (MPDRM) functions. The first algorithm is used for bidirectional conversion between fixed polarity dual Reed Muller (FPDRM) and MPDRM and to derive any polarity from another polarity. The second algorithm is used to generate reduced MPDRM expressions from FPDRM using a new procedure based on tabular techniques. The third algorithm is proposed, for bidirectional conversion between sum of products/product of sums and MPRM/MPDRM forms, respectively. It can also be used to derive any mixed polarity from another MPRM/MPDRM. The last algorithm is to find optimal MPRM/MPDRM among 3^sup n^ different polarities using genetic algorithm for large functions but without generating all the polarity sets. The proposed algorithms are efficient in terms of memory size and CPU time and can be used for large functions. The experimental results are given, using a personal computer with an Intel CPU of 2.4 GHz and 2 GB RAM.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1751-8601
1751-861X
DOI:10.1049/iet-cdt.2009.0007