DocumentCode :
3255077
Title :
A signal adaptive time of arrival estimation algorithm based on polynomial rooting
Author :
Kalverkamp, Gerrit ; Biebl, E.
Author_Institution :
Fachgebiet Hochstfrequenztechnik, Tech. Univ. Munchen, Munich, Germany
fYear :
2013
fDate :
3-5 Dec. 2013
Firstpage :
691
Lastpage :
694
Abstract :
In this paper an algorithm for time of arrival estimation is proposed, which allows processing of spectrally sparse channel observations in order to provide highly accurate range estimations with a maximized resolution capability. The use of sparse waveforms in combination with the presented algorithm provides increased spectral efficiency with lower computational complexity due to reduced size of the observation matrices. Additionally, the ability of the algorithm to efficiently process spectral fragmentary data also gives the capability to efficiently cope with missing data caused by frequency selective fading or interferences.
Keywords :
compressed sensing; covariance matrices; polynomials; radar signal processing; signal resolution; time-of-arrival estimation; computational complexity; frequency selective fading; interferences; maximized resolution capability; observation matrices; polynomial rooting; range estimations; signal adaptive time of arrival estimation algorithm; sparse waveforms; spectral efficiency; spectral fragmentary data; spectrally sparse channel observations; Covariance matrices; Distance measurement; Estimation; Noise; Polynomials; Signal resolution; Vectors; parameter estimation; radar signal processing; sparse sensing; spectral efficiency; time of arrival estimation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Conference on Signal and Information Processing (GlobalSIP), 2013 IEEE
Conference_Location :
Austin, TX
Type :
conf
DOI :
10.1109/GlobalSIP.2013.6736985
Filename :
6736985
Link To Document :
بازگشت