Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1807.00022 v1 pith:BHXKD4AX submitted 2018-06-29 cs.IT math.IT

classification cs.ITmath.IT
keywords multiplercrtmnerrorsestimationambiguitychinesenumbersproblems
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Chinese Remainder Theorem (CRT) is a powerful approach to solve ambiguity resolution related problems such as undersampling frequency estimation and phase unwrapping which are widely applied in localization. Recently, the deterministic robust CRT for multiple numbers (RCRTMN) was proposed, which can reconstruct multiple integers with unknown relationship of residue correspondence via generalized CRT and achieves robustness to bounded errors simultaneously. Naturally, RCRTMN sheds light on CRT-based estimation for multiple objectives. In this paper, two open problems arising that how to introduce statistical methods into RCRTMN and deal with arbitrary errors introduced in residues are solved. We propose the extended version of RCRTMN assisted with Maximum Likelihood Estimation (MLE), which can tolerate unrestricted errors and bring considerable improvement in robustness.

Discussion (0). Continue with ORCID to comment.

Pith tools