Shaping methods for low-density lattice codes
Low density lattice codes (LDLC) are recently-proposed lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a correspo...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng ; jpn |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 242 |
---|---|
container_issue | |
container_start_page | 238 |
container_title | |
container_volume | |
creator | Sommer, N. Feder, M. Shalvi, O. |
description | Low density lattice codes (LDLC) are recently-proposed lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. In order to design practical lattice codes, the infinite lattice should be combined with a shaping algorithm, that maps information bits to lattice points and ensures that the power of the lattice codewords is properly constrained. This work proposes several efficient and practical shaping algorithms for LDLC. |
doi_str_mv | 10.1109/ITW.2009.5351439 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5351439</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5351439</ieee_id><sourcerecordid>5351439</sourcerecordid><originalsourceid>FETCH-LOGICAL-i156t-29d036d628fdd8e85b377cc577bda2007cbbbd6f416e65d8ba886b85999774bf3</originalsourceid><addsrcrecordid>eNpVj0tLAzEcxCNSUOveBS_5Alnz-udxlKK2UPBgS48lTxvZdstmQfrtrdiLcxkGfgwzCD0w2jJG7dNitWk5pbYFAUwKe4Uaqw2TXEppjYDrf5mbCbr7xS1VUsENamr9omdJEAzYLSIfO3csh0-8T-OujxXnfsBd_01iOtQynnDnxrGEhEMfU71Hk-y6mpqLT9H69WU1m5Pl-9ti9rwkhYEaCbeRChUVNzlGkwx4oXUIoLWP7rxGB-99VFkylRRE450xyhuw1motfRZT9PjXW1JK2-NQ9m44bS-PxQ9CTkY3</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Shaping methods for low-density lattice codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sommer, N. ; Feder, M. ; Shalvi, O.</creator><creatorcontrib>Sommer, N. ; Feder, M. ; Shalvi, O.</creatorcontrib><description>Low density lattice codes (LDLC) are recently-proposed lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. In order to design practical lattice codes, the infinite lattice should be combined with a shaping algorithm, that maps information bits to lattice points and ensures that the power of the lattice codewords is properly constrained. This work proposes several efficient and practical shaping algorithms for LDLC.</description><identifier>ISBN: 9781424449828</identifier><identifier>ISBN: 1424449820</identifier><identifier>EISBN: 9781424449835</identifier><identifier>EISBN: 1424449839</identifier><identifier>DOI: 10.1109/ITW.2009.5351439</identifier><identifier>LCCN: 2009906465</identifier><language>eng ; jpn</language><publisher>IEEE</publisher><subject>Additive white noise ; Algorithm design and analysis ; AWGN channels ; Binary codes ; Computational complexity ; Conferences ; Information theory ; Iterative decoding ; Lattices ; Vectors</subject><ispartof>2009 IEEE Information Theory Workshop, 2009, p.238-242</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5351439$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5351439$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sommer, N.</creatorcontrib><creatorcontrib>Feder, M.</creatorcontrib><creatorcontrib>Shalvi, O.</creatorcontrib><title>Shaping methods for low-density lattice codes</title><title>2009 IEEE Information Theory Workshop</title><addtitle>ITW</addtitle><description>Low density lattice codes (LDLC) are recently-proposed lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. In order to design practical lattice codes, the infinite lattice should be combined with a shaping algorithm, that maps information bits to lattice points and ensures that the power of the lattice codewords is properly constrained. This work proposes several efficient and practical shaping algorithms for LDLC.</description><subject>Additive white noise</subject><subject>Algorithm design and analysis</subject><subject>AWGN channels</subject><subject>Binary codes</subject><subject>Computational complexity</subject><subject>Conferences</subject><subject>Information theory</subject><subject>Iterative decoding</subject><subject>Lattices</subject><subject>Vectors</subject><isbn>9781424449828</isbn><isbn>1424449820</isbn><isbn>9781424449835</isbn><isbn>1424449839</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVj0tLAzEcxCNSUOveBS_5Alnz-udxlKK2UPBgS48lTxvZdstmQfrtrdiLcxkGfgwzCD0w2jJG7dNitWk5pbYFAUwKe4Uaqw2TXEppjYDrf5mbCbr7xS1VUsENamr9omdJEAzYLSIfO3csh0-8T-OujxXnfsBd_01iOtQynnDnxrGEhEMfU71Hk-y6mpqLT9H69WU1m5Pl-9ti9rwkhYEaCbeRChUVNzlGkwx4oXUIoLWP7rxGB-99VFkylRRE450xyhuw1motfRZT9PjXW1JK2-NQ9m44bS-PxQ9CTkY3</recordid><startdate>20091207</startdate><enddate>20091207</enddate><creator>Sommer, N.</creator><creator>Feder, M.</creator><creator>Shalvi, O.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20091207</creationdate><title>Shaping methods for low-density lattice codes</title><author>Sommer, N. ; Feder, M. ; Shalvi, O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i156t-29d036d628fdd8e85b377cc577bda2007cbbbd6f416e65d8ba886b85999774bf3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng ; jpn</language><creationdate>2009</creationdate><topic>Additive white noise</topic><topic>Algorithm design and analysis</topic><topic>AWGN channels</topic><topic>Binary codes</topic><topic>Computational complexity</topic><topic>Conferences</topic><topic>Information theory</topic><topic>Iterative decoding</topic><topic>Lattices</topic><topic>Vectors</topic><toplevel>online_resources</toplevel><creatorcontrib>Sommer, N.</creatorcontrib><creatorcontrib>Feder, M.</creatorcontrib><creatorcontrib>Shalvi, O.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sommer, N.</au><au>Feder, M.</au><au>Shalvi, O.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Shaping methods for low-density lattice codes</atitle><btitle>2009 IEEE Information Theory Workshop</btitle><stitle>ITW</stitle><date>2009-12-07</date><risdate>2009</risdate><spage>238</spage><epage>242</epage><pages>238-242</pages><isbn>9781424449828</isbn><isbn>1424449820</isbn><eisbn>9781424449835</eisbn><eisbn>1424449839</eisbn><abstract>Low density lattice codes (LDLC) are recently-proposed lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation of a corresponding integer message vector b, i.e., x = Gb, where H = G -1 is restricted to be sparse. In order to design practical lattice codes, the infinite lattice should be combined with a shaping algorithm, that maps information bits to lattice points and ensures that the power of the lattice codewords is properly constrained. This work proposes several efficient and practical shaping algorithms for LDLC.</abstract><pub>IEEE</pub><doi>10.1109/ITW.2009.5351439</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9781424449828 |
ispartof | 2009 IEEE Information Theory Workshop, 2009, p.238-242 |
issn | |
language | eng ; jpn |
recordid | cdi_ieee_primary_5351439 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Additive white noise Algorithm design and analysis AWGN channels Binary codes Computational complexity Conferences Information theory Iterative decoding Lattices Vectors |
title | Shaping methods for low-density lattice codes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T05%3A48%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Shaping%20methods%20for%20low-density%20lattice%20codes&rft.btitle=2009%20IEEE%20Information%20Theory%20Workshop&rft.au=Sommer,%20N.&rft.date=2009-12-07&rft.spage=238&rft.epage=242&rft.pages=238-242&rft.isbn=9781424449828&rft.isbn_list=1424449820&rft_id=info:doi/10.1109/ITW.2009.5351439&rft_dat=%3Cieee_6IE%3E5351439%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424449835&rft.eisbn_list=1424449839&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5351439&rfr_iscdi=true |