Skip to main content
Log in

Two Extended Programmable BCH Soft Decoders Using Least Reliable Bits Reprocessing

  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

This paper proposes two Bose–Chaudhuri–Hocquenghem (BCH) soft decoders suitable for high-rate codes with medium to large word length. The proposed decoders extend the correcting capability by providing a programmable performance gain according to the choice of the extra compensated bits p, with a theoretical maximum likelihood decoding when 2t+p approaches the codeword size n, where t is the correcting capability of the code under algebraic decoding. Our proposed architectures for the proposed algorithms use pipelined arithmetic units, leading to a reduction in the critical paths. This allows for an increase in the operating frequency by up to m/2 times compared to algebraic decoders, where m is the Galois field size. Our proposed decoders operate only on the least reliable bits, which leads to a reduction in the decoder complexity by removing the Chien search procedure.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Algorithm 1
Algorithm 2
Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. C.R. Baugh, B.A. Wooley, Theory and Practice of Error Control Codes (Addison-Wesley, Reading, 1983)

    Google Scholar 

  2. E.R. Berlekamp, Algebraic Coding Theory (Aegean Park Press/McGraw-Hill, New York, 1968)

    MATH  Google Scholar 

  3. A. Bjorck, V. Pereyra, Solution of Vandermonde systems of equations. Math. Comput. 24, 893–903 (1970)

    Article  MathSciNet  Google Scholar 

  4. D. Chase, A class of algorithms for decoding block codes with channel measurement information. IEEE Trans. Inf. Theory 18, 170–182 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  5. Digital Video Broadcasting (DVB), Frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system (DVB-T2). ETSI standard (2009)

  6. S.T.J. Fenn, M. Benaissa, D. Taylor, GF(2m) multiplication and division over the dual field. IEEE Trans. Comput. 45, 319–327 (1996)

    Article  MATH  Google Scholar 

  7. G.D. Forney, Generalized minimum distance decoding. IEEE Trans. Inf. Theory 12, 125–131 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Fossorier, S. Lin, Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans. Inf. Theory 41, 1379–1396 (1995)

    Article  MATH  Google Scholar 

  9. J. Hong, M. Vetterli, Simple algorithms for BCH decoding. IEEE Trans. Commun. 43, 2324–2333 (1995)

    Article  MATH  Google Scholar 

  10. S.K. Jain, L. Song, K.K. Parhi, Efficient semisystolic architectures for finite-field arithmetic. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 6, 101–113 (1998)

    Article  Google Scholar 

  11. J. Jiang, K.R. Narayanan, Iterative soft-input–soft-output decoding of Reed–Solomon codes by adapting the parity check matrix. IEEE Trans. Inf. Theory 52, 3746–3756 (2006)

    Article  MathSciNet  Google Scholar 

  12. W. Jin, M. Fossorier, Efficient box and match algorithm for reliability-based soft-decision decoding of linear block codes, in Information Theory and Applications Workshop (2007), pp. 160–169

    Google Scholar 

  13. M. Lalam, K. Amis, D. Lerous, D. Feng, J. Yuan, An improved iterative decoding algorithm for block turbo codes, in Proc. IEEE Int. Symp. Inf. Theory (2006), pp. 2403–2407

    Google Scholar 

  14. Y.M. Lin, C. Chen, H. Chang, C. Lee, A 26.9 K 314.5 Mb/s soft (32400, 32208) BCH decoder chip for DVB-S2 system. IEEE J. Solid-State Circuits 45(11), 2330–2340 (2010)

    Google Scholar 

  15. Y.M. Lin, H. Chang, C. Lee, An improved soft BCH decoder with one extra error compensation, in Proc. ISCAS, Paris, France (2011), pp. 3941–3944

    Google Scholar 

  16. W. Liu, J. Rho, W. Sung, Low-power high-throughput BCH error correction VLSI design for multi-level cell NAND flash memories, in Proc. SiPS, Banff, Alberta, Canada (2006), pp. 303–308

    Google Scholar 

  17. I.S. Reed, M.T. Shih, T.K. Truong, VLSI design of inverse-free Berlekamp–Massey algorithm. Proc. Inst. Electr. Eng. 138, 295–298 (1991)

    Google Scholar 

  18. W.J. Reid III., L.L. Joiner, J.J. Komo, Soft decision decoding of BCH codes using error magnitudes, in IEEE Int. Symp. Inf. Theory (1997), p. 303

    Chapter  Google Scholar 

  19. A. Valembois, M. Fossorier, Box and match techniques applied to soft decision decoding, in IEEE Int. Symp. Inf. Theory (2002), p. 143

    Chapter  Google Scholar 

  20. S.W. Wei, VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2m). IEEE Trans. Circuits Syst. II 44, 847–855 (1997)

    Google Scholar 

  21. J.S. Yedidia, J. Chen, M. Fossorier, Generating code representations suitable for belief propagation decoding, in Proc. Allerton (2002)

    Google Scholar 

  22. X. Zhang, J. Zhu, Y. Wu, Efficient one-pass Chase soft-decision BCH decoder for multi-level cell NAND flash memory, in Proc. MWSCAS (2011), pp. 1–4

    Google Scholar 

Download references

Acknowledgements

This work was supported by a grant from the National Telecommunication Regulatory Authority (NTRA) Egypt.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohamed T. A. Osman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Osman, M.T.A., Fahmy, H.A.H., Fahmy, Y.A.H. et al. Two Extended Programmable BCH Soft Decoders Using Least Reliable Bits Reprocessing. Circuits Syst Signal Process 33, 1369–1391 (2014). https://doi.org/10.1007/s00034-013-9709-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-013-9709-x

Keywords

Navigation