A simple decoding of BCH codes over GF(2/sup m/)

Koga, K.

doi:10.1109/26.681396

Cited by 3 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So it resolved the decode problem of BCH codes in practice. From then on, many scholars proposed much new decoding method [1][2][3][4][5][6] such as Euclidean-decoding algorithm, continued fraction algorithm, etc.…”

Section: Introductionmentioning

confidence: 99%

<title>New algorithm realization for FEC in optical transmission system</title>

Tang

2001

SPIE Proceedings

View full text Add to dashboard Cite

In long-distance optical transmission systems at high-speed faster than 2.5Gbit/s, several transmission degradations need to be overcome, such as group velocity dispersion (GVD), polarization mode dispersion (PMD) in the fiber and the ASE accumulation noise employing EDFA, etc. The use of forward error correction (FEC) codes offers the potential to improve these degradations and to increase BER performance. In this paper, a new simple decoding algorithm for triple-error correcting BCH codes is proposed. Without complicated matrix-operation or division-operation or intricate iterative algorithm, the algorithm is high efficient and high-speed because of its simplicity in structure. Especially, the parallel structure increases the speed of coding greatly. The result of hardware simulation confirms that the algorithm is feasible completely. The algorithm can be used in the high-speed optical communication system and other high-speed communication system field.

show abstract

Section: Introductionmentioning

confidence: 99%