Techniques for efficiently implementing totally self-checking checkers in MOS technology

DOI10.1016/0898-1221(87)90083-6MaRDI QIDQ1101080zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1987

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/26970

zbMATH Keywords

m-out-of-n and Berger code checkersreducing the transistor count of MOS implementations of totally self- checking (TSC) checkers

Mathematics Subject Classification ID

Review text

This paper presents some new techniques for reducing the transistor count of MOS implementations of totally self-checking (TSC) checkers. The techniques are (1) transfer of fanouts, (2) removal of inverters and (3) use of multi-level realizations of functions. These techniques also increase the speed of the circuit and may reduce the number of required tests. Their effectiveness has been demonstrated by applying them to m- out-of-n and Berger code checkers. Impressiive reductions of up to 90 \% in the transistor count in some cases have been obtained for the MOS implementation of these checkers. This directly translates into saving of ship area.

Recommendations

• Efficient totally self-checking checkers for a class of Borden codes
• On TSC checkers for m-out-of-n codes
• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• Design of maximum-speed self-checking m-out-of-n checkers
• PLA Implementation of k-out-of-n Code TSC Checker

Cites work

• Complete Test Sets for Logic Functions
• Design of Self-Checking MOS-LSI Circuits: Application to a Four-Bit Microprocessor
• Efficient Design of Self-Checking Checker for any m-Out-of-n Code
• Note on Self-Checking Checkers
• On Totally Self-Checking Checkers for Separable Codes
• Techniques for efficiently implementing totally self-checking checkers in MOS technology

Cited in

(8)

• Universal algorithm for synthesizing self-checking testers for constant- weight codes
• Techniques for efficiently implementing totally self-checking checkers in MOS technology
• Study of combinational self-checking devices with independent and monotonic independent outputs
• PLA Implementation of k-out-of-n Code TSC Checker
• scientific article; zbMATH DE number 3869228 (Why is no real title available?)
• A Theory of Totally Self-Checking System Design
• Efficient totally self-checking checkers for a class of Borden codes
• Low-cost modular totally self-checking checker design for m-out-of-n code

This page was built for publication: Techniques for efficiently implementing totally self-checking checkers in MOS technology

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