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

Almaini, A E A; Zhuang, N

Abstract

Results are reported of the use of genetic algorithms for the variable ordering problem in Reed-Muller binary decision diagrams. Tests carried out on benchmark examples and randomly generated functions are very encouraging and compare favourably with other non-exhaustive algorithms. The results show significant reduction in the number of nodes and gates for multi-level designs. The work is confined to single output fixed polarity Reed-Muller expansions: the method will be developed further to extend to other forms and to multi-outputs.

Citation

Almaini, A. E. A., & Zhuang, N. (1995). Using genetic algorithms for the variable ordering of Reed-Muller binary decision diagrams. Microelectronics Journal, 26(5), 471-480. https://doi.org/10.1016/0026-2692%2895%2998949-R

• Journal Article Type: Article
• Publication Date: 1995-07
• Deposit Date: Jun 9, 2009
• Journal: Microelectronics Journal
• Print ISSN: 0026-2692
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 26
• Issue: 5
• Pages: 471-480
• DOI: https://doi.org/10.1016/0026-2692%2895%2998949-R
• Keywords: Switching theory; Genetic algorithms; Computing; Reed-Muller binary decision diagrams; Decision theory; Integrated circuits
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/2651
• Publisher URL: http://dx.doi.org/10.1016/0026-2692(95)98949-R