A hyper optimal encoding scheme for self-checking circuits

DOI10.1109/12.537125MaRDI QIDQ4420845zbMATH OpenOpenAlexFDO

Authors Jien-Chung Lo

Publication date 10 November 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.537125, https://digitalcommons.uri.edu/ele_facpubs/819

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Design of maximum-speed self-checking m-out-of-n checkers
• Universal algorithm for synthesizing self-checking testers for constant- weight codes
• Design methods of single-output built-in self-checking circuits for equilibrium codes
• Design of self-checking checkers for 1-out-of-3 codes
• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )

Cited in

(3)

• scientific article; zbMATH DE number 3869228 (Why is no real title available?)
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• scientific article; zbMATH DE number 1498793 (Why is no real title available?)

This page was built for publication: A hyper optimal encoding scheme for self-checking circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420845)