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

DOI10.1109/78.224241zbMath0800.94083OpenAlexW2169923605MaRDI QIDQ4275206

B. R. Musicus, Paul E. Beckmann

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

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

Related Items (3)

Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems ⋮ Unnamed Item

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