DocumentCode
3149398
Title
Look-up table FPGA realization of m-out-of-n bit voters
Author
Macii, Enrico ; Poncino, Massimo
Author_Institution
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fYear
1994
fDate
25-28 Sep 1994
Firstpage
190
Abstract
Voting is a fundamental operation in the realization of fault-tolerant hardware modules. Different techniques to design bit voters have been proposed in the past; the most common is based on sparse logic implementation of two/multi-level specifications. Though results for these kinds of implementations are optimal or near to optimal in terms of area and speed of the synthesized circuit, physical realization and testing may require a long time. We present results on the implementation of m-out-of-n bit voters at the FPGA level
Keywords
fault tolerant computing; field programmable gate arrays; majority logic; table lookup; area; bit voters design; fault-tolerant hardware modules; look-up table FPGA; m-out-of-n bit voters; sparse logic implementation; speed; testing; two/multi-level specifications; Computer fault tolerance; Computer instructions; Majority logic circuits; Programmable logic arrays;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 1994. Conference Proceedings. 1994 Canadian Conference on
Conference_Location
Halifax, NS
Print_ISBN
0-7803-2416-1
Type
conf
DOI
10.1109/CCECE.1994.405630
Filename
405630
Link To Document