Loading [MathJax]/extensions/MathMenu.js
Distance Estimation Using Wrapped Phase Measurements in Noise | IEEE Journals & Magazine | IEEE Xplore

Distance Estimation Using Wrapped Phase Measurements in Noise


Abstract:

Measuring a distance using phase measurements is a common practice in many areas of engineering. Almost inevitably these measurements are accompanied by noise, and are al...Show More

Abstract:

Measuring a distance using phase measurements is a common practice in many areas of engineering. Almost inevitably these measurements are accompanied by noise, and are always subject to ambiguity resulting from the phase of modulo 2π. In the presence of phase ambiguity, where for instance the unknown distance is far longer than the wavelength of the signal carrying the phase measurement, the distance cannot be uniquely determined. One way to resolve this phase ambiguity is to measure the signal phase at multiple frequencies, converting the phase ambiguity problem into one of solving a family of Diophantine equations. Typically, under some reasonable assumptions, the Diophantine problems can be solved using the Chinese Reminder Theorem as documented in the literature. However, the existing algorithms can experience significant computational overhead for a given application because an exhaustive search is required. In this paper, a novel method addressing the phase ambiguity issue using lattice theoretic ideas is proposed and a closed-form algorithm is presented for the estimation of the number of wavelengths in the unknown distance using the phase measurements taken at multiple wavelengths. The algorithm is extremely efficient as the Diophantine equations are solved without searching. The unknown distance can then be estimated via a maximum likelihood method using the unwrapped phase measurement. A statistical bound of the measurement noise which ensures that the number of whole wavelengths in the unknown distance can be found with a probability close to unity is derived. The robustness, efficiency and estimation accuracy of the proposed method are demonstrated by the simulated results presented.
Published in: IEEE Transactions on Signal Processing ( Volume: 61, Issue: 7, April 2013)
Page(s): 1676 - 1688
Date of Publication: 10 January 2013

ISSN Information:

References is not available for this document.

I. Introduction

Phase ambiguity is a common and significant problem in real world engineering problems where phase is measured in order to estimate a distance. This phase ambiguity issue arises when the distance to be measured by the phase of an electromagnetic signal is far longer than the signal wavelength. The resulting estimate of the distance is ambiguous by an integer multiple of signal wavelength. A simple example is the use of a phase only signal to measure the range of a target [1]. A more complex example is the use of a sum of signal phase differences measured from a Radio Interferometric Positioning System (RIPS) for wireless mote localization [2]. A single RIPS measurement involves three anchor motes and a free mote. Two motes act as transmitters, sending a pure sinusoidal waves at slightly different frequencies. This results in an interference signal at a low beat frequency that is received by the other two motes (acting as receivers). A sum of range differences between the four motes can be expressed by the phase difference of the received interference signals at the two receiver locations. In feasible RIPS setups, the measurement of phase difference are ambiguous because of hardware constraints. The problem of phase ambiguity also occurs in the signal frequency estimation and is known as the phase wrap problem [3].

Select All
1.
Y. Cheng, X. Wang, T. Caelli and B. Moran, "Tracking and localizing moving targets in the presence ofphase measurement ambiguities", IEEE Trans. Signal Process., vol. 59, no. 8, pp. 3514-3525, Aug. 2011.
2.
M. Maroti, B. Kusy, G. Balogh, P. Volgyesi, K. Molnar, A. Nadas, et al., Radio Interferometric Positioning, 2005.
3.
I. V. L. Clarkson, "Frequency estimation phaseunwrapping and the nearest lattice point problem", Proc. Int. Conf. Acoust. Speech Signal Process. (ICASSP), vol. 3, pp. 1609-1612, 1999-Mar.
4.
B. Kusy, A. Ledeczi, M. Maroti and L. Meertens, "Node-density independent localization", Proc. 5th Int. Conf. Inf. Process. Sensor Netw. (IPSN), pp. 441-448, 2006-Apr.
5.
X. -. Xia and G. Y. Wang, "Unwrapping and a robust ChineseRemainder Theory", IEEE Signal Process. Lett., vol. 14, no. 4, pp. 247-250, Apr. 2007.
6.
X. W. Li and X. -G. Xia, "A fast robust Chinese RemainderTheorem based phase unwrapping algorithm", IEEE Signal Process. Lett., vol. 15, pp. 665-668, Oct. 2008.
7.
X. -. Xia and K. Liu, "A generalized Chinese Remainder Theoremfor residue sets with errors and its application in frequency determinationfrom multiple sensors with low sampling rates", IEEE Signal Process. Lett., vol. 12, pp. 768-771, Nov. 2005.
8.
X. W. Li, H. Liang and G. Xia, "A robust Chinese Remainder Theorem with its applicationsin frequency estimation from undersampled waveforms", IEEE Trans. Signal Process., vol. 57, no. 11, pp. 4314-4322, Nov. 2009.
9.
W. J. Wang and X.-G. Xia, "A closed-form robust ChineseRemainder Theorem and its performance analysis", IEEE Trans. Signal Process., vol. 58, no. 1, pp. 247-250, Nov. 2010.
10.
R. G. McKilliam, B. G. Quin, I. V. L. Clarkson and B. Moran, "Frequency estimation by phase unwrapping", IEEE Trans. Signal Process., vol. 58, no. 6, pp. 2953-2963, Jun. 2010.
11.
U. Fincke and M. Pohst, "Improved methods for calculating vectorsof short length in lattice including a complexity analysis", Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
12.
E. Agrell, T. Eriksson, A. Vardy and K. Zeger, "Closest point search in lattices", IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
13.
I. V. L. Clarkson, M. Fossorier, H. Imai, S. Lin and A. E. Poli, "An Algorithm to Compute a Nearest Point in the Lattice" in Applied Algebra Algebraic Algorithms and Error-Correcting Codes, USA, NY, New York:Springer, vol. 1719, pp. 104-120, 1999.
14.
R. G. McKilliam, I. V. L. Clarkson and B. G. Quinn, " An algorithm to compute thenearest point in the lattice \$A^{ast}_{N}\$ ", IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 4378-4381, Sep. 2008.
15.
R. G. McKilliam, I. V. L. Clarkson, W. D. Smith and B. G. Quinn, " A linear-time nearest pointalgorithm for the lattice \$A^{ast}_{N}\$ ", Proc. Int. Symp. Inf. Theory Appl., 2008-Dec.
16.
R. G. McKilliam, W. D. Smith and I. V. L. Clarkson, "Linear-time nearest point algorithmsfor coxeter lattices", IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1015-1022, Mar. 2010.
17.
I. Vrana, "Optimum statistical estimatesin conditions of ambiguity", IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 1023-1030, May 1993.
18.
W. C. Li, X. Z. Wang and B. Moran, "Resolving rips measurement ambiguity inmaximum likelihood estimation", 14th Int. Conf. Inf. Fusion (FUSION), 2011-Jul.
19.
R. B. Murray, Lattice Basis Reduction: An Introduction to the LLL Algorithm and its Applications, USA, FL, Boca Raton:CRC Press, 2011.
20.
A. K. Lenstra, H. W. Lenstra and L. Lovasz, "Factoring polynomials withrational coeffcients", Mathematische Annalen, vol. 261, no. 4, pp. 425-430, 1982.
21.
M. Pohst, "A modification of the LLL-algorithm", J. Symbol. Comput., vol. 4, no. 1, pp. 123-128, 1987.
22.
L. Babai, "On Lovasz lattice reductionand the nearest lattice point problem", J. Symbol. Comput. Combinatorica, vol. 6, no. 1, pp. 1-13, 1986.
Contact IEEE to Subscribe

References

References is not available for this document.