Title :
Efficient frequency domain decoding of binary BCH codes based on prime-factor FFT
Author :
Ding, Suquan ; Yang, Zhixing ; Pan, Changyong
Author_Institution :
Dept. of Electron. Eng., Tsinghua Univ., Beijing, China
Abstract :
By introducing the ideas of reducing computation complexity in the fast Fourier transform (FFT) to decoding, a low complexity decoding of binary BCH codes is derived which transforms the determination of one-dimensional error word into two-dimensional matrix. For the case of double-error-correcting binary BCH codes, the frequency domain decoding based on prime-factor FFT (in short, PF-FDD) was designed. Compared with the conventional frequency domain decoding algorithm, PF-FDD has the advantages of lower decoding complexity and faster decoding speed at the expense of increasing storage memory. When compared with the ordinary look-up table decoding scheme, the error patterns to store are decreased greatly. Hence, PF-FDD achieves a better tradeoff between decoding complexity and hardware complexity. The proposed low complexity decoding scheme is suitable for binary BCH codes whose block length has prime factors and error correcting capacity is relatively small, and is expected to apply to soft-decision decoding.
Keywords :
BCH codes; binary codes; computational complexity; decoding; error correction codes; fast Fourier transforms; storage allocation; FFT; PF-FDD; binary BCH codes; block length; computation complexity; decoding complexity; decoding speed; double-error-correcting code; fast Fourier transform; frequency domain decoding; hardware complexity; one-dimensional error word; prime factors; prime-factor FFT; soft-decision decoding; storage memory; two-dimensional matrix; Block codes; Decoding; Fast Fourier transforms; Fourier transforms; Frequency domain analysis; Hamming weight; Hardware; Parity check codes; Table lookup; Vectors;
Conference_Titel :
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN :
0-7803-9015-6
DOI :
10.1109/ICCCAS.2005.1493352