A bipartition-codec architecture to reduce power in pipelined circuits

Citation
Sj. Ruan et al., A bipartition-codec architecture to reduce power in pipelined circuits, IEEE COMP A, 20(2), 2001, pp. 343-348
Citations number
12
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
ISSN journal
02780070 → ACNP
Volume
20
Issue
2
Year of publication
2001
Pages
343 - 348
Database
ISI
SICI code
0278-0070(200102)20:2<343:ABATRP>2.0.ZU;2-O
Abstract
This paper proposes a new approach to synthesize pipelined circuits with lo w-power consideration. We treat each output value of a combinational circui t as one state of a finite-state machine (FSM), If the output of a combinat ional circuit transits mainly among some few states, we could extract those states (output) and the corresponding input to build a subcircuit. After b ipartitioning the circuit, we apply the encoding technique to the highly ac tive subcircuit for further power reduction. In this paper, we formulate th e bipartition problem and present a probabilistic-driven algorithm to bipar tition a circuit so as to minimize the power dissipation. Our experimental results show that an average power reduction on several Microelectronic Cen ter of North Carolina (MCNC) benchmarks of 31.6% is achievable.