| 摘要 |
PROBLEM TO BE SOLVED: To promote power saving during decoding process of a BCH code in an optical communication field. SOLUTION: Relating to a BCH code decoding method for a BCH code generated by a generating polynomial of GF(q) whose root is powerα<SP POS="POST">l</SP>,α<SP POS="POST">l+1</SP>,α<SP POS="POST">l+2</SP>, ......,α<SP POS="POST">l+d-2</SP>(d≥3) of a primitive elementαof GF(q<SP POS="POST">m</SP>), a plurality of error syndromes are calculated which correspond to continuous n<SB POS="POST">R</SB>([(d-1)/2]≤n<SB POS="POST">R</SB>≤(d-2)) rootsα<SP POS="POST">u</SP>,α<SP POS="POST">u+1</SP>, ......,α<SP POS="POST">u+nR-1</SP>(l≤u≤l+d-2, l≤u+n<SB POS="POST">R</SB>-1≤l+d-2). It is determined whether or not every one of the plurality of error syndromes is value "0". When its determination result is false, it is determined that there is an error in receiving words of BCH code, and a predetermined error correction process is performed. If the determination result is true, a non-error correction process is performed in which no error correction is performed. COPYRIGHT: (C)2013,JPO&INPIT |
