Close category search window
 

A Fast Robust Chinese Remainder Theorem Based Phase Unwrapping Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaowei Li ; Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE ; Xia, Xiang-Gen

A robust phase unwrapping based on the Chinese remainder theorem (CRT) has been proposed lately, and it has applications in synthetic aperture radar (SAR) imaging for moving targets. It also leads to a type of robust CRT. This algorithm requires a two-dimensional searching. In this letter, we propose a new and fast algorithm that only does one-dimensional searching and therefore reduces the complexity significantly.

Published in:
Signal Processing Letters, IEEE  (Volume:15 )

Date of Publication: 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.