Back to Search
Start Over
A Robust Generalized Chinese Remainder Theorem for Two Integers.
- Source :
-
IEEE Transactions on Information Theory . Dec2016, Vol. 62 Issue 12, p7491-7504. 14p. - Publication Year :
- 2016
-
Abstract
- A generalized Chinese remainder theorem (CRT) for multiple integers from residue sets has been studied recently, where the correspondence between the remainders and the integers in each residue set modulo several moduli is not known. A robust CRT has also been proposed lately to robustly reconstruct a single integer from its erroneous remainders. In this paper, we consider the reconstruction problem of two integers from their residue sets, where the remainders not only are out of order but also may have errors. We prove that two integers can be robustly reconstructed if their remainder errors are less than $M/8$ , where $M$ is the greatest common divisor of all the moduli. We also propose an efficient reconstruction algorithm. Finally, we present some simulations to verify the efficiency of the proposed algorithm. This paper is motivated from and has applications in the determination of multiple frequencies from multiple undersampled waveforms. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 62
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 119616352
- Full Text :
- https://doi.org/10.1109/TIT.2016.2614322