Synthesis of self-checking checkers for codes with addition
From MaRDI portal
The authors develop methods of synthesizing (n,k)-checkers that comprise control sums that establish whether a binary vector belongs to a code with addition. Results of application of the methods are given.
Recommendations
- scientific article; zbMATH DE number 4123679
- Synthesis of self-checking combination devices based on allocating special groups of outputs
- Design of maximum-speed self-checking m-out-of-n checkers
- Universal algorithm for synthesizing self-checking testers for constant- weight codes
- Design of self-checking checkers for 1-out-of-3 codes
Cited in
(11)- Design of self-checking checkers for 1-out-of-3 codes
- Synthesis of self-checking combination devices based on allocating special groups of outputs
- Applications of modular summation codes to concurrent error detection systems for combinational Boolean circuits
- Reflections about a single checksum
- Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
- scientific article; zbMATH DE number 4123679 (Why is no real title available?)
- scientific article; zbMATH DE number 824665 (Why is no real title available?)
- On Codes for Checking Logical Operations
- On Checking an Adder
- Design of maximum-speed self-checking m-out-of-n checkers
- Universal synthesis algorithm for 1/n testers
This page was built for publication: Synthesis of self-checking checkers for codes with addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083434)