Delay-Doppler Channel Estimation in Almost Linear Complexity
From MaRDI portal
Abstract: A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N^{2}log(N)). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences, which enable us to introduce a new algorithm, called the flag method, that significantly improves the matched filter algorithm. The flag method finds the channel parameters in O(mNlog(N)) operations, for channel of sparsity m. We discuss applications of the flag method to GPS, radar system, and mobile communication as well.
Cited in
(7)- Channel identification under Doppler and time shifts using mixed training signals
- Approximate maximum likelihood delay estimation via orthogonal wavelet transform
- Estimate-maximize algorithms for multichannel time delay and signal estimation
- Ziv–Zakai Bounds on Time Delay Estimation in Unknown Convolutive Random Channels
- Joint Estimation of Time Delay and Doppler Shift for Band-Limited Signals
- Joint Delay and Doppler Estimation for Passive Sensing With Direct-Path Interference
- Joint Transmit and Receive Filter Optimization for Sub-Nyquist Delay-Doppler Estimation
This page was built for publication: Delay-Doppler Channel Estimation in Almost Linear Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346270)