By Topic

Fast fault-tolerant digital convolution using a polynomial residue number system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beckmann, P.E. ; Res. Lab. of Electron., MIT, Cambridge, MA, USA ; Musicus, B.R.

A fault-tolerant convolution algorithm that is an extension of residue-number-system fault-tolerance schemes applied to polynomial rings is described. The algorithm is suitable for implementation on multiprocessor systems and is able to concurrently mask processor failures. A fast algorithm based on long division for detecting and correcting multiple processor failures is presented. Moduli polynomials that yield an efficient and robust fast-Fourier transform (FFT)-based algorithm are selected. For this implementation, a single fault detection and correction is studied, and a generalized-likelihood-ratio test is applied to optimally detect system failures in the presence of computational noise. The coding scheme is capable of protecting over 90% of the computation involved in convolution. Parts not covered by the scheme are assumed to be protected via triple modular redundancy. This hybrid approach can detect and correct any single system failure with as little as 70% overhead, compared with 200% needed for a system fully protected via modular redundancy

Published in:

Signal Processing, IEEE Transactions on  (Volume:41 ,  Issue: 7 )