Array processing on finite polynomial rings

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.<
>