Chinese remainder theorem: applications in computing, coding, cryptography
Chinese remainder theorem: applications in computing, coding, cryptography
Number Theory in Digital Signal Processing
Number Theory in Digital Signal Processing
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
Chinese remaindering with errors
IEEE Transactions on Information Theory
A closed-form robust chinese remainder theorem and its performance analysis
IEEE Transactions on Signal Processing
Hi-index | 35.69 |
The Chinese remainder theorem (CRT) allows to reconstruct a large integer from its remainders modulo several moduli. In this paper, we propose a robust reconstruction algorithm called robust CRT when the remainders have errors. We show that, using the proposed robust CRT, the reconstruction error is upper bounded by the maximal remainder error range named remainder error bound, if the remainder error bound is less than one quarter of the greatest common divisor (gcd) of all the moduli.We then apply the robust CRT to estimate frequencies when the signal waveforms are undersampled multiple times. It shows that with the robust CRT, the sampling frequencies can be significantly reduced.