2013/07/18 by Alexander Fish, Shamgar Gurevich, Ronny Hadani +2 · 93 citations
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Algorithm #Channel (broadcasting) #Coding theory and cryptography #Computer science #Doppler effect #Filter (signal processing) #Matched filter #Mathematics #Physics #Radar Systems and Signal Processing #SIGNAL (programming language) #Telecommunications #Transmitter
paper · doi:10.1109/tit.2013.2273931
published in IEEE Transactions on Information Theory 59(11), 7632-7644 (Institute of Electrical and Electronics Engineers)
openalex publication_date 2013/07/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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, i.e., a signal undergoes only delay and Doppler shifts, a widely used method to compute the delay-Doppler parameters 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(N2logN). 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 m delay-Doppler parameters in O(mNlogN) operations. We discuss applications of the flag method to GPS, and radar systems.