Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding
This paper studies the joint design of optimal convolutional codes (CCs) and CRC codes when serial list Viterbi algorithm (S-LVA) is employed in order to achieve the target frame error rate (FER). We first analyze the S-LVA performance with respect to SNR and list size, repsectively, and prove the c...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2018-11 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Yang, Hengjie Liang, Ethan Wesel, Richard D |
description | This paper studies the joint design of optimal convolutional codes (CCs) and CRC codes when serial list Viterbi algorithm (S-LVA) is employed in order to achieve the target frame error rate (FER). We first analyze the S-LVA performance with respect to SNR and list size, repsectively, and prove the convergence of the expected number of decoding attempts when SNR goes to the extreme. We then propose the coded channel capacity as the criterion to jointly design optimal CC-CRC pair and optimal list size and show that the optimal list size of S-LVA is always the cardinality of all possible CCs. With the maximum list size, we choose the design metric of optimal CC-CRC pair as the SNR gap to random coding union (RCU) bound and the optimal CC-CRC pair is the one that achieves a target SNR gap with the least complexity. Finally, we show that a weaker CC with a strong optimal CRC code could be as powerful as a strong CC with no CRC code. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2139812564</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2139812564</sourcerecordid><originalsourceid>FETCH-proquest_journals_21398125643</originalsourceid><addsrcrecordid>eNqNjMsKwjAURIMgKNp_uOC60CZtreuoiOhGxW2pJi23lFzNw-83Cz_A1TCcOTNhcy5EntYF5zOWODdkWcarNS9LMWfnI6HxsNUOewPUgSTzoTF4JNOOsSkNrVEgLxKCUdrCVVuM5ITOwx29tg-M-pMUmn7Jpl07Op38csFW-91NHtKXpXfQzjcDBRuPXcNzsalzXlaF-G_1Bf6gPLY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2139812564</pqid></control><display><type>article</type><title>Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding</title><source>Free E- Journals</source><creator>Yang, Hengjie ; Liang, Ethan ; Wesel, Richard D</creator><creatorcontrib>Yang, Hengjie ; Liang, Ethan ; Wesel, Richard D</creatorcontrib><description>This paper studies the joint design of optimal convolutional codes (CCs) and CRC codes when serial list Viterbi algorithm (S-LVA) is employed in order to achieve the target frame error rate (FER). We first analyze the S-LVA performance with respect to SNR and list size, repsectively, and prove the convergence of the expected number of decoding attempts when SNR goes to the extreme. We then propose the coded channel capacity as the criterion to jointly design optimal CC-CRC pair and optimal list size and show that the optimal list size of S-LVA is always the cardinality of all possible CCs. With the maximum list size, we choose the design metric of optimal CC-CRC pair as the SNR gap to random coding union (RCU) bound and the optimal CC-CRC pair is the one that achieves a target SNR gap with the least complexity. Finally, we show that a weaker CC with a strong optimal CRC code could be as powerful as a strong CC with no CRC code.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Channel capacity ; Codes ; Error analysis ; Viterbi algorithm detectors ; Viterbi decoding</subject><ispartof>arXiv.org, 2018-11</ispartof><rights>2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Yang, Hengjie</creatorcontrib><creatorcontrib>Liang, Ethan</creatorcontrib><creatorcontrib>Wesel, Richard D</creatorcontrib><title>Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding</title><title>arXiv.org</title><description>This paper studies the joint design of optimal convolutional codes (CCs) and CRC codes when serial list Viterbi algorithm (S-LVA) is employed in order to achieve the target frame error rate (FER). We first analyze the S-LVA performance with respect to SNR and list size, repsectively, and prove the convergence of the expected number of decoding attempts when SNR goes to the extreme. We then propose the coded channel capacity as the criterion to jointly design optimal CC-CRC pair and optimal list size and show that the optimal list size of S-LVA is always the cardinality of all possible CCs. With the maximum list size, we choose the design metric of optimal CC-CRC pair as the SNR gap to random coding union (RCU) bound and the optimal CC-CRC pair is the one that achieves a target SNR gap with the least complexity. Finally, we show that a weaker CC with a strong optimal CRC code could be as powerful as a strong CC with no CRC code.</description><subject>Channel capacity</subject><subject>Codes</subject><subject>Error analysis</subject><subject>Viterbi algorithm detectors</subject><subject>Viterbi decoding</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNjMsKwjAURIMgKNp_uOC60CZtreuoiOhGxW2pJi23lFzNw-83Cz_A1TCcOTNhcy5EntYF5zOWODdkWcarNS9LMWfnI6HxsNUOewPUgSTzoTF4JNOOsSkNrVEgLxKCUdrCVVuM5ITOwx29tg-M-pMUmn7Jpl07Op38csFW-91NHtKXpXfQzjcDBRuPXcNzsalzXlaF-G_1Bf6gPLY</recordid><startdate>20181129</startdate><enddate>20181129</enddate><creator>Yang, Hengjie</creator><creator>Liang, Ethan</creator><creator>Wesel, Richard D</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20181129</creationdate><title>Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding</title><author>Yang, Hengjie ; Liang, Ethan ; Wesel, Richard D</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_21398125643</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Channel capacity</topic><topic>Codes</topic><topic>Error analysis</topic><topic>Viterbi algorithm detectors</topic><topic>Viterbi decoding</topic><toplevel>online_resources</toplevel><creatorcontrib>Yang, Hengjie</creatorcontrib><creatorcontrib>Liang, Ethan</creatorcontrib><creatorcontrib>Wesel, Richard D</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Hengjie</au><au>Liang, Ethan</au><au>Wesel, Richard D</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding</atitle><jtitle>arXiv.org</jtitle><date>2018-11-29</date><risdate>2018</risdate><eissn>2331-8422</eissn><abstract>This paper studies the joint design of optimal convolutional codes (CCs) and CRC codes when serial list Viterbi algorithm (S-LVA) is employed in order to achieve the target frame error rate (FER). We first analyze the S-LVA performance with respect to SNR and list size, repsectively, and prove the convergence of the expected number of decoding attempts when SNR goes to the extreme. We then propose the coded channel capacity as the criterion to jointly design optimal CC-CRC pair and optimal list size and show that the optimal list size of S-LVA is always the cardinality of all possible CCs. With the maximum list size, we choose the design metric of optimal CC-CRC pair as the SNR gap to random coding union (RCU) bound and the optimal CC-CRC pair is the one that achieves a target SNR gap with the least complexity. Finally, we show that a weaker CC with a strong optimal CRC code could be as powerful as a strong CC with no CRC code.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2018-11 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2139812564 |
source | Free E- Journals |
subjects | Channel capacity Codes Error analysis Viterbi algorithm detectors Viterbi decoding |
title | Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T06%3A34%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Joint%20Design%20of%20Convolutional%20Code%20and%20CRC%20under%20Serial%20List%20Viterbi%20Decoding&rft.jtitle=arXiv.org&rft.au=Yang,%20Hengjie&rft.date=2018-11-29&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2139812564%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2139812564&rft_id=info:pmid/&rfr_iscdi=true |