Computation of the one-dimensional unwrapped phase
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/35601 |
| _version_ | 1826191074797813760 |
|---|---|
| author | Karam, Zahi Nadim |
| author2 | Alan V. Oppenheim. |
| author_facet | Alan V. Oppenheim. Karam, Zahi Nadim |
| author_sort | Karam, Zahi Nadim |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. |
| first_indexed | 2024-09-23T08:50:06Z |
| format | Thesis |
| id | mit-1721.1/35601 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:50:06Z |
| publishDate | 2007 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/356012022-01-13T07:54:29Z Computation of the one-dimensional unwrapped phase Karam, Zahi Nadim Alan V. Oppenheim. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. 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). 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. by Zahi Nadim Karam. S.M. 2007-01-10T16:46:24Z 2007-01-10T16:46:24Z 2006 2006 Thesis http://hdl.handle.net/1721.1/35601 75203725 eng 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. http://dspace.mit.edu/handle/1721.1/7582 102 p. 5467498 bytes 5780699 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Karam, Zahi Nadim Computation of the one-dimensional unwrapped phase |
| title | Computation of the one-dimensional unwrapped phase |
| title_full | Computation of the one-dimensional unwrapped phase |
| title_fullStr | Computation of the one-dimensional unwrapped phase |
| title_full_unstemmed | Computation of the one-dimensional unwrapped phase |
| title_short | Computation of the one-dimensional unwrapped phase |
| title_sort | computation of the one dimensional unwrapped phase |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/35601 |
| work_keys_str_mv | AT karamzahinadim computationoftheonedimensionalunwrappedphase |