JOURNAL BROWSE
Search
Advanced SearchSearch Tips
The Low Power Algorithm using a Feasible Clustert Generation Method considered Glitch
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
The Low Power Algorithm using a Feasible Clustert Generation Method considered Glitch
Kim, Jaejin;
  PDF(new window)
 Abstract
In this paper presents a low power algorithm using a feasible cluster generation method considered glitch. The proposed algorithm is a method for reducing power consumption of a given circuit. The algorithm consists of a feasible cluster generation process and glitches removal process. So that glitches are not generated for the node to which the switching operation occurs most frequently in order to reduce the power consumption is a method for generating a feasible cluster. A feasible cluster generation process consisted of a node value set, dividing the node, the node aligned with the feasible cluster generation. A feasible cluster generation procedure is produced from the highest number of nodes in the output. When exceeding the number of OR-terms of the inputs of the selected node CLB prevents the signal path is varied by the evenly divided. If there are nodes with the same number of outputs selected by the first highest number of nodes in the input produces a feasible cluster. Glitch removal process removes glitches through the path balancing in the same manner as [5]. Experimental results were compared with the proposed algorithm [5]. Number of blocks has been increased by 5%, the power consumption was reduced by 3%.
 Keywords
Feasible Cluster;Glitch Removal;CLB;Deviding a Node;Path Balancing;
 Language
Korean
 Cited by
 References
1.
S. Devadas, S. malik, "A Survey of Optimization Techniques Targeting Low Power VLSI Circuits," in Proc. 32nd DAC, June 1995, pp. 242-247.

2.
A. Chandrakasan, T. Sheng, and R. Brodersen, "Low Power CMOS Digital Design," Journal of Solid State Circuits, vol. 27, no. 4, April 1992, pp. 473-484. crossref(new window)

3.
S. ErColani et al., "Testability measures in pseudorandom testing," IEEE Trans. Conputer-Aided Design., vol. 11, 1992, pp. 794-800. crossref(new window)

4.
J. Cong and Y. Ding, "FlowMap : An 'Optimal Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs," IEEE Transactions on Computer-Aided Design of Integrated Circuit and Systems, Vol. 13, No. 1, January 1994, pp.1-11. crossref(new window)

5.
Kwan-Houng Lee, Jin-Gu Kang, Nam-Seo Park, Choong-Mo Yun, Jae-Jin Kim, "A Low Power Communication Circuit Design using Selective Glitch Removal Method," FGCN2008, 2008, pp. 51-56.

6.
Jason Helge Anderson, Stephen Dean Brown, "Technology Mapping for Large Complex PLDs, Design Automation Conference," 1998, pp. 698-703.

7.
M. Hashimoto, H. Onodera, and K. Tamaru, "A partical gate resizing technique considering glitch reduction for low power design," Proc. 1999 Design Automation Conference, June 1999, pp. 446-451.

8.
Hosun Shin, Naeun Zang, Juho Kim, Stochastic Glitch Estimation and Path Balancing for Statistical Optimization, Proc. 2006 IEEE International SoC Conference, September 2006, pp. 85-88.

9.
김유세, "저전력 설계를 위한 경로 상관관계를 고려한 확률적 글리치 예측 및 제거 방법," 서강대학교 대학원, 2007.

10.
E. M. Sentovice et al., SIS : A system for sequential Circuit Synthesis, Technical Report UCM/ERL M92/41, Electronics Research Laboratory, Department of Electrical Engineering and Computer Science, University of California, Berkeley, 1992.