A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes
- 1 October 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (10) , 1165-1171
- https://doi.org/10.1109/tc.1987.1676857
Abstract
In this paper, some efficient methods of solving equations over Galois field GF(2m) are proposed. Using these algorithms, decoders for triple-and quadruple-error-correcting Bose–Chaudhuri–Hocquenghem (BCH) codes are shown. More- over, we propose a new method of making high-speed decoders for double-error-correcting/triple-error-detecting BCH or Reed- Solomon (RS) codes by adding a simple error-identifying circuit to a decoder for double-error-correcting codes. By incorporating ROM's (read only memory) in a decoder, the complex logic circuits are eliminated and then we can easily construct a high- speed decoder. We evaluate the complexity of the decoders and show that each of them can be accommodated in a single chip LSI.Keywords
This publication has 5 references indexed in Scilit:
- A VLSI Design of a Pipeline Reed-Solomon DecoderIEEE Transactions on Computers, 1985
- Single Byte Error Correcting—Double Byte Error Detecting Codes for Memory SystemsIEEE Transactions on Computers, 1982
- A Class of Optimal Minimum Odd-weight-column SEC-DED CodesIBM Journal of Research and Development, 1970
- Decoding of double and triple error correcting Bose-Chaudhuri codes (Corresp.)IEEE Transactions on Information Theory, 1966
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964