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

DOI10.1109/78.224241MaRDI QIDQ4275206zbMATH OpenOpenAlexFDO

Authors Paul E. Beckmann, B. R. Musicus

Publication date 11 December 1994

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.224241

Mathematics Subject Classification ID

Computer system organization (68M99) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(3)

• Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
• Structured redundancy for fault tolerance in state-space models and Petri nets.
• Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems

This page was built for publication: Fast fault-tolerant digital convolution using a polynomial residue number system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275206)