Abstract
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC (proto-)graphs, by which we mean Hamming or recursive systematic convolutional (RSC) code constraints are used together with single-parity-check (SPC) constraints to construct a code’s protograph. We show that the doping of a “good” graph with Hamming or RSC codes is a pragmatic approach that frequently results in a code with a good threshold and very low error-rate floor. We focus on low-rate Tanner codes, in part because the design of low-rate, low-floor LDPC codes is particularly difficult. Lastly, we perform a simple complexity analysis of our Tanner codes and examine the performance of lower-complexity, suboptimal Hamming-node decoders.
This work was funded by NASA-JPL grant 1264726 and by the University of Bologna, Progetto Pluriennale.
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.
References
Gallager, R.G.: Low-density parity-check codes. IRE Transactions on Information Theory 8, 21–28 (1962)
Tanner, R.M.: A recursive approach to low complexity codes. IEEE Transactions on Information Theory 27, 533–547 (1981)
Elias, P.: Error free coding. IRE Transactions on Information Theory PGIT-4, 29–37 (1954)
Lentmaier, M., Zigangirov, K.S.: Iterative decoding of generalized low-density parity-check codes. In: IEEE International Symposium on Information Theory, August 1998, p. 149 (1998)
Boutros, J., Pothier, O., Zemor, G.: Generalized low density (Tanner) codes. In: IEEE International Conference on Communications, ICC 1999, June 1999, pp. 441–445 (1999)
Miladinovic, N., Fossorier, M.: Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels. In: IEEE Global Telecommunications Conference, GLOBECOM 2005 (November 2005)
Vialle, S., Boutros, J.: A Gallager-Tanner construction based on convolutional codes. In: Proceedings of International Workshop on Coding and Cryptography, WCC 1999, January 1999, pp. 393–404 (1999)
Liva, G., Ryan, W.E.: Short low-error-floor Tanner codes with Hamming nodes. In: IEEE Military Communications Conference, MILCOM 2005 (2005)
Liva, G., Ryan, W.E., Chiani, M.: Design of quasi-cyclic Tanner codes with low error floors. In: 4th International Symposium on Turbo Codes, ISTC 2006 (April 2006)
Thorpe, J.: Low-density parity-check (LDPC) codes constructed from protographs. Tech. Rep. 42-154, IPN Progress Report (August 2003)
Mao, Y., Banihashemi, A.H.: A heuristic search for good low-density parity-check codes at short block lengths. In: IEEE International Conference on Communications, ICC 2001, June 2001, pp. 41–44 (2001)
McEliece, R.J.: On the BCJR trellis for linear block codes. IEEE Transactions on Information Theory 42, 1072–1092 (1996)
ten Brink, S., Kramer, G., Ashikhmin, A.: Design of low-density parity-check codes for modulation and detection. IEEE Transactions on Communications 52, 670–678 (2004)
Lin, I.D.S., Xu, J., Tang, H.: Hybrid construction of LDPC codes. In: Proc. of the 40th Annual Allerton Conference on Communication, Control, and Computing, Illinois (October 2002)
Abbasfar, A., Divsalar, D., Yao, K.: Accumulate repeat accumulate codes. In: IEEE Global Telecommunications Conference, GLOBECOM 2004, November 2004, pp. 509–513 (2004)
Divsalar, D., Jin, H., McEliece, R.: Coding theorems for “turbo-like” codes. In: Proc. of 36th Allerton Conf. (September 1998)
Bahl, L.R., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory 20, 284–287 (1974)
Pyndiah, R.M.: Near-optimum decoding of product codes: Block turbo codes. IEEE Transactions on Communications 46, 1003–1010 (1998)
Block decoding with soft output information. Patent 5930272, United States Patent (July 1999)
Hu, X.Y., Eleftheriou, E., Arnold, D.M.: Progressive edge-growth Tanner graphs. In: IEEE Global Telecommunications Conference, GLOBECOM 2001, November 2001, pp. 995–1001 (2001)
Tanner, R.M.: On quasi-cyclic repeat-accumulate codes. In: Proc. of the 37th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois (September 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abu-Surra, S., Liva, G., Ryan, W.E. (2006). Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_24
Download citation
DOI: https://doi.org/10.1007/11617983_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31423-3
Online ISBN: 978-3-540-31424-0
eBook Packages: Computer ScienceComputer Science (R0)