On Solving Ambiguity Resolution With Robust Chinese Remainder Theorem for Multiple Numbers

  title={On Solving Ambiguity Resolution With Robust Chinese Remainder Theorem for Multiple Numbers},
  author={Hanshen Xiao and Guoqiang Xiao},
  journal={IEEE Transactions on Vehicular Technology},
Chinese remainder theorem (CRT) is a powerful approach to solve ambiguity resolution related problems such as undersampling frequency estimation and phase unwrapping. Recently, the deterministic robust CRT for multiple numbers (RCRTMN) was proposed, which can reconstruct multiple integers with the unknown relationship of residue correspondence via generalized CRT and achieve robustness to bounded errors simultaneously. Naturally, RCRTMN sheds light on CRT-based estimation for multiple… 
Wrapped ambiguity Gaussian mixed model with applications in sparse sampling based multiple parameter estimation
This paper is the first rigorous analysis on the underlying statistical model of CRT-based multiple parameter estimation and shows that the statistical schemes achieve much stronger robustness compared to state-of-the-art deterministic schemes, especially in heavy-noise scenarios.
Statistical Robust Chinese Remainder Theorem for Multiple Numbers: Wrapped Gaussian Mixture Model
This paper presents the first rigorous analysis on the underlying statistical model of CRT-based multiple parameter estimation, where a generalized Gaussian mixture with background knowledge on samplings is proposed and achieves much stronger robustness compared to state-of-the-art deterministic schemes.
Multi-Tone Frequency Estimation Based on the All-Phase Discrete Fourier Transform and Chinese Remainder Theorem
This work deals with the intractable issue of mapping relationship between an individual tone and its corresponding remainders by decomposing the desired multi-tone estimator into several single- tone estimators and shows that the proposed method possesses high accuracy.
On the Foundation of Sparse Sensing (Part II): Diophantine Sampling and Array Configuration
It is proved that given arbitrarily large down-sampling rates, there exist sampling schemes where the number of samples needed is only proportional to the sum of DoF and the numberof snapshots required, which implies a linear sampling time.
On the Foundation of Sparse Sensing (Part I): Necessary and Sufficient Sampling Theory and Robust Remaindering Problem
It is proved that, for N -frequency estimation in either complex or real waveforms, once the least common multiple of the sampling rates selected is sufficiently large, one may approach an error tolerance bound independent of N, as well as advancing the understanding of the robust multiple remainder problem.
UAV-Relaying Cooperation for Internet of Everything with CRT-Based NOMA
The potential and effective applications of UAVs are studied by introducing the Chinese remainder theorem (CRT) and nonorthogonal multiple access (NOMA) technologies into UAV relay networks and a low complexity and efficient two-stage power allocation scheme is established for the perspective of users and UAV relays.
Exact and Robust Reconstructions of Integer Vectors Based on Multidimensional Chinese Remainder Theorem (MD-CRT)
This article derives the robust MD-CRT for integer vectors when the remaining integer matrices of all the moduli left divided by their greatest common left divisor are pairwise commutative, and coprime.


Robustness in Chinese Remainder Theorem for Multiple Numbers and Remainder Coding
This paper proposes a pseudometric as a uniform framework to analyze the tradeoff between the error bound and the dynamic range for robust CRT, and presents the first robustCRT for multiple numbers to solve the problem raised by CRT-based undersampling frequency estimation in general.
Maximum Likelihood Estimation Based Robust Chinese Remainder Theorem for Real Numbers and Its Fast Algorithm
This paper considers the CRT problem for real numbers with noisy remainders that follow wrapped Gaussian distributions, and proposes the maximum-likelihood estimation (MLE) based CRT when the remainder noises may not necessarily have the same variances.
A new robust Chinese remainder theorem with improved performance in frequency estimation from undersampled waveforms
A new robust CRT is proposed when a combined occurrence of multiple unrestricted errors combined with an arbitrary number of small errors are in the remainders, where a determinable integer is required to be less than the lcm of a subset of the moduli.
Robust Chinese Remainder Theorem Ranging Method Based on Dual-Frequency Measurements
A CRT ranging method using two “adjacent” frequencies so that all the frequencies in the given frequency span can be used, which greatly increases spectrum utilization.
Notes on CRT-based robust frequency estimation
A lower bound of the product of moduli for general closed-from robust Chinese Remainder Theorem (RCRT) is developed and a scheme of robust reconstruction with erroneous residues under relaxed limitation to errors introduced in residues is developed.
Towards Robustness in Residue Number Systems
By relaxing the assumption that the dynamic range is fixed to be the lcm of all the moduli, a tradeoff between the dynamicrange and the robustness bound for two-modular systems is studied and it is said that a decrease in theynamic range may lead to an increase of the robusts bound.
Multi-Stage Robust Chinese Remainder Theorem
This paper presents a necessary and sufficient condition on the remainder errors with a general set of moduli and also a corresponding robust reconstruction method, and proposes a two-stage robust CRT by grouping the moduli into several groups as follows.
Phase-Detection-Based Range Estimation With Robust Chinese Remainder Theorem
By exploiting the angular circular distance between two vectors, the vector-based robust CRT (Vec-CRT) is proposed, which achieves the best performance and the least computational complexity among all the competitors.
Frequency determination from truly sub-Nyquist samplers based on robust Chinese remainder theorem
This paper provides a thorough overview of the existing research results on the robust CRT during the last decade, and discusses some related open problems as well.
"Soft-decision" decoding of Chinese remainder codes
A new algorithm for solving the soft-decision problem for the CRT code that works provided the agreement parameter t is sufficiently large is given, and this algorithm is derived by digging deeper into the algebra underlying the error-correcting algorithms and unveiling an "ideal"-theoretic view of decoding.