Computation of the one-dimensional unwrapped phase
Name
75203725-MIT.pdf
Description
Full printable version
Size
5.51 MB
Format
Adobe PDF
Checksum (MD5)
9ce80d4973a1180768ef62e1004d5fe0
Author(s)
Karam, Zahi Nadim
Advisor(s)
Alan V. Oppenheim.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, the computation of the unwrapped phase of the discrete-time Fourier transform (DTFT) of a one-dimensional finite-length signal is explored. The phase of the DTFT is not unique, and may contain integer multiple of 27r discontinuities. The unwrapped phase is the instance of the phase function chosen to ensure continuity. This thesis presents existing algorithms for computing the unwrapped phase, discussing their weaknesses and strengths. Then two composite algorithms are proposed that use the existing ones, combining their strengths while avoiding their weaknesses. The core of the proposed methods is based on recent advances in polynomial factoring. The proposed methods are implemented and compared to the existing ones.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (p. 101-102). "Cepstrum bibliography" (p. 67-100).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
