Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
A comprehensive approach to the partial scan problem using implicit state enumeration
ITC '98 Proceedings of the 1998 IEEE International Test Conference
Guaranteeing Testability in Re-encoding for Low Power
ATS '97 Proceedings of the 6th Asian Test Symposium
Genetic algorithm-based FSM synthesis with area-power trade-offs
Integration, the VLSI Journal
Hi-index | 0.00 |
In order to improve the testabilities and power consumption, a new state assignment technique based on m-block partition is introduced in this paper. The length and number of feedback cycles are reduced with minimal switching activity on the state variables. Experiment shows significant improvement in power dissipation and testabilities for benchmark circuits.