Low-Density Parity-Check Lattices: Construction and Decoding Analysis

Low-density parity-check codes (LDPC) can have an impressive performance under iterative decoding algorithms. In this paper we introduce a method to construct high coding gain lattices with low decoding complexity based on LDPC codes. To construct such lattices we apply Construction D', due to...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 52; no. 10; pp. 4481 - 4495
Main Authors:	Sadeghi, M.-R., Banihashemi, A.H., Panario, D.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.10.2006 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Additive white Gaussian noise (AWGN) channel Algorithms Applied sciences AWGN Broadband communication Codes Coding, codes Communications networks Complexity Construction Decoding Density Error probability Exact sciences and technology Gaussian noise Information, signal and communications theory Iterative algorithms Iterative decoding lattice codes Lattices low-density parity-check (LDPC) codes low-density parity-check (LDPC) lattices Methods min-sum algorithm Noise levels Parity Parity check codes progressive-edge growth (PEG) construction Signal and communications theory Signal to noise ratio Tanner graphs Telecommunications and information theory Wireless communication Performance evaluation lattice codes Error probability low-density parity-check (LDPC) lattices Additive white Gaussian noise (AWGN) channel min-sum algorithm Trellis code Algorithm Iterative decoding Tanner graphs low-density parity-check (LDPC) codes progressive-edge growth (PEG) construction Algorithm complexity Parity check codes Error correcting code lattices Parity check
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!