Abstract
The interest in bistatic SAR continues to increase due to the key advantages introduced by the use of two different platforms to transmit and receive signals [1]. There are two main operational issues that need to be addressed in bistatic SAR systems. The first is the requirement of an accurate syncronization between the transmitter and the receiver while the second is the capability to handle the particular bistatic slant range function in the processing algorithms [2]. [3]. The Chebyshev polynomial are shown to provide a more accurate approximation of the slant range function with negligible increased processing requirements.
Original language | English |
---|---|
Title of host publication | 2011 IEEE Radar Conference (RADAR) |
Publisher | IEEE |
Pages | 789-792 |
Number of pages | 4 |
ISBN (Print) | 978-1-4244-8901-5 |
DOIs | |
Publication status | Published - May 2011 |
Keywords
- bistatic slant range
- approximation
- Chebyshev polynomials