TY - JOUR
T1 - EDOA
T2 - an efficient delay optimization approach for mixed-polarity Reed-Muller logic circuits under the unit delay model
AU - He, Zhenxue
AU - Xiao, Limin
AU - Gu, Fei
AU - Ruan, Li
AU - Huo, Zhisheng
AU - Li, Mingzhe
AU - Zhu, Mingfa
AU - Zhang, Longbing
AU - Liu, Rui
AU - Wang, Xiang
N1 - Publisher Copyright:
© 2018, Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature.
PY - 2019/10/1
Y1 - 2019/10/1
N2 - 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.
AB - 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.
KW - Huffman tree construction algorithm
KW - delay optimization
KW - don’t-care terms
KW - mixed-polarity Reed-Muller logic circuits
KW - unit delay model
UR - https://www.scopus.com/pages/publications/85047130684
U2 - 10.1007/s11704-017-6279-2
DO - 10.1007/s11704-017-6279-2
M3 - 文章
AN - SCOPUS:85047130684
SN - 2095-2228
VL - 13
SP - 1102
EP - 1115
JO - Frontiers of Computer Science
JF - Frontiers of Computer Science
IS - 5
ER -