On quasi-cyclic interleavers for parallel turbo codes
In this correspondence, we present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e., growing as a logarithm of the interleaver size. These i...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2006-04, Vol.52 (4), p.1732-1739 |
|---|---|
| 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 | 1739 |
|---|---|
| container_issue | 4 |
| container_start_page | 1732 |
| container_title | IEEE transactions on information theory |
| container_volume | 52 |
| creator | Boutros, J.J. Zemor, G. |
| description | In this correspondence, we present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e., growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes. |
| doi_str_mv | 10.1109/TIT.2006.871061 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2006_871061</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1614100</ieee_id><sourcerecordid>1365155273</sourcerecordid><originalsourceid>FETCH-LOGICAL-c366t-35af41a391bc95c120f6c2e702d7d7bc15d66ab9bdea09d28bf12e52171abe8f3</originalsourceid><addsrcrecordid>eNp9kDtrwzAUhUVpoWnauUMXT6WLE109rbGEPgKBLOksZPkKXJQ4kexC_n1dXOjW6XDgO2f4CLkHugCgZrlb7xaMUrWoNFAFF2QGUurSKCkuyYxSqEojRHVNbnL-HKuQwGZEbg_FaXC5Lf3Zx9YX7aHHFNF9YcpF6FJxdMnFiLHoh1R3he8azLfkKriY8e435-Tj9WW3ei8327f16nlTeq5UX3LpggDHDdTeSA-MBuUZasoa3ejag2yUcrWpG3TUNKyqAzCUDDS4GqvA5-Rx-j2m7jRg7u2-zR5jdAfshmxZRRXnQo3g078gcCVHHUzzEV1OqE9dzgmDPaZ279LZArU_Ju1o0v6YtJPJcfEwLVpE_KMVCKCUfwPhPG6g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1365155273</pqid></control><display><type>article</type><title>On quasi-cyclic interleavers for parallel turbo codes</title><source>IEEE Electronic Library (IEL)</source><creator>Boutros, J.J. ; Zemor, G.</creator><creatorcontrib>Boutros, J.J. ; Zemor, G.</creatorcontrib><description>In this correspondence, we present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e., growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2006.871061</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>IEEE</publisher><subject>Asymptotic properties ; Blocking ; Circuits and systems ; Combinatorial mathematics ; Convolutional codes ; Decoding ; Error correction codes ; Error probability ; Errors ; Information theory ; Interleaved codes ; iterative decoding ; Logarithms ; minimum distance ; Optimization ; quasi-cyclic codes ; Turbo codes</subject><ispartof>IEEE transactions on information theory, 2006-04, Vol.52 (4), p.1732-1739</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c366t-35af41a391bc95c120f6c2e702d7d7bc15d66ab9bdea09d28bf12e52171abe8f3</citedby><cites>FETCH-LOGICAL-c366t-35af41a391bc95c120f6c2e702d7d7bc15d66ab9bdea09d28bf12e52171abe8f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1614100$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1614100$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Boutros, J.J.</creatorcontrib><creatorcontrib>Zemor, G.</creatorcontrib><title>On quasi-cyclic interleavers for parallel turbo codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this correspondence, we present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e., growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes.</description><subject>Asymptotic properties</subject><subject>Blocking</subject><subject>Circuits and systems</subject><subject>Combinatorial mathematics</subject><subject>Convolutional codes</subject><subject>Decoding</subject><subject>Error correction codes</subject><subject>Error probability</subject><subject>Errors</subject><subject>Information theory</subject><subject>Interleaved codes</subject><subject>iterative decoding</subject><subject>Logarithms</subject><subject>minimum distance</subject><subject>Optimization</subject><subject>quasi-cyclic codes</subject><subject>Turbo codes</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kDtrwzAUhUVpoWnauUMXT6WLE109rbGEPgKBLOksZPkKXJQ4kexC_n1dXOjW6XDgO2f4CLkHugCgZrlb7xaMUrWoNFAFF2QGUurSKCkuyYxSqEojRHVNbnL-HKuQwGZEbg_FaXC5Lf3Zx9YX7aHHFNF9YcpF6FJxdMnFiLHoh1R3he8azLfkKriY8e435-Tj9WW3ei8327f16nlTeq5UX3LpggDHDdTeSA-MBuUZasoa3ejag2yUcrWpG3TUNKyqAzCUDDS4GqvA5-Rx-j2m7jRg7u2-zR5jdAfshmxZRRXnQo3g078gcCVHHUzzEV1OqE9dzgmDPaZ279LZArU_Ju1o0v6YtJPJcfEwLVpE_KMVCKCUfwPhPG6g</recordid><startdate>200604</startdate><enddate>200604</enddate><creator>Boutros, J.J.</creator><creator>Zemor, G.</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200604</creationdate><title>On quasi-cyclic interleavers for parallel turbo codes</title><author>Boutros, J.J. ; Zemor, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c366t-35af41a391bc95c120f6c2e702d7d7bc15d66ab9bdea09d28bf12e52171abe8f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Asymptotic properties</topic><topic>Blocking</topic><topic>Circuits and systems</topic><topic>Combinatorial mathematics</topic><topic>Convolutional codes</topic><topic>Decoding</topic><topic>Error correction codes</topic><topic>Error probability</topic><topic>Errors</topic><topic>Information theory</topic><topic>Interleaved codes</topic><topic>iterative decoding</topic><topic>Logarithms</topic><topic>minimum distance</topic><topic>Optimization</topic><topic>quasi-cyclic codes</topic><topic>Turbo codes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Boutros, J.J.</creatorcontrib><creatorcontrib>Zemor, G.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><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>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering 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><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Boutros, J.J.</au><au>Zemor, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On quasi-cyclic interleavers for parallel turbo codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2006-04</date><risdate>2006</risdate><volume>52</volume><issue>4</issue><spage>1732</spage><epage>1739</epage><pages>1732-1739</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this correspondence, we present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e., growing as a logarithm of the interleaver size. These interleavers are also very practical in terms of memory requirements and their decoding error probabilities for small block lengths compare favorably with previous interleaving schemes.</abstract><pub>IEEE</pub><doi>10.1109/TIT.2006.871061</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2006-04, Vol.52 (4), p.1732-1739 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2006_871061 |
| source | IEEE Electronic Library (IEL) |
| subjects | Asymptotic properties Blocking Circuits and systems Combinatorial mathematics Convolutional codes Decoding Error correction codes Error probability Errors Information theory Interleaved codes iterative decoding Logarithms minimum distance Optimization quasi-cyclic codes Turbo codes |
| title | On quasi-cyclic interleavers for parallel turbo 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-01T09%3A38%3A05IST&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=On%20quasi-cyclic%20interleavers%20for%20parallel%20turbo%20codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Boutros,%20J.J.&rft.date=2006-04&rft.volume=52&rft.issue=4&rft.spage=1732&rft.epage=1739&rft.pages=1732-1739&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2006.871061&rft_dat=%3Cproquest_RIE%3E1365155273%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=1365155273&rft_id=info:pmid/&rft_ieee_id=1614100&rfr_iscdi=true |