IEEE Transactions on Communications · 2006 · 21 citations · 15 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsCryptographyMedical CodingChannel CodingCoding TheoryErasure CodingError Control CodingError CorrectionError-correcting CodesDecoder DesignDiscrete Fourier TransformDiscrete-time Fourier TransformFast Fourier TransformFourier Transform TheoryReed-solomon CodesReed-solomon CodingTransform Coding
In this letter, it is shown that a fast, prime-factor discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2/sup m/-1 points over GF(2/sup m/), where 8/spl les/m/spl les/10. Using these transforms, together with the Berlekamp-Massey algorithm, the complexity of the transform-domain decoder for correcting both errors and erasures of the Reed-Solomon codes of block length 2/sup m/-1 over GF(2/sup m/) for 8/spl les/m/spl les/10 is reduced substantially from the previous time-domain decoder. A computer simulation verifies these new results.
15
The fast Fourier transform and its applications
Choice Reviews Online · 1989 · 2.2K citations
Engineering, Biomedical Engineering, Electrical Engineering +11
On computing the discrete Fourier transform
S. Winograd · Mathematics of Computation · 1978 · 614 citations · Full text
On Computing the Discrete Fourier Transform
S. Winograd · Mathematics of Computation · 1978 · 282 citations