1988
DOI: 10.1109/12.2226
|View full text |Cite
|
Sign up to set email alerts
|

Efficient design of totally self-checking checkers for all low-cost arithmetic codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0
1

Year Published

1991
1991
2008
2008

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(13 citation statements)
references
References 15 publications
0
12
0
1
Order By: Relevance
“…Now we suppose that an error occurs in the second residue changing the result from 2 to 4 (the error is (0, 2, 0)). The erroneous result is (2,4,0), that corresponds to the integer value 14, that is not divisible by 11.…”
Section: Error Detection In Rns By Using Scaled Valuesmentioning
confidence: 99%
See 1 more Smart Citation
“…Now we suppose that an error occurs in the second residue changing the result from 2 to 4 (the error is (0, 2, 0)). The erroneous result is (2,4,0), that corresponds to the integer value 14, that is not divisible by 11.…”
Section: Error Detection In Rns By Using Scaled Valuesmentioning
confidence: 99%
“…In particular, with respect to the basic arithmetic operations, self-checking adders based on residue codes [1], [2], parity codes [3], or Berger codes [4] have been proposed. With respect to basic DSP building blocks, the RRNS (Redundant Residue Number System) representation has been used in the implementation of FIR filters [5], [6], [7] allowing fault detection and correction.…”
Section: Introductionmentioning
confidence: 99%
“…Due to these facts, since adders are essential building blocks in all data processing systems, the design of arithmetic structures with online error detection and correction capabilities represents an important research topic. In the literature, a number of selfchecking adder implementations have been proposed, such as based on residue codes [3], [4], parity codes, [5], [6], [7], or Berger codes [8]. Other error detection techniques are based on recomputing with shifted [9] and/or rotated operands, as shown in [10], [11].…”
Section: Introductionmentioning
confidence: 99%
“…Altogether, the gate counts for the low-cost 3N code checkers are more pessimistic than in [12]. The gate count numbers for the proposed architecture are also worst case numbers.…”
Section: Comparisonmentioning
confidence: 94%
“…For the design of the low-cost 3N code checker the accumulatorbased method of [11] was chosen. According to this method the checker consists of an end-around-carry adder accumulator and a conventional low-cost 3N code checker which is assumed to be design as described in [12].…”
Section: Comparisonmentioning
confidence: 99%