Decoding algorithm for binary BCH codes

Ching Lung Chr, Szu-Lin Su, Shao Wei Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the "matrix-computing" element.

Original languageEnglish
Title of host publicationProceedings of the IASTED International Conference on Communication Systems and Networks
EditorsC.E.P. Salvador
Pages254-258
Number of pages5
Publication statusPublished - 2004
EventProceedings of the IASTED International Conference on Communication Systems and Networks - Marbella, Spain
Duration: 2004 Sep 12004 Sep 3

Other

OtherProceedings of the IASTED International Conference on Communication Systems and Networks
CountrySpain
CityMarbella
Period04-09-0104-09-03

Fingerprint

Decoding
Computational complexity
Polynomials

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Chr, C. L., Su, S-L., & Wu, S. W. (2004). Decoding algorithm for binary BCH codes. In C. E. P. Salvador (Ed.), Proceedings of the IASTED International Conference on Communication Systems and Networks (pp. 254-258). [450-095]
Chr, Ching Lung ; Su, Szu-Lin ; Wu, Shao Wei. / Decoding algorithm for binary BCH codes. Proceedings of the IASTED International Conference on Communication Systems and Networks. editor / C.E.P. Salvador. 2004. pp. 254-258
@inproceedings{a9c8d27113254e5eb3eda71326501a19,
title = "Decoding algorithm for binary BCH codes",
abstract = "A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the {"}matrix-computing{"} element.",
author = "Chr, {Ching Lung} and Szu-Lin Su and Wu, {Shao Wei}",
year = "2004",
language = "English",
isbn = "088986456X",
pages = "254--258",
editor = "C.E.P. Salvador",
booktitle = "Proceedings of the IASTED International Conference on Communication Systems and Networks",

}

Chr, CL, Su, S-L & Wu, SW 2004, Decoding algorithm for binary BCH codes. in CEP Salvador (ed.), Proceedings of the IASTED International Conference on Communication Systems and Networks., 450-095, pp. 254-258, Proceedings of the IASTED International Conference on Communication Systems and Networks, Marbella, Spain, 04-09-01.

Decoding algorithm for binary BCH codes. / Chr, Ching Lung; Su, Szu-Lin; Wu, Shao Wei.

Proceedings of the IASTED International Conference on Communication Systems and Networks. ed. / C.E.P. Salvador. 2004. p. 254-258 450-095.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Decoding algorithm for binary BCH codes

AU - Chr, Ching Lung

AU - Su, Szu-Lin

AU - Wu, Shao Wei

PY - 2004

Y1 - 2004

N2 - A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the "matrix-computing" element.

AB - A step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes is proposed. The new method can directly determine whether a bit in received word is correct without finding the error-location polynomial. The computational complexity of this decoder is less than that of the conventional step-by-step decoding algorithm, since it reduces approximately half of the matrix computations and the most complex element in the conventional stepby-step decoder is the "matrix-computing" element.

UR - http://www.scopus.com/inward/record.url?scp=11144328185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11144328185&partnerID=8YFLogxK

M3 - Conference contribution

SN - 088986456X

SN - 9780889864566

SP - 254

EP - 258

BT - Proceedings of the IASTED International Conference on Communication Systems and Networks

A2 - Salvador, C.E.P.

ER -

Chr CL, Su S-L, Wu SW. Decoding algorithm for binary BCH codes. In Salvador CEP, editor, Proceedings of the IASTED International Conference on Communication Systems and Networks. 2004. p. 254-258. 450-095