A signal adaptive time of arrival estimation algorithm based on polynomial rooting

Gerrit Kalverkamp, Erwin Biebl

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publication2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
Pages691-694
Number of pages4
DOIs
StatePublished - 2013
Event2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Austin, TX, United States
Duration: 3 Dec 20135 Dec 2013

Publication series

Name2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings

Conference

Conference2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
Country/TerritoryUnited States
CityAustin, TX
Period3/12/135/12/13

Keywords

  • Parameter estimation
  • Radar signal processing
  • Sparse sensing
  • Spectral efficiency
  • Time of arrival estimation

Fingerprint

Dive into the research topics of 'A signal adaptive time of arrival estimation algorithm based on polynomial rooting'. Together they form a unique fingerprint.

Cite this