A new synthesis technique of sequential circuits for low power and testing
- Authors
- Cho, Sangwook; Park, Sungju
- Issue Date
- Feb-2004
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- state assignment; testability; low power; test synthesis; scan design
- Citation
- CURRENT APPLIED PHYSICS, v.4, no.1, pp.83 - 86
- Indexed
- SCIE
SCOPUS
KCI
OTHER
- Journal Title
- CURRENT APPLIED PHYSICS
- Volume
- 4
- Number
- 1
- Start Page
- 83
- End Page
- 86
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46620
- DOI
- 10.1016/j.cap.2003.09.017
- ISSN
- 1567-1739
- Abstract
- The state assignment for a finite state machine greatly affects the delay, area, power dissipation, and testabilities of the sequential circuits. In order to improve the testabilities and power consumption, a new state assignment technique based on m-block partition is introduced in this paper. By the m-block partition algorithm, the dependencies among groups of state variables are minimized and switching activity is further reduced by assigning the codes of the states in the same group considering the state transition probability among the states. In the sequel the length and number of feedback cycles are reduced with minimal switching activity on the state variables. It is inherently contradictory problem to optimize the testability and power consumption simultaneously, however our new state assignment technique is able to achieve high fault coverage with less number of scan flip-flops by reducing the number of feedback cycles while the power consumption is kept low upon the low switching activities among state variables. Experiment shows significant improvement in power dissipation with comparable testabilities for benchmark circuits. (C) 2003 Elsevier B.V. All rights reserved.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > SCHOOL OF COMPUTER SCIENCE > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46620)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.