28 October 1994 Redundant finite rings for fault-tolerant signal processors
Author Affiliations +
Abstract
Redundant Residue Number Systems (RRNS) have been proposed as suitable candidates for fault tolerance in compute intensive applications. The redundancy is based on multiple projections to moduli sub-sets and conducting a search for results that lie in a so-called illegitimate range. This paper presents RRNS fault tolerant procedures for a recently introduced finite polynomial ring mapping procedure (modulus replication RNS). The mapping technique dispenses with the need for many relatively prime ring moduli, which is a major draw-back with conventional RRNS systems. Although double, triple, and quadrupole modular redundancy can be implemented in the polynomial mapping structure, polynomial coefficient circuitry, or the independent direct product ring computational channels, for error detection and/or correction, this paper discusses the implementation of redundant rings which are generated by (1) redundant residues, (2) spare general computational channels, or (3) a combination of the two. The first architecture is suitable for RNS embedding in the MRRNS, and the second for single moduli mappings. The combination architecture allows a trade-off between the two extremes. The application area is in fault tolerant compute intensive DSP arrays.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Graham A. Jullien, Graham A. Jullien, S. S. Bizzan, S. S. Bizzan, Neil M. Wigley, Neil M. Wigley, W. C. Miller, W. C. Miller, } "Redundant finite rings for fault-tolerant signal processors", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190888; https://doi.org/10.1117/12.190888
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Modified Faddeev Algorithm For Matrix Manipulation
Proceedings of SPIE (November 27 1984)
Some improvements on RNS Montgomery modular multiplication
Proceedings of SPIE (November 12 2000)
A comparative study of modular adders
Proceedings of SPIE (October 25 2004)
Arithmetic unit based on a high speed multiplier with a...
Proceedings of SPIE (November 30 1991)
VLSI digital signal processing: some arithmetic issues
Proceedings of SPIE (October 21 1996)

Back to Top