DocumentCode
1958573
Title
New step-by-step decoding for binary BCH codes
Author
Ching-Lung Chr ; Szu-Lin Su ; Shao-Wei Wu
Author_Institution
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan
fYear
2004
fDate
7-7 Sept. 2004
Firstpage
456
Lastpage
460
Abstract
A new efficient step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is presented. Based on logical analysis, we obtain a simple rule, which can directly determine whether any bit in received word is correct or not without finding the error-location polynomial. The new method omits one largest-scale matrix calculation and the operations of multiplication are reduced significantly, compared with the conventional step-by-step decoding algorithm
Keywords
BCH codes; binary codes; decoding; error correction codes; matrix algebra; binary BCH code; binary Bose-Chaudhuri-Hocquenghem code; error-location polynomial; logical analysis; matrix calculation; step-by-step decoding; t-error-correcting code; Algorithm design and analysis; Circuit analysis computing; Code standards; Decoding; Delay effects; Error correction codes; Power generation; Random number generation; Systolic arrays; Tiles;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications Systems, 2004. ICCS 2004. The Ninth International Conference on
Conference_Location
Singapore, China
Print_ISBN
0-7803-8549-7
Type
conf
DOI
10.1109/ICCS.2004.1359418
Filename
1359418
Link To Document