A fundamental problem in wireless communication is the time-frequency shift
(TFS) problem: Find the time-frequency shift of a signal in a noisy
environment. The shift is the result of time asynchronization of a sender with
a receiver, and of non-zero speed of a sender with respect to a receiver. A
classical solution of a discrete analog of the TFS problem is called the
matched filter algorithm. It uses a pseudo-random waveform S(t) of the length
p, and its arithmetic complexity is O(p^{2} \cdot log (p)), using fast Fourier
transform.