Pairwise joint probability propagation in BICM-ID

Pairwise joint probability propagation in BICM-ID

The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be crit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Alberge, F.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Approximation methods
Bit error rate
Iterative decoding
Joints
Linear programming
Maximum likelihood decoding
Optimization
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 10
container_issue
container_start_page 6
container_title
container_volume
creator Alberge, F.
description The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits. The particular case of pairwise joint probability propagation is investigated. Its computational complexity is similar to standard iterative decoding. Simulations show the favorable behavior of the proposed method.
doi_str_mv 10.1109/ISTC.2012.6325188
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6325188</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6325188</ieee_id><sourcerecordid>6325188</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1338-f4408abe00fb9c4457ee663342097f1a191521d781170f30322c4406f66040653</originalsourceid><addsrcrecordid>eNo1j91Kw0AUhFdUsK15APEmL7DpOXv291Jj1UBFwXpdNrorW2oSkoD07Y1Yr2YGhuEbxq4QCkRwy-p1UxYCUBSahEJrT9gcpTJGIJI7ZZkz9j9LecZmArXi0gBcsGwYdgBAaB1KmDF88an_TkPId21qxrzr29rXaZ_Gw6_v_KcfU9vkqclvq_KJV3eX7Dz6_RCyoy7Y2_1qUz7y9fNDVd6seUIiy6OUYH0dAGLt3uWEE4LWRFKAMxE9OlQCPyZSNBAJSIipBTpqDZMoWrDrv90UQth2ffry_WF7fEw_DGFECA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Pairwise joint probability propagation in BICM-ID</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Alberge, F.</creator><creatorcontrib>Alberge, F.</creatorcontrib><description>The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits. The particular case of pairwise joint probability propagation is investigated. Its computational complexity is similar to standard iterative decoding. Simulations show the favorable behavior of the proposed method.</description><identifier>ISSN: 2165-4700</identifier><identifier>ISBN: 9781457721144</identifier><identifier>ISBN: 1457721147</identifier><identifier>EISBN: 1457721139</identifier><identifier>EISBN: 9781457721137</identifier><identifier>EISBN: 9781457721151</identifier><identifier>EISBN: 1457721155</identifier><identifier>DOI: 10.1109/ISTC.2012.6325188</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation methods ; Bit error rate ; Iterative decoding ; Joints ; Linear programming ; Maximum likelihood decoding ; Optimization</subject><ispartof>2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012, p.6-10</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6325188$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6325188$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Alberge, F.</creatorcontrib><title>Pairwise joint probability propagation in BICM-ID</title><title>2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)</title><addtitle>ISTC</addtitle><description>The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits. The particular case of pairwise joint probability propagation is investigated. Its computational complexity is similar to standard iterative decoding. Simulations show the favorable behavior of the proposed method.</description><subject>Approximation methods</subject><subject>Bit error rate</subject><subject>Iterative decoding</subject><subject>Joints</subject><subject>Linear programming</subject><subject>Maximum likelihood decoding</subject><subject>Optimization</subject><issn>2165-4700</issn><isbn>9781457721144</isbn><isbn>1457721147</isbn><isbn>1457721139</isbn><isbn>9781457721137</isbn><isbn>9781457721151</isbn><isbn>1457721155</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j91Kw0AUhFdUsK15APEmL7DpOXv291Jj1UBFwXpdNrorW2oSkoD07Y1Yr2YGhuEbxq4QCkRwy-p1UxYCUBSahEJrT9gcpTJGIJI7ZZkz9j9LecZmArXi0gBcsGwYdgBAaB1KmDF88an_TkPId21qxrzr29rXaZ_Gw6_v_KcfU9vkqclvq_KJV3eX7Dz6_RCyoy7Y2_1qUz7y9fNDVd6seUIiy6OUYH0dAGLt3uWEE4LWRFKAMxE9OlQCPyZSNBAJSIipBTpqDZMoWrDrv90UQth2ffry_WF7fEw_DGFECA</recordid><startdate>201208</startdate><enddate>201208</enddate><creator>Alberge, F.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201208</creationdate><title>Pairwise joint probability propagation in BICM-ID</title><author>Alberge, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1338-f4408abe00fb9c4457ee663342097f1a191521d781170f30322c4406f66040653</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Approximation methods</topic><topic>Bit error rate</topic><topic>Iterative decoding</topic><topic>Joints</topic><topic>Linear programming</topic><topic>Maximum likelihood decoding</topic><topic>Optimization</topic><toplevel>online_resources</toplevel><creatorcontrib>Alberge, F.</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>Alberge, F.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Pairwise joint probability propagation in BICM-ID</atitle><btitle>2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)</btitle><stitle>ISTC</stitle><date>2012-08</date><risdate>2012</risdate><spage>6</spage><epage>10</epage><pages>6-10</pages><issn>2165-4700</issn><isbn>9781457721144</isbn><isbn>1457721147</isbn><eisbn>1457721139</eisbn><eisbn>9781457721137</eisbn><eisbn>9781457721151</eisbn><eisbn>1457721155</eisbn><abstract>The iterative decoding of BICM is analyzed from an optimization point of view. The objective function underlying the standard iterative decoding is a coarse approximation of the optimal Maximum Likelihood Decoding. This approximation is suitable when large block of data are processed but may be critical for short blocks. In this contribution, it is proved that refined approximations can be obtained by propagating extrinsics on groups of bits. The particular case of pairwise joint probability propagation is investigated. Its computational complexity is similar to standard iterative decoding. Simulations show the favorable behavior of the proposed method.</abstract><pub>IEEE</pub><doi>10.1109/ISTC.2012.6325188</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2165-4700
ispartof 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2012, p.6-10
issn 2165-4700
language eng
recordid cdi_ieee_primary_6325188
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Approximation methods
Bit error rate
Iterative decoding
Joints
Linear programming
Maximum likelihood decoding
Optimization
title Pairwise joint probability propagation in BICM-ID
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T02%3A18%3A53IST&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=Pairwise%20joint%20probability%20propagation%20in%20BICM-ID&rft.btitle=2012%207th%20International%20Symposium%20on%20Turbo%20Codes%20and%20Iterative%20Information%20Processing%20(ISTC)&rft.au=Alberge,%20F.&rft.date=2012-08&rft.spage=6&rft.epage=10&rft.pages=6-10&rft.issn=2165-4700&rft.isbn=9781457721144&rft.isbn_list=1457721147&rft_id=info:doi/10.1109/ISTC.2012.6325188&rft_dat=%3Cieee_6IE%3E6325188%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457721139&rft.eisbn_list=9781457721137&rft.eisbn_list=9781457721151&rft.eisbn_list=1457721155&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6325188&rfr_iscdi=true