Fault tolerance in a systolic residue arithmetic processor array

Cosentino, Romain

doi:10.1109/12.2239

Cited by 30 publications

(6 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Encryption algorithm: {c j } = {r j } ⊕{K j } mod m (8) Decryption algorithm: {r j }={c j } ⊕{-K j }mod m ={c j } Ĭ {K j } mod m (9) Where -K j is additive inverse of K j mod m The scheme of generating random binary sequence using feed back shift register are discussed in [18]. The same concept can be extended to generate non-binary key sequence.…”

Section: A Additive Ciphermentioning

confidence: 99%

See 1 more Smart Citation

Implementation of stream cipher system based on representation of integers in Residue Number System

Aithal

Bhat

Sripathi

2010

2010 IEEE 2nd International Advance Computing Conference (IACC)

View full text Add to dashboard Cite

Residue Number Systems (RNS) based on ChineseRemainder Theorem (CRT) permits the representation of large integers in terms of combinations of smaller ones. The set of all integers from 0 to M-1 with RNS representation and component wise modular addition and multiplication constitutes direct sum of smaller commutative rings. Encryption and decryption algorithm based on the properties of direct sum of smaller rings offers distinct advantages over decimal or fixed radix arithmetic. In this paper representation of integer using RNS, is successfully utilized in additive, multiplicative and affine stream cipher systems.The property of the cipher system based on RNS number system allow speeding up the encryption / decryption algorithm, reduce the time complexity and provides immunity to side channel, algebraic, and known plain text attacks. In this paper, the characteristics of additive, multiplicative and affine stream cipher systems, the key generation, and encryption and decryption based on RNS number system representation are discussed.

show abstract

Section: A Additive Ciphermentioning

confidence: 99%

“…CRT decomposition is also used in reducing chip area of edge sampler circuit by employing the method of delay technique [7]. RNS systolic approach offers an impressive amount of fault tolerance at low cost in hardware, which is discussed in [8]. The residue number system based on CRT is also used in cryptographic applications.…”

Section: Introductionmentioning

confidence: 99%

Implementation of stream cipher system based on representation of integers in Residue Number System

Aithal

Bhat

Sripathi

2010

2010 IEEE 2nd International Advance Computing Conference (IACC)

View full text Add to dashboard Cite

show abstract

“…An FIR filter has been built and tested by Cosentino to verify this model. 25 The advantage of this technique seems to be that only one output conversion per quintuple would be required. An error calculator has been described, which uses the error syndrome pair as an address such that it outputs the complement of the error.…”

Section: Fault Tolerance Of Systolic Arithmetic Processor Arraysmentioning

confidence: 99%

Fault tolerance of on‐board digital signal processing circuits

Raghunandan¹,

Coakley²,

Evans³

1991

Int. J. Satell. Commun.

View full text Add to dashboard Cite

The paper is organized in four sections. The first section introduces the nature of faults as well as their causes. The methods used to identify faults and the actions necessary to correct the situation are outlined. The second section identifies the different fault tolerance approaches to conventional computational circuits and the DSP circuits. Current research work in the area of fault tolerance of FFT, signal processing and VLSI circuits involving systolic arrays is reviewed. Since some of the techniques do not involve error correction, reconfiguration of the circuit after error detection becomes necessary and a brief look at the relevant reconfiguration strategies is appropriate. Software fault tolerance is introduced and some work applicable to computations in general is reviewed. The implementation of the methods and its consequences are described in the third section. Concluding remarks form the final section. KEY WORDS Coding Digital signal processing Fault tolerance FFT Residue number systems Reconfiguration Satellite communication Software and hardware reliability Systolic arrays VLSI

show abstract

“…By contrast, the RRNS codes are less widely known in the field of wireless communications. The so-called residue number system (RNS) arithmetic has drawn wide attention in computer science and in high-speed parallel signal processing due to its fault-tolerant properties [11], [12]. Error control coding theory using RRNS codes has recently been substantially advanced [13]- [18], raising our interest in investigating the properties of RRNS codes in different application environments, while extending its applications to new fields.…”

mentioning

confidence: 99%

Performance analysis of coded M-ary orthogonal signaling using errors-and-erasures decoding over frequency-selective fading channels

Yang

Hanzo

2001

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-The performance of -ary orthogonal signaling schemes employing Reed-Solomon (RS) codes and redundant residue number system (RRNS) codes is investigated over frequency-selective Rayleigh fading channels. "Errors-and-erasures" decoding is considered, where erasures are judged based on two low-complexity, low-delay erasure insertion schemes-Viterbi's ratio threshold test (RTT) and the proposed output threshold test (OTT). The probability density functions (PDF) of the ratio associated with the RTT and that of the demodulation output in the OTT conditioned on both the correct detection and erroneous detection of -ary signals are derived, and the characteristics of the RTT and OTT are investigated. Furthermore, expressions are derived for computing the codeword decoding error probability of RS codes or RRNS codes based on the above PDFs. The OTT technique is compared to Viterbi's RTT, and both of these are compared to receivers using "error-correction only" decoding over frequency-selective Rayleigh-fading channels. The numerical results show that by using "errors-and-erasures" decoding, RS or RRNS codes of a given code rate can achieve higher coding gain than that without erasure information, and that the OTT technique outperforms the RTT, provided that both schemes are operated at the optimum decision thresholds.

show abstract

Fault tolerance in a systolic residue arithmetic processor array

Cited by 30 publications

References 12 publications

Implementation of stream cipher system based on representation of integers in Residue Number System

Implementation of stream cipher system based on representation of integers in Residue Number System

Fault tolerance of on‐board digital signal processing circuits

Performance analysis of coded M-ary orthogonal signaling using errors-and-erasures decoding over frequency-selective fading channels

Contact Info

Product

Resources

About