Loading [MathJax]/extensions/MathMenu.js
New results on Construction A lattices based on very sparse parity-check matrices | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Monday, 30 June, IEEE Xplore will undergo scheduled maintenance from 1:00-2:00 PM ET (1800-1900 UTC).
On Tuesday, 1 July, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC).
During these times, there may be intermittent impact on performance. We apologize for any inconvenience.

New results on Construction A lattices based on very sparse parity-check matrices


Abstract:

We address the problem of transmission of information over the AWGN channel using lattices. In particular, we will deal with previously introduced LDA lattices which are ...Show More

Abstract:

We address the problem of transmission of information over the AWGN channel using lattices. In particular, we will deal with previously introduced LDA lattices which are obtained by Construction A from LDPC codes over the finite field Fp. We will show how to build a particular ensemble of LDA lattices related to bipartite graphs with good expansion properties. We investigate the quality of this family under lattice decoding and show that a random member in it can be reliably decoded for any value of the channel noise variance up to Poltyrev limit. Values of p and the parameters for which optimal performance is guaranteed under lattice decoding are in accordance with the optimal parameters found experimentally under iterative decoding.
Date of Conference: 07-12 July 2013
Date Added to IEEE Xplore: 07 October 2013
Electronic ISBN:978-1-4799-0446-4

ISSN Information:

Conference Location: Istanbul, Turkey

Contact IEEE to Subscribe

References

References is not available for this document.