Design of efficient codes for the AWGN channel based on decomposable binary lattices
This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some...
Gespeichert in:
| Veröffentlicht in: | Compel 1998-12, Vol.17 (6), p.757-764 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 764 |
|---|---|
| container_issue | 6 |
| container_start_page | 757 |
| container_title | Compel |
| container_volume | 17 |
| creator | Calabrò, Stefano Campanella, Matteo Garbo, Giovanni |
| description | This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded-distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented. |
| doi_str_mv | 10.1108/03321649810221387 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_istex</sourceid><recordid>TN_cdi_proquest_miscellaneous_28268444</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28268444</sourcerecordid><originalsourceid>FETCH-LOGICAL-c432t-974e5e077ad0096ebf3ecab14749509a9843096390df78dca6fa1115b951b5b13</originalsourceid><addsrcrecordid>eNqFkU1PGzEQhi1EpQboD-jN4lAuXfDX-uOIaBOooiJQKo6W1zuGhc062Bup_HscpeJQWvBlJM_zvnpnBqHPlBxTSvQJ4ZxRKYymhDHKtdpBE0ZqUdWSyF002fSrDfAR7eV8T8ozNZmgxTfI3e2AY8AQQuc7GEbsYwsZh5jweAf49Gb2E_s7NwzQ48ZlaHEccAs-Llcxu6YH3HSDS0-4d-PYecgH6ENwfYZPf-o--jX9vjg7r-aXs4uz03nlBWdjZZSAGohSri1pJDSBg3cNFUqUbMYZLXj554a0QenWOxkcpbRuTE2buqF8Hx1tfVcpPq4hj3bZZQ997waI62yV4FKVSXkhv7xJMs2kFkK8DyqhiSS6gId_gfdxnYYyrmXEGEKp2rjRLeRTzDlBsKvULcuqLCV2czf76m5FU201XR7h94vApQcrFVe1FTfMzq8W1z-m7NzOCv91y8MSkuvbF8Ura7tqQ8HJv_H_J3oGFAKyjA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>209901174</pqid></control><display><type>article</type><title>Design of efficient codes for the AWGN channel based on decomposable binary lattices</title><source>Emerald Journals</source><creator>Calabrò, Stefano ; Campanella, Matteo ; Garbo, Giovanni</creator><creatorcontrib>Calabrò, Stefano ; Campanella, Matteo ; Garbo, Giovanni</creatorcontrib><description>This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded-distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.</description><identifier>ISSN: 0332-1649</identifier><identifier>EISSN: 2054-5606</identifier><identifier>DOI: 10.1108/03321649810221387</identifier><identifier>CODEN: CODUDU</identifier><language>eng</language><publisher>Bradford: MCB UP Ltd</publisher><subject>Algorithms ; Approximation ; Binary system ; Codes ; Data transmission ; Decomposition ; Digital transmission ; Electrical engineering ; Error coefficient ; Hypotheses ; Lattice code ; Linear codes ; Mathematical models ; Studies ; Systems design</subject><ispartof>Compel, 1998-12, Vol.17 (6), p.757-764</ispartof><rights>MCB UP Limited</rights><rights>Copyright MCB UP Limited (MCB) 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c432t-974e5e077ad0096ebf3ecab14749509a9843096390df78dca6fa1115b951b5b13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/03321649810221387/full/pdf$$EPDF$$P50$$Gemerald$$H</linktopdf><linktohtml>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/03321649810221387/full/html$$EHTML$$P50$$Gemerald$$H</linktohtml><link.rule.ids>314,780,784,967,11635,27924,27925,52686,52689</link.rule.ids></links><search><creatorcontrib>Calabrò, Stefano</creatorcontrib><creatorcontrib>Campanella, Matteo</creatorcontrib><creatorcontrib>Garbo, Giovanni</creatorcontrib><title>Design of efficient codes for the AWGN channel based on decomposable binary lattices</title><title>Compel</title><description>This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded-distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Binary system</subject><subject>Codes</subject><subject>Data transmission</subject><subject>Decomposition</subject><subject>Digital transmission</subject><subject>Electrical engineering</subject><subject>Error coefficient</subject><subject>Hypotheses</subject><subject>Lattice code</subject><subject>Linear codes</subject><subject>Mathematical models</subject><subject>Studies</subject><subject>Systems design</subject><issn>0332-1649</issn><issn>2054-5606</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqFkU1PGzEQhi1EpQboD-jN4lAuXfDX-uOIaBOooiJQKo6W1zuGhc062Bup_HscpeJQWvBlJM_zvnpnBqHPlBxTSvQJ4ZxRKYymhDHKtdpBE0ZqUdWSyF002fSrDfAR7eV8T8ozNZmgxTfI3e2AY8AQQuc7GEbsYwsZh5jweAf49Gb2E_s7NwzQ48ZlaHEccAs-Llcxu6YH3HSDS0-4d-PYecgH6ENwfYZPf-o--jX9vjg7r-aXs4uz03nlBWdjZZSAGohSri1pJDSBg3cNFUqUbMYZLXj554a0QenWOxkcpbRuTE2buqF8Hx1tfVcpPq4hj3bZZQ997waI62yV4FKVSXkhv7xJMs2kFkK8DyqhiSS6gId_gfdxnYYyrmXEGEKp2rjRLeRTzDlBsKvULcuqLCV2czf76m5FU201XR7h94vApQcrFVe1FTfMzq8W1z-m7NzOCv91y8MSkuvbF8Ura7tqQ8HJv_H_J3oGFAKyjA</recordid><startdate>19981201</startdate><enddate>19981201</enddate><creator>Calabrò, Stefano</creator><creator>Campanella, Matteo</creator><creator>Garbo, Giovanni</creator><general>MCB UP Ltd</general><general>Emerald Group Publishing Limited</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>7U5</scope></search><sort><creationdate>19981201</creationdate><title>Design of efficient codes for the AWGN channel based on decomposable binary lattices</title><author>Calabrò, Stefano ; Campanella, Matteo ; Garbo, Giovanni</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c432t-974e5e077ad0096ebf3ecab14749509a9843096390df78dca6fa1115b951b5b13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Binary system</topic><topic>Codes</topic><topic>Data transmission</topic><topic>Decomposition</topic><topic>Digital transmission</topic><topic>Electrical engineering</topic><topic>Error coefficient</topic><topic>Hypotheses</topic><topic>Lattice code</topic><topic>Linear codes</topic><topic>Mathematical models</topic><topic>Studies</topic><topic>Systems design</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Calabrò, Stefano</creatorcontrib><creatorcontrib>Campanella, Matteo</creatorcontrib><creatorcontrib>Garbo, Giovanni</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Solid State and Superconductivity Abstracts</collection><jtitle>Compel</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Calabrò, Stefano</au><au>Campanella, Matteo</au><au>Garbo, Giovanni</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Design of efficient codes for the AWGN channel based on decomposable binary lattices</atitle><jtitle>Compel</jtitle><date>1998-12-01</date><risdate>1998</risdate><volume>17</volume><issue>6</issue><spage>757</spage><epage>764</epage><pages>757-764</pages><issn>0332-1649</issn><eissn>2054-5606</eissn><coden>CODUDU</coden><abstract>This work is concerned with the use of binary decomposable lattice codes over the QAM Gaussian channel. First, we investigate the structure of such class of lattices: we derive consistency conditions for the binary codes appearing in their decomposition and express their nominal coding gain and some bounds for their error coefficient in terms of the parameters of the component codes. Then we describe a general multistage bounded-distance decoding algorithm with low complexity and we evaluate its performance. Finally, we develop a design example and report the corresponding simulation results; as a reference some comparisons with standard TCM codes are also presented.</abstract><cop>Bradford</cop><pub>MCB UP Ltd</pub><doi>10.1108/03321649810221387</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0332-1649 |
| ispartof | Compel, 1998-12, Vol.17 (6), p.757-764 |
| issn | 0332-1649 2054-5606 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28268444 |
| source | Emerald Journals |
| subjects | Algorithms Approximation Binary system Codes Data transmission Decomposition Digital transmission Electrical engineering Error coefficient Hypotheses Lattice code Linear codes Mathematical models Studies Systems design |
| title | Design of efficient codes for the AWGN channel based on decomposable binary lattices |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T10%3A33%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_istex&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Design%20of%20efficient%20codes%20for%20the%20AWGN%20channel%20based%20on%20decomposable%20binary%20lattices&rft.jtitle=Compel&rft.au=Calabr%C3%B2,%20Stefano&rft.date=1998-12-01&rft.volume=17&rft.issue=6&rft.spage=757&rft.epage=764&rft.pages=757-764&rft.issn=0332-1649&rft.eissn=2054-5606&rft.coden=CODUDU&rft_id=info:doi/10.1108/03321649810221387&rft_dat=%3Cproquest_istex%3E28268444%3C/proquest_istex%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=209901174&rft_id=info:pmid/&rfr_iscdi=true |