Loading…
High-rate punctured convolutional codes for Viterbi and sequential decoding
An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M
Saved in:
| Published in: | IEEE transactions on communications 1989-11, Vol.37 (11), p.1113-1125 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites Items that cite this one |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | cdi_FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863 |
| container_end_page | 1125 |
| container_issue | 11 |
| container_start_page | 1113 |
| container_title | IEEE transactions on communications |
| container_volume | 37 |
| creator | Haccoun, D. Begin, G. |
| description | An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M |
| doi_str_mv | 10.1109/26.46505 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_25248825</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>46505</ieee_id><sourcerecordid>25248825</sourcerecordid><originalsourceid>FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863</originalsourceid><addsrcrecordid>eNqF0E1LAzEQBuAgCtYqePW2F8XL1nxsvo5S1IoFL8XrkmYnNbLN1iQr-O9d3aJHT8MwDy_Di9A5wTNCsL6hYlYJjvkBmhDOVYkVl4dogrHGpZBSHaOTlN4wxhVmbIKeFn7zWkaTodj1weY-QlPYLnx0bZ99F0w7bA2kwnWxePEZ4toXJjRFgvceQvYDaGAgPmxO0ZEzbYKz_Zyi1f3dar4ol88Pj_PbZWkZ47k0bi2dso2zdI2ZdoZSIkRVaUK1FqaSwCphqVWWUKvBCmYl5Zoz4FoowaboaozdxW74IeV665OFtjUBuj7VVDEmCFP_Q04rpSgf4PUIbexSiuDqXfRbEz9rguvvVmsq6p9WB3q5zzTJmtZFE6xPf15LKfWPuxidB4Df85jxBRAYfiw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25248825</pqid></control><display><type>article</type><title>High-rate punctured convolutional codes for Viterbi and sequential decoding</title><source>IEEE Xplore (Online service)</source><creator>Haccoun, D. ; Begin, G.</creator><creatorcontrib>Haccoun, D. ; Begin, G.</creatorcontrib><description><![CDATA[An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M<or=8 discovered by others are extended. Weight spectra and upper bounds on the bit error probability of the best known punctured codes having memory 2<or=M<or=8, and coding rates 2/3<or=R<or=7/8 are provided. Newly discovered rate-2/3 and -3/4 long-memory punctured convolutional codes with 9<or=M<or=23 are provided together with the leading terms of their weight spectra and their bit error performance bounds. Some results of simulation with sequential decoding are given.< >]]></description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/26.46505</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Artificial satellites ; Coding, codes ; Convolutional codes ; Data communication ; Decoding ; Error correction ; Error probability ; Exact sciences and technology ; Information, signal and communications theory ; Memoryless systems ; Reliability theory ; Signal and communications theory ; Telecommunications and information theory ; Upper bound ; Viterbi algorithm</subject><ispartof>IEEE transactions on communications, 1989-11, Vol.37 (11), p.1113-1125</ispartof><rights>1991 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863</citedby><cites>FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/46505$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19777905$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Haccoun, D.</creatorcontrib><creatorcontrib>Begin, G.</creatorcontrib><title>High-rate punctured convolutional codes for Viterbi and sequential decoding</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description><![CDATA[An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M<or=8 discovered by others are extended. Weight spectra and upper bounds on the bit error probability of the best known punctured codes having memory 2<or=M<or=8, and coding rates 2/3<or=R<or=7/8 are provided. Newly discovered rate-2/3 and -3/4 long-memory punctured convolutional codes with 9<or=M<or=23 are provided together with the leading terms of their weight spectra and their bit error performance bounds. Some results of simulation with sequential decoding are given.< >]]></description><subject>Applied sciences</subject><subject>Artificial satellites</subject><subject>Coding, codes</subject><subject>Convolutional codes</subject><subject>Data communication</subject><subject>Decoding</subject><subject>Error correction</subject><subject>Error probability</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Memoryless systems</subject><subject>Reliability theory</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Upper bound</subject><subject>Viterbi algorithm</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1989</creationdate><recordtype>article</recordtype><recordid>eNqF0E1LAzEQBuAgCtYqePW2F8XL1nxsvo5S1IoFL8XrkmYnNbLN1iQr-O9d3aJHT8MwDy_Di9A5wTNCsL6hYlYJjvkBmhDOVYkVl4dogrHGpZBSHaOTlN4wxhVmbIKeFn7zWkaTodj1weY-QlPYLnx0bZ99F0w7bA2kwnWxePEZ4toXJjRFgvceQvYDaGAgPmxO0ZEzbYKz_Zyi1f3dar4ol88Pj_PbZWkZ47k0bi2dso2zdI2ZdoZSIkRVaUK1FqaSwCphqVWWUKvBCmYl5Zoz4FoowaboaozdxW74IeV665OFtjUBuj7VVDEmCFP_Q04rpSgf4PUIbexSiuDqXfRbEz9rguvvVmsq6p9WB3q5zzTJmtZFE6xPf15LKfWPuxidB4Df85jxBRAYfiw</recordid><startdate>19891101</startdate><enddate>19891101</enddate><creator>Haccoun, D.</creator><creator>Begin, G.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</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></search><sort><creationdate>19891101</creationdate><title>High-rate punctured convolutional codes for Viterbi and sequential decoding</title><author>Haccoun, D. ; Begin, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Applied sciences</topic><topic>Artificial satellites</topic><topic>Coding, codes</topic><topic>Convolutional codes</topic><topic>Data communication</topic><topic>Decoding</topic><topic>Error correction</topic><topic>Error probability</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Memoryless systems</topic><topic>Reliability theory</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Upper bound</topic><topic>Viterbi algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Haccoun, D.</creatorcontrib><creatorcontrib>Begin, G.</creatorcontrib><collection>Pascal-Francis</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><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Haccoun, D.</au><au>Begin, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>High-rate punctured convolutional codes for Viterbi and sequential decoding</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>1989-11-01</date><risdate>1989</risdate><volume>37</volume><issue>11</issue><spage>1113</spage><epage>1125</epage><pages>1113-1125</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract><![CDATA[An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M<or=8 discovered by others are extended. Weight spectra and upper bounds on the bit error probability of the best known punctured codes having memory 2<or=M<or=8, and coding rates 2/3<or=R<or=7/8 are provided. Newly discovered rate-2/3 and -3/4 long-memory punctured convolutional codes with 9<or=M<or=23 are provided together with the leading terms of their weight spectra and their bit error performance bounds. Some results of simulation with sequential decoding are given.< >]]></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/26.46505</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 1989-11, Vol.37 (11), p.1113-1125 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_25248825 |
| source | IEEE Xplore (Online service) |
| subjects | Applied sciences Artificial satellites Coding, codes Convolutional codes Data communication Decoding Error correction Error probability Exact sciences and technology Information, signal and communications theory Memoryless systems Reliability theory Signal and communications theory Telecommunications and information theory Upper bound Viterbi algorithm |
| title | High-rate punctured convolutional codes for Viterbi and sequential decoding |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T19%3A06%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=High-rate%20punctured%20convolutional%20codes%20for%20Viterbi%20and%20sequential%20decoding&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Haccoun,%20D.&rft.date=1989-11-01&rft.volume=37&rft.issue=11&rft.spage=1113&rft.epage=1125&rft.pages=1113-1125&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/26.46505&rft_dat=%3Cproquest_pasca%3E25248825%3C/proquest_pasca%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c335t-afb7f8cdfc2b039fa2216644912996a47e346c2c8c12c9ec63c725953e596863%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=25248825&rft_id=info:pmid/&rft_ieee_id=46505&rfr_iscdi=true |