Issue No.07 - July (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2226
A method is proposed that is based on the partitioning of the input code variables into two sections, each section representing the binary form of a number Z/sub 1/ and Z/sub 2/, respectively. For a code with check base A=2/sup m/-1, two m-bit end-around carry adder trees calculate the modulo m residue of Z/sub 1/ and Z/sub 2/, while a totally self-checking (TSC) translator maps the output of t
totally self-checking checkers; low-cost arithmetic codes; partitioning; trees; gate levels; reliability; error detection codes; fault tolerant computing.
D. Nikolos, G. Philokyprou, "Efficient Design of Totally Self-Checking Checkers for all Low-Cost Arithmetic Codes", IEEE Transactions on Computers, vol.37, no. 7, pp. 807-814, July 1988, doi:10.1109/12.2226