An exact numerical algorithm for computing the unwrapped phase of a finite-length sequence

Author

Long, David G.

Author_Institution

Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA

fYear

1988

fDate

11-14 Apr 1988

Firstpage

1782

Abstract

A direct relationship between a one-dimensional time series and its unwrapped phase was shown by R. McGowan and R. Kuc (1982). They proposed an algorithm for computing the unwrapped phase by counting the number of sign changes in a Sturm sequence generated from the real and imaginary parts of the DFT (discrete Fourier transform). Their algorithm is limited to relatively short sequences by numerical accuracy. An extension of their algorithm is proposed which, by using all-integer arithmetic, permits exact computation of the number of multiples of π which must be added to the principal value of the phase to uniquely give the unwrapped phase of a one-dimensional rational-valued finite-length sequence of arbitrary length. This extended algorithm should be of interest when highly accurate phase unwrapping is required

Keywords

digital arithmetic; signal processing; time series; 1D time series; all-integer arithmetic; exact numerical algorithm; finite-length sequence; numerical accuracy; phase unwrapping; rational-valued finite-length sequence; short sequences; unwrapped phase; Arithmetic; Equations; Multidimensional systems; Poles and zeros; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on

Conference_Location

New York, NY

ISSN

1520-6149

Type

conf

DOI

10.1109/ICASSP.1988.196965

Filename

196965