Abstract
Delay optimization has recently attracted significant attention. However, few studies have focused on the delay optimization of mixed-polarity Reed-Muller (MPRM) logic circuits. In this paper, we propose an efficient delay optimization approach (EDOA) for MPRM logic circuits under the unit delay model, which can derive an optimal MPRM logic circuit with minimum delay. First, the simplest MPRM expression with the fewest number of product terms is obtained using a novel Reed-Muller expression simplification approach (RMESA) considering don’t-care terms. Second, a minimum delay decomposition approach based on a Huffman tree construction algorithm is utilized on the simplest MPRM expression. Experimental results on MCNC benchmark circuits demonstrate that compared to the Berkeley SIS 1.2 and ABC, the EDOA can significantly reduce delay for most circuits. Furthermore, for a few circuits, while reducing delay, the EDOA incurs an area penalty.
| Original language | English |
|---|---|
| Pages (from-to) | 1102-1115 |
| Number of pages | 14 |
| Journal | Frontiers of Computer Science |
| Volume | 13 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Oct 2019 |
Keywords
- Huffman tree construction algorithm
- delay optimization
- don’t-care terms
- mixed-polarity Reed-Muller logic circuits
- unit delay model
Fingerprint
Dive into the research topics of 'EDOA: an efficient delay optimization approach for mixed-polarity Reed-Muller logic circuits under the unit delay model'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver