Abstract
In an earlier paper, bit flipping methods for decoding low-density parity-check (LDPC) codes on the binary symmetric channel were adapted for generalised LDPC (GLDPC) codes with Hamming sub-codes. We now employ the analysis of this weighted bit flipping method to develop a simple softinput/ soft-output decoder for Hamming codes based on a conventional hard decision decoder. Simulation results are presented for decoding of both product codes and GLDPCs on the AWGN channel using the proposed decoder. At higher rates the indications are that good performance is possible at very low decoding complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berrou, C., and Glavieux, A.,“Near optimum error correcting coding and decoding: turbocodes”, IEEE Trans. Commun., vol. 44, no. 10, pp. 1261–1271, Oct. 1996.
Hirst, S., and Honary, B., “Approaching cut-off rate on the binary symmetric channel using weighted bit flipping”, Proc. of 6 th Int. Symp. Commun. Theory & Applic. (ISCTA’ 01), pp. 375–380, Ambleside, UK, July2001.
Hirst, S., and Honary, B., “Decoding of generalised low-density parity-check codes using weighted bit flip voting”, To appear in IEE Proc. Commun..
Kou, Y., Lin, S., and Fossorier, M. P. C., “Low density parity check codes based on finite geometries: a rediscovery and more”, Submitted to IEEE Trans. Inform. Theory..
Lentmaier, M., and Zigangirov, K. Sh., “On generalised low-density parity-check codes based on Hamming component codes”, IEEE Commun. Letters, vol. 3, no. 8, pp. 248–250, Aug. 1999.
MacKay, D. J. C., “Good error-correcting codes based on very sparse matrices”, IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399–431, Mar. 1999.
Sipser, M., and Spielman, D. A., “Expander codes”, IEEE Trans. Inform. Theory, vol. 42, no. 6, pp. 1710–1722, Nov. 1996.
Tanner, R. M., “A recursive approach to low complexity codes”, IEEE Trans. Inform. Theory, vol. IT-27, no. 5, pp. 533–547, Sept. 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirst, S., Honary, B. (2001). A Simple Soft-Input/Soft-Output Decoder for Hamming Codes. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive