An entropy-based algorithm to reduce area overhead for bipartition-codec architecture
Resource
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Journal
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Pages
-
Date Issued
2001-05
Date
2001-05
Author(s)
Chen, Po-Hung
Ruan, Shanq-Jang
Wu, Kuen-Pin
Hu, Dai-Xun
Lai, Feipei
Tsai, Kun-Lin
DOI
N/A
Abstract
Bipartition-codec scheme has been used as one of the effective power reduction techniques in logic-level circuit design. It treats each output value of a combinational circuit as one state of an FSM, and extracts the most actively transitive states (output) and the corresponding input to build a subcircuit. After bipartitioning the circuit, the encoding technique is used to encode the highly active subcircuit for further power reduction. Although we can get a large amount of power reduction in the previous proposed bipartition algorithm, the area overhead is considerably large. In this paper, we propose an effective heuristic algorithm based on entropy, which offers a theoretical area model to resolve the area overhead problem in the bipartition-codec architecture. The experimental results show that the area can be averagely reduced by 16% with 1.8% marginal power increase compared to the previous proposed probabilistic-driven algorithm.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00921981.pdf
Size
357.56 KB
Format
Adobe PDF
Checksum
(MD5):592d900ceb8ba263b6ed8cc851088e4b