.png){kind=icon}
Return
An efficient implementation of a robust phase-unwrapping algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2006.890095.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A robust phase-unwrapping algorithm has been recently proposed and applied to accurately locate fast moving, targets in multifrequency antenna array synthetic aperture radar imaging. This algorithm is based on two dimensional (2-D) searching and its complexity may be high. In this letter, we propose an efficient implementation of the robust phase-unwrapping algorithm. We show that the range of the 2-D searching, and therefore the complexity of the robust phase-unwrapping algorithm, can be significantly reduced.
Keywords:
Chinese remainder theorem
phase unwrapping
remainder errors
synthetic aperture radar (SAR)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
.png){kind=icon}
