Record Details

Orthogonal partitioning and gated clock architecture for low power realization of FSMs

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Orthogonal partitioning and gated clock architecture for low power realization of FSMs
 
Creator SHELAR, RUPESH S
NARAYANAN, H
DESAI, MP
 
Subject circuit cad
finite state machines
flip-flops
integrated circuit design
integrated logic circuits
logic cad
logic partitioning
low-power electronics
 
Description In this paper we address the issue of low power realization of FSMs using decomposition and gated clock architecture. We decompose the N state machine into two interacting machines with N1, N2 states such that N=N1×N2. Our cost function is the number of self-edges, which is to be maximized. For all the self-edge conditions, the inputs and clock of the respective machine is disabled to reduce the switching activity and therefore, the reduction in power can be achieved. We describe the greedy algorithm which maximizes the cost function. We attempt to keep the area the same by keeping to a minimum the number of flip-flops. We compared the results of our algorithm with JEDI. In one case, we could achieve a power reduction up to 67% with less area as well. Based on the results, we conclude that our approach is suitable for machines with a large number of states and less number of outputs.
 
Publisher IEEE
 
Date 2008-12-18T04:49:07Z
2011-11-27T17:05:21Z
2011-12-15T09:58:25Z
2008-12-18T04:49:07Z
2011-11-27T17:05:21Z
2011-12-15T09:58:25Z
2000
 
Type Article
 
Identifier Proceedings of the 13th Annual IEEE International ASIC/SOC Conference, Arlington, USA, 13-16 September 2000, 266-270.
0-7803-6598-4
10.1109/ASIC.2000.880713
http://hdl.handle.net/10054/387
http://dspace.library.iitb.ac.in/xmlui/handle/10054/387
 
Language en