By Topic

An entropy-based algorithm to reduce area overhead for bipartition-codec architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Po-Hung Chen ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Shanq-Jang Ruan ; Kuen-Pin Wu ; Dai-Xun Hu
more authors

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

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference:

2001