✦ LIBER ✦

Genetic algorithm for minimisation of fixed polarity Reed-Muller expressions

✍ Scribed by Drechsler, R.; Becker, B.; Drechsler, N.

Book ID: 114448448
Publisher: The Institution of Electrical Engineers
Year: 2000
Tongue: English
Weight: 137 KB
Volume: 147
Category: Article
ISSN: 1350-2387
DOI: 10.1049/ip-cdt:20000743

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reed-Muller tree-based minimisation of f

Reed-Muller tree-based minimisation of fixed polarity Reed-Muller expansions

✍ Aborhey, S. 📂 Article 📅 2001 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 178 KB

Using genetic algorithms for the variabl

Using genetic algorithms for the variable ordering of Reed-Muller binary decision diagrams

✍ A.E.A Almaini; N Zhuang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Algorithms for conversion of minterms to

Algorithms for conversion of minterms to positive polarity Reed-Muller coefficients and vice versa

✍ Md.Mozammel Huq Azad Khan; Md.Shamsul Alam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 458 KB

In this paper, an algorithm for mapping positive polarity Reed-Muller (PPRM) coefficients from canonical sum of products (CSOP) coefficients is presented. Another algorithm for mapping CSOP coefficients is also presented. Both algorithms are more space efficient than the existing algorithms.

Universal test set for detecting stuck-a

Universal test set for detecting stuck-at and bridging faults in double fixed-polarity Reed-Muller programmable logic arrays

✍ Rahaman, H.; Das, D.K. 📂 Article 📅 2006 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 163 KB

Baldwinian learning utilizing genetic an

Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed–Muller (AND–EXOR) forms

✍ Karen M Dill; Marek A Perkowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 126 KB