Design of VHDL-based totally self-checking finite-state machine and data-path descriptions

Citation
C. Bolchini et al., Design of VHDL-based totally self-checking finite-state machine and data-path descriptions, IEEE VLSI, 8(1), 2000, pp. 98-103
Citations number
20
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS
ISSN journal
10638210 → ACNP
Volume
8
Issue
1
Year of publication
2000
Pages
98 - 103
Database
ISI
SICI code
1063-8210(200002)8:1<98:DOVTSF>2.0.ZU;2-3
Abstract
This paper presents a complete methodology to design a totally self-checkin g (TSC) sequential system based on the generic architecture of finite-state machine and data path (FSMD), such as the one deriving from VHDL specifica tions. The control part of the system is designed to be self-checking by ad opting a state assignment providing a constant Hamming distance between eac h pair of binary codes. The design of the data path is based on both classi cal methodologies (e.g., parity, Berger code) and ad hoc strategies (e.g., multiplexer cycle) suited for the specific circuit structure. Self-checking properties and costs are evaluated on a set of benchmark FSM's and on a nu mber of VHDL circuits.