On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM

Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively...

Full description

Saved in:
Bibliographic Details
Main Authors: Samuel, Michael, Barsoum, Maged, Fitz, Michael P
Format: Conference Proceeding
Language:English
Subjects:
Binary phase shift keying
Convolutional codes
Euclidean distance
Iterative decoding
MIMO
Multidimensional systems
Mutual information
Partitioning algorithms
Quadrature phase shift keying
Turbo codes
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 985
container_issue
container_start_page 982
container_title
container_volume
creator Samuel, Michael
Barsoum, Maged
Fitz, Michael P
description Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer code like a parallel concatenated turbo code is employed, a simple Gray mapping becomes significantly superior in performance. The aim of this letter is to give a simple and straightforward interpretation of this discrepancy in behavior based on the extrinsic information transfer chart of the iterative receivers in both cases. Parts of the presented results are scattered in the literature but this letter presents a unified look on the mapping suitability problem and answers positively the question of: ¿if a turbo code is used as an outer code in a BICM transmission, is Gray-mapping more suitable than other more complex candidates?¿.
doi_str_mv 10.1109/ACSSC.2009.5470030
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_5470030</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5470030</ieee_id><sourcerecordid>5470030</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-3bb1dd6340de18fec9b1619603e310462048967e4ac51f299fdce8c7cb3a29453</originalsourceid><addsrcrecordid>eNo1kEtPwkAUhcdXIiJ_QDf3DxTvPNtZYuODBMMCVm7ItHMLY0pL2sGk_16MeDYn-b7kLA5jDxynnKN9muWrVT4ViHaqVYoo8YJNbJpxJZTSmTDqko2ETk0iJMordvcvNF6zEUedJUZaecsmff-FpygtrBQj9rlsIO4I-mOIrgh1iAO0FWw7N0ARIuzd4RCabQ-xhfYYqYNy55qGaihbTz2EBsKJuhi-qR7A0y_28DzPP-7ZTeXqnibnHrP168s6f08Wy7d5PlskwWJMZFFw741U6IlnFZW24IZbg5IkR2UEqsyalJQrNa-EtZUvKSvTspBOWKXlmD3-zQYi2hy6sHfdsDm_JH8AUwVW2A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM</title><source>IEEE Xplore All Conference Series</source><creator>Samuel, Michael ; Barsoum, Maged ; Fitz, Michael P</creator><creatorcontrib>Samuel, Michael ; Barsoum, Maged ; Fitz, Michael P</creatorcontrib><description>Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer code like a parallel concatenated turbo code is employed, a simple Gray mapping becomes significantly superior in performance. The aim of this letter is to give a simple and straightforward interpretation of this discrepancy in behavior based on the extrinsic information transfer chart of the iterative receivers in both cases. Parts of the presented results are scattered in the literature but this letter presents a unified look on the mapping suitability problem and answers positively the question of: ¿if a turbo code is used as an outer code in a BICM transmission, is Gray-mapping more suitable than other more complex candidates?¿.</description><identifier>ISSN: 1058-6393</identifier><identifier>ISBN: 1424458250</identifier><identifier>ISBN: 9781424458257</identifier><identifier>EISSN: 2576-2303</identifier><identifier>EISBN: 9781424458264</identifier><identifier>EISBN: 1424458277</identifier><identifier>EISBN: 1424458269</identifier><identifier>EISBN: 9781424458271</identifier><identifier>DOI: 10.1109/ACSSC.2009.5470030</identifier><language>eng</language><publisher>IEEE</publisher><subject>Binary phase shift keying ; Convolutional codes ; Euclidean distance ; Iterative decoding ; MIMO ; Multidimensional systems ; Mutual information ; Partitioning algorithms ; Quadrature phase shift keying ; Turbo codes</subject><ispartof>2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009, p.982-985</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/5470030$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5470030$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Samuel, Michael</creatorcontrib><creatorcontrib>Barsoum, Maged</creatorcontrib><creatorcontrib>Fitz, Michael P</creatorcontrib><title>On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM</title><title>2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers</title><addtitle>ACSSC</addtitle><description>Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer code like a parallel concatenated turbo code is employed, a simple Gray mapping becomes significantly superior in performance. The aim of this letter is to give a simple and straightforward interpretation of this discrepancy in behavior based on the extrinsic information transfer chart of the iterative receivers in both cases. Parts of the presented results are scattered in the literature but this letter presents a unified look on the mapping suitability problem and answers positively the question of: ¿if a turbo code is used as an outer code in a BICM transmission, is Gray-mapping more suitable than other more complex candidates?¿.</description><subject>Binary phase shift keying</subject><subject>Convolutional codes</subject><subject>Euclidean distance</subject><subject>Iterative decoding</subject><subject>MIMO</subject><subject>Multidimensional systems</subject><subject>Mutual information</subject><subject>Partitioning algorithms</subject><subject>Quadrature phase shift keying</subject><subject>Turbo codes</subject><issn>1058-6393</issn><issn>2576-2303</issn><isbn>1424458250</isbn><isbn>9781424458257</isbn><isbn>9781424458264</isbn><isbn>1424458277</isbn><isbn>1424458269</isbn><isbn>9781424458271</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kEtPwkAUhcdXIiJ_QDf3DxTvPNtZYuODBMMCVm7ItHMLY0pL2sGk_16MeDYn-b7kLA5jDxynnKN9muWrVT4ViHaqVYoo8YJNbJpxJZTSmTDqko2ETk0iJMordvcvNF6zEUedJUZaecsmff-FpygtrBQj9rlsIO4I-mOIrgh1iAO0FWw7N0ARIuzd4RCabQ-xhfYYqYNy55qGaihbTz2EBsKJuhi-qR7A0y_28DzPP-7ZTeXqnibnHrP168s6f08Wy7d5PlskwWJMZFFw741U6IlnFZW24IZbg5IkR2UEqsyalJQrNa-EtZUvKSvTspBOWKXlmD3-zQYi2hy6sHfdsDm_JH8AUwVW2A</recordid><startdate>200911</startdate><enddate>200911</enddate><creator>Samuel, Michael</creator><creator>Barsoum, Maged</creator><creator>Fitz, Michael P</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200911</creationdate><title>On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM</title><author>Samuel, Michael ; Barsoum, Maged ; Fitz, Michael P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-3bb1dd6340de18fec9b1619603e310462048967e4ac51f299fdce8c7cb3a29453</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Binary phase shift keying</topic><topic>Convolutional codes</topic><topic>Euclidean distance</topic><topic>Iterative decoding</topic><topic>MIMO</topic><topic>Multidimensional systems</topic><topic>Mutual information</topic><topic>Partitioning algorithms</topic><topic>Quadrature phase shift keying</topic><topic>Turbo codes</topic><toplevel>online_resources</toplevel><creatorcontrib>Samuel, Michael</creatorcontrib><creatorcontrib>Barsoum, Maged</creatorcontrib><creatorcontrib>Fitz, Michael P</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Samuel, Michael</au><au>Barsoum, Maged</au><au>Fitz, Michael P</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM</atitle><btitle>2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers</btitle><stitle>ACSSC</stitle><date>2009-11</date><risdate>2009</risdate><spage>982</spage><epage>985</epage><pages>982-985</pages><issn>1058-6393</issn><eissn>2576-2303</eissn><isbn>1424458250</isbn><isbn>9781424458257</isbn><eisbn>9781424458264</eisbn><eisbn>1424458277</eisbn><eisbn>1424458269</eisbn><eisbn>9781424458271</eisbn><abstract>Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer code like a parallel concatenated turbo code is employed, a simple Gray mapping becomes significantly superior in performance. The aim of this letter is to give a simple and straightforward interpretation of this discrepancy in behavior based on the extrinsic information transfer chart of the iterative receivers in both cases. Parts of the presented results are scattered in the literature but this letter presents a unified look on the mapping suitability problem and answers positively the question of: ¿if a turbo code is used as an outer code in a BICM transmission, is Gray-mapping more suitable than other more complex candidates?¿.</abstract><pub>IEEE</pub><doi>10.1109/ACSSC.2009.5470030</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1058-6393
ispartof 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009, p.982-985
issn 1058-6393
2576-2303
language eng
recordid cdi_ieee_primary_5470030
source IEEE Xplore All Conference Series
subjects Binary phase shift keying
Convolutional codes
Euclidean distance
Iterative decoding
MIMO
Multidimensional systems
Mutual information
Partitioning algorithms
Quadrature phase shift keying
Turbo codes
title On the suitability of gray bit mappings to outer channel codes in iteratively decoded BICM
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T14%3A08%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20suitability%20of%20gray%20bit%20mappings%20to%20outer%20channel%20codes%20in%20iteratively%20decoded%20BICM&rft.btitle=2009%20Conference%20Record%20of%20the%20Forty-Third%20Asilomar%20Conference%20on%20Signals,%20Systems%20and%20Computers&rft.au=Samuel,%20Michael&rft.date=2009-11&rft.spage=982&rft.epage=985&rft.pages=982-985&rft.issn=1058-6393&rft.eissn=2576-2303&rft.isbn=1424458250&rft.isbn_list=9781424458257&rft_id=info:doi/10.1109/ACSSC.2009.5470030&rft.eisbn=9781424458264&rft.eisbn_list=1424458277&rft.eisbn_list=1424458269&rft.eisbn_list=9781424458271&rft_dat=%3Cieee_CHZPO%3E5470030%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-3bb1dd6340de18fec9b1619603e310462048967e4ac51f299fdce8c7cb3a29453%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5470030&rfr_iscdi=true