A fast search for the maximum element of the fourier spectrum
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.
Unable to display preview. Download preview PDF.
- 1.S.Litsyn and O.Shekhovtsov, Fast decoding algorithm for first order Reed-Muller codes, Problems of Information Transmission, v.19, 2, pp.3–7, 1983.Google Scholar
- 2.R.Blahut, Fast algorithms for digital signal processing, Addison-Wesley P.C., 1985.Google Scholar
- 3.A.Ashikhmin and S.Litsyn, Fast decoding of nonbinary orthogonal codes, in preparation.Google Scholar