In estimating frequencies given that the signal waveforms are undersampled multiple times, Xia et. al. proposed to use a generalized version of Chinese remainder Theorem (CRT), where the moduli are $M_1, M_2, \cdots, M_k$ which are not necessarily pairwise coprime. If the errors of the corrupted remainders are within $\tau=\sds \max_{1\le i\le k} \min_{\stackrel{1\le j\le k}{j\neq i}} \frac{\gcd(M_i,M_j)}4$, their schemes can be used to construct an approximation of the solution to the generalized CRT with an error smaller than $\tau$. Accurately finding the quotients is a critical ingredient in their approach. In this paper, we shall start with a faithful historical account of the generalized CRT. We then present two treatments of the problem of solving generalized CRT with erroneous remainders. The first treatment follows the route of Wang and Xia to find the quotients, but with a simplified process. The second treatment considers a simplified model of generalized CRT and takes a different approach by working on the corrupted remainders directly. This approach also reveals some useful information about the remainders by inspecting extreme values of the erroneous remainders modulo $4\tau$. Both of our treatments produce efficient algorithms with essentially optimal performance. Finally, this paper constructs a counterexample to prove the sharpness of the error bound $\tau$.
[1]
Xiang-Gen Xia,et al.
Multi-Stage Robust Chinese Remainder Theorem
,
2013,
IEEE Transactions on Signal Processing.
[2]
Douglas R. Stinson,et al.
Cryptography: Theory and Practice
,
1995
.
[3]
Xiang-Gen Xia,et al.
Phase Unwrapping and A Robust Chinese Remainder Theorem
,
2007,
IEEE Signal Processing Letters.
[4]
Xiang-Gen Xia,et al.
A Closed-Form Robust Chinese Remainder Theorem and Its Performance Analysis
,
2010,
IEEE Transactions on Signal Processing.
[5]
George Havas,et al.
GCD of Many Integers
,
1999,
COCOON.
[6]
Bao Li,et al.
On the Algorithmic Significance and Analysis of the Method of DaYan Deriving One
,
2016,
ArXiv.
[7]
Ho Peng Yoke,et al.
Chinese Mathematics in the Thirteenth Century.
,
1973
.
[8]
Xiang-Gen Xia,et al.
A Robust Chinese Remainder Theorem With Its Applications in Frequency Estimation From Undersampled Waveforms
,
2009,
IEEE Transactions on Signal Processing.
[9]
Guangwu Xu,et al.
Fast arithmetics using Chinese remaindering
,
2009,
Inf. Process. Lett..
[10]
Oystein Ore,et al.
The General Chinese Remainder Theorem
,
1952
.