A fast search for the maximum element of the fourier spectrum
AE Ashikhmin, SN Litsyn - … Coding: First French-Soviet Workshop Paris …, 1992 - Springer
AE Ashikhmin, SN Litsyn
Algebraic Coding: First French-Soviet Workshop Paris, July 22–24, 1991 …, 1992•SpringerAn algorithm for determining the index of the maximum spectrum element of the Fourier
transform is proposed. Its complexity is linear in the length of the processed sequence. The
algorithm leads to the correct decision if the Euclidean distance between the sequence and
a basis vector does not exceed√(q/2), where q is the length of the sequence.
transform is proposed. Its complexity is linear in the length of the processed sequence. The
algorithm leads to the correct decision if the Euclidean distance between the sequence and
a basis vector does not exceed√(q/2), where q is the length of the sequence.
Abstract
An algorithm for determining the index of the maximum spectrum element of the Fourier transform is proposed. Its complexity is linear in the length of the processed sequence. The algorithm leads to the correct decision if the Euclidean distance between the sequence and a basis vector does not exceed √(q/2), where q is the length of the sequence.
Springer
Showing the best result for this search. See all results