Variance of the turbo code performance bound over the interleavers
We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all possible interleavers of length N, under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2002-07, Vol.48 (7), p.2078-2086 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 2086 |
|---|---|
| container_issue | 7 |
| container_start_page | 2078 |
| container_title | IEEE transactions on information theory |
| container_volume | 48 |
| creator | Mohammadi, A.H.S. Weihua Zhuang |
| description | We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all possible interleavers of length N, under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of variation of the bound increases with the signal-to-noise ratio and decreases with the interleaver length. Theoretical analysis for large interleaver lengths shows that the coefficient of variation asymptotically approaches a constant value. The results also demonstrate that the majority of the interleavers have performance bounds very close to the average value of the bound. This phenomenon is more palpable for larger interleaver lengths. |
| doi_str_mv | 10.1109/TIT.2002.1013147 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2002_1013147</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1013147</ieee_id><sourcerecordid>1671308375</sourcerecordid><originalsourceid>FETCH-LOGICAL-c394t-f17958a1626bd86f752237dc85f3bc5dd97125ec2011e7a0991cf00e93421e3b3</originalsourceid><addsrcrecordid>eNp9kL1PwzAQxS0EEqWwI7FEDIglxWfHcTxCxUelSiyF1Uqcs0iVxsVOkPjvcZsOiIHp9PR-73T3CLkEOgOg6m61WM0YpWwGFDhk8ohMQAiZqlxkx2RCKRSpyrLilJyFsI4yE8Am5OG99E3ZGUycTfoPTPrBVy4xrsZki946v9m7lRu6OnFf6PdU0_XoWyyjDufkxJZtwIvDnJK3p8fV_CVdvj4v5vfL1HCV9akFqURRQs7yqi5yKwVjXNamEJZXRtS1ksAEGkYBUJZUKTCWUlQ8Y4C84lNyM-7devc5YOj1pgkG27bs0A1Bs0LygnMawdt_QcglcFpwKSJ6_Qddu8F38Q0N8VopqFARoiNkvAvBo9Vb32xK_62B6l35Opavd-XrQ_kxcjVGGkT8hY_uDwAjfg0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195875059</pqid></control><display><type>article</type><title>Variance of the turbo code performance bound over the interleavers</title><source>IEEE Electronic Library (IEL)</source><creator>Mohammadi, A.H.S. ; Weihua Zhuang</creator><creatorcontrib>Mohammadi, A.H.S. ; Weihua Zhuang</creatorcontrib><description>We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all possible interleavers of length N, under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of variation of the bound increases with the signal-to-noise ratio and decreases with the interleaver length. Theoretical analysis for large interleaver lengths shows that the coefficient of variation asymptotically approaches a constant value. The results also demonstrate that the majority of the interleavers have performance bounds very close to the average value of the bound. This phenomenon is more palpable for larger interleaver lengths.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2002.1013147</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Asymptotic properties ; Codes ; Coefficient of variation ; Concatenated coding ; Convolutional codes ; Decoders ; Interleaved coding ; Maximum likelihood decoding ; Set theory ; Signal to noise ratio ; Simulation ; Turbo codes ; Unions ; Variance</subject><ispartof>IEEE transactions on information theory, 2002-07, Vol.48 (7), p.2078-2086</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2002</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c394t-f17958a1626bd86f752237dc85f3bc5dd97125ec2011e7a0991cf00e93421e3b3</citedby><cites>FETCH-LOGICAL-c394t-f17958a1626bd86f752237dc85f3bc5dd97125ec2011e7a0991cf00e93421e3b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1013147$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1013147$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mohammadi, A.H.S.</creatorcontrib><creatorcontrib>Weihua Zhuang</creatorcontrib><title>Variance of the turbo code performance bound over the interleavers</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all possible interleavers of length N, under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of variation of the bound increases with the signal-to-noise ratio and decreases with the interleaver length. Theoretical analysis for large interleaver lengths shows that the coefficient of variation asymptotically approaches a constant value. The results also demonstrate that the majority of the interleavers have performance bounds very close to the average value of the bound. This phenomenon is more palpable for larger interleaver lengths.</description><subject>Algorithms</subject><subject>Asymptotic properties</subject><subject>Codes</subject><subject>Coefficient of variation</subject><subject>Concatenated coding</subject><subject>Convolutional codes</subject><subject>Decoders</subject><subject>Interleaved coding</subject><subject>Maximum likelihood decoding</subject><subject>Set theory</subject><subject>Signal to noise ratio</subject><subject>Simulation</subject><subject>Turbo codes</subject><subject>Unions</subject><subject>Variance</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kL1PwzAQxS0EEqWwI7FEDIglxWfHcTxCxUelSiyF1Uqcs0iVxsVOkPjvcZsOiIHp9PR-73T3CLkEOgOg6m61WM0YpWwGFDhk8ohMQAiZqlxkx2RCKRSpyrLilJyFsI4yE8Am5OG99E3ZGUycTfoPTPrBVy4xrsZki946v9m7lRu6OnFf6PdU0_XoWyyjDufkxJZtwIvDnJK3p8fV_CVdvj4v5vfL1HCV9akFqURRQs7yqi5yKwVjXNamEJZXRtS1ksAEGkYBUJZUKTCWUlQ8Y4C84lNyM-7devc5YOj1pgkG27bs0A1Bs0LygnMawdt_QcglcFpwKSJ6_Qddu8F38Q0N8VopqFARoiNkvAvBo9Vb32xK_62B6l35Opavd-XrQ_kxcjVGGkT8hY_uDwAjfg0</recordid><startdate>20020701</startdate><enddate>20020701</enddate><creator>Mohammadi, A.H.S.</creator><creator>Weihua Zhuang</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20020701</creationdate><title>Variance of the turbo code performance bound over the interleavers</title><author>Mohammadi, A.H.S. ; Weihua Zhuang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c394t-f17958a1626bd86f752237dc85f3bc5dd97125ec2011e7a0991cf00e93421e3b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Algorithms</topic><topic>Asymptotic properties</topic><topic>Codes</topic><topic>Coefficient of variation</topic><topic>Concatenated coding</topic><topic>Convolutional codes</topic><topic>Decoders</topic><topic>Interleaved coding</topic><topic>Maximum likelihood decoding</topic><topic>Set theory</topic><topic>Signal to noise ratio</topic><topic>Simulation</topic><topic>Turbo codes</topic><topic>Unions</topic><topic>Variance</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mohammadi, A.H.S.</creatorcontrib><creatorcontrib>Weihua Zhuang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science 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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mohammadi, A.H.S.</au><au>Weihua Zhuang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Variance of the turbo code performance bound over the interleavers</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2002-07-01</date><risdate>2002</risdate><volume>48</volume><issue>7</issue><spage>2078</spage><epage>2086</epage><pages>2078-2086</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>We evaluate the variance of the union performance bound for a rate-1/3 turbo code over all possible interleavers of length N, under the assumption of a maximum-likelihood (ML) decoder. Theoretical and simulation results for turbo codes with two-memory component codes indicate that the coefficient of variation of the bound increases with the signal-to-noise ratio and decreases with the interleaver length. Theoretical analysis for large interleaver lengths shows that the coefficient of variation asymptotically approaches a constant value. The results also demonstrate that the majority of the interleavers have performance bounds very close to the average value of the bound. This phenomenon is more palpable for larger interleaver lengths.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2002.1013147</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2002-07, Vol.48 (7), p.2078-2086 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2002_1013147 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Asymptotic properties Codes Coefficient of variation Concatenated coding Convolutional codes Decoders Interleaved coding Maximum likelihood decoding Set theory Signal to noise ratio Simulation Turbo codes Unions Variance |
| title | Variance of the turbo code performance bound over the interleavers |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T18%3A05%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Variance%20of%20the%20turbo%20code%20performance%20bound%20over%20the%20interleavers&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Mohammadi,%20A.H.S.&rft.date=2002-07-01&rft.volume=48&rft.issue=7&rft.spage=2078&rft.epage=2086&rft.pages=2078-2086&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2002.1013147&rft_dat=%3Cproquest_RIE%3E1671308375%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195875059&rft_id=info:pmid/&rft_ieee_id=1013147&rfr_iscdi=true |