publication . Conference object . Preprint . 2013

On the performance of 1-level LDPC lattices

Sadeghi, Mohammad-Reza; Sakzad, Amin;
Open Access
  • Published: 03 Feb 2013
  • Publisher: IEEE
Abstract
The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower coding gain, 1-level regular LDPC lattices have remarkable performances. The lower complexity nature of the decoding algorithm for these type of lattices allows us to run it for higher dimensions easily. Our simulation results show that a 1-level LDPC lattice of size 10000 can work as close as 1.1 dB at normalized...
Subjects
arXiv: High Energy Physics::LatticeComputer Science::Information Theory
free text keywords: Decoding methods, Normalization (statistics), Mathematics, Low-density parity-check code, Symbol error rate, Coding gain, Encoding (memory), Lattice (order), Discrete mathematics, Sparse matrix, Computer Science - Information Theory
Related Organizations
19 references, page 1 of 2

[1] I-B. Baik and S-Y. Chung, “Irregular low-density parity-check lattices,” Proceeding of IEEE ISIT 2008, Toronto, Canada 2008.

[2] A. H. Banihashemi and F. R. Kschischang, “Tanner graphs for block codes and lattices: construction and complexity,” IEEE Trans. Inform. Theory, vol. 47, pp. 822-834, 2001.

[3] J. Boutros, E. Viterbo, C. Rastello, and J.-C. Belfiore, “Good lattice constellations for both Rayleigh fading and Gaussian channels,” IEEE Trans. Inform. Theory, vol. 42, pp. 502-518, 1996.

[4] Y-S. Choi, I-J. Baik, and S-Y. Chung, “Iterative decoding for low-density parity-check lattices,” Proceeding of ICACT 2008, pp. 358-361, 2008.

[5] J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups, 3rd ed., new York: Springer- Verlag, 1998.

[6] J. Dauwels, B. M. Kurkoski, and H.-A. Loeliger, “Power-constrained communications using LDLC lattices,” Proceeding of IEEE ISIT 2009, pp. 739-743, 2009. [OpenAIRE]

[7] U. Erez and R. Zamir, “Achieving 1 log(1 + SNR) on the AWGN 2 channel with lattice encoding and decoding,” IEEE Trans. Inform. Theory, vol. 50, pp. 2293-2314, 2004.

[8] G. D. Forney, “Approaching the capacity of the AWGN channel with coset codes and multilevel coset codes,” Proceeding of IEEE ISIT 1997, pp. 164-164, 1997.

[9] G. D. Forney, M. D. Trott, and S.-Y. Chung, “Sphere-bound-achieving coset codes and multilevel coset codes,” IEEE Trans. Inform. Theory, vol. 46, pp. 820-850, 2000.

[10] G. D. Forney and G. Ungerboeck, “Modulation and coding for linear Gaussian channels,” IEEE Trans. Inform. Theory, vol. 44, pp. 2384-2415, 1998. [OpenAIRE]

[11] G. Poltyrev, “On coding without restrictions for the AWGN channel,” IEEE Trans. Inform. Theory, vol. 40, pp.409-417, 1994.

[12] M.-R. Sadeghi, A. H. Banihashemi, and D. Panario, “Low-density parity check lattices: construction and decoding analysis,” IEEE Trans. Inform. Theory, vol. 52, pp. 4481-4495, 2006.

[13] M.-R. Sadeghi and D. Panario, “Low-density parity-check lattices based on Construction D′ and cycle-free Tanner Graph,” DIMACS 2003, vol. 68, pp. 86-90, 2003.

[14] A. Sakzad, and M.-R. Sadeghi, “On cycle-free lattices with high rate label codes,” Advances in Mathematices of Communications, vol. 4, pp. 441-452, 2010.

[15] A. Sakzad, M.-R. Sadeghi, and D. Panario, “Construction of turbo lattices,” Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on, pp. 14-22, 2010.

19 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue