Array processing on finite polynomial rings
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 284-295
- https://doi.org/10.1109/asap.1990.145465
Abstract
The disadvantage of computations using finite rings is the need to compute over many different rings in order to produce useful dynamic ranges of computation. By mapping integers into polynomial rings, one can replace the different rings by the replication of the same ring with considerable computational advantages. The authors present the methodology of such a mapping strategy, and discuss the application of the features of the technique to dense fabrication strategies such as WSI and ULSI, where redundancy is an integral part of the architecture. It is shown that all of the operations can be performed by the recently introduced bit-steered ROM technique, with attendant advantages of easy testability and fault detection. The polynomial mapping strategy allows the extra advantage of low-overhead redundancy when general computational blocks are employed.Keywords
This publication has 7 references indexed in Scilit:
- Bit-level systolic arrays for IIR filteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On modulus replication for residue arithmetic computations of complex inner productsIEEE Transactions on Computers, 1990
- An efficient bit-level systolic cell design for finite ring digital signal processing applicationsJournal of Signal Processing Systems, 1989
- High-speed signal processing using systolic arrays over finite ringsIEEE Journal on Selected Areas in Communications, 1988
- Computing the discrete Fourier transform using residue number systems in a ring of algebraic integersIEEE Transactions on Information Theory, 1985
- Implementation of signal processing functions using 1-bit systolic arraysElectronics Letters, 1982
- Residue Number Scaling and Other Operations Using ROM ArraysIEEE Transactions on Computers, 1978