Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels
This letter investigates Chase decoding of q-ary block codes over binary input additive white Gaussian noise channels. Performances of bitwise and symbol-wise test pattern generation are compared. A simple algorithm for evaluating symbol reliability is proposed. Simulation results for Reed-Solomon c...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2011-02, Vol.15 (2), p.229-231 |
|---|---|
| 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 | 231 |
|---|---|
| container_issue | 2 |
| container_start_page | 229 |
| container_title | IEEE communications letters |
| container_volume | 15 |
| creator | Cunha, Daniel C Portugheis, Jaime do Nascimento, Vagner V |
| description | This letter investigates Chase decoding of q-ary block codes over binary input additive white Gaussian noise channels. Performances of bitwise and symbol-wise test pattern generation are compared. A simple algorithm for evaluating symbol reliability is proposed. Simulation results for Reed-Solomon codes show that the proposed symbol-wise algorithm has a better performance than a bitwise approach with no increase in overall decoding complexity. |
| doi_str_mv | 10.1109/LCOMM.2011.122010.100864 |
| format | Article |
| fullrecord | <record><control><sourceid>pascalfrancis_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_23853309</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5673995</ieee_id><sourcerecordid>23853309</sourcerecordid><originalsourceid>FETCH-LOGICAL-c254t-cca37e20dd5165730e5bd008228cd4a1c94a420be8e80e3684f89f8ecc61101d3</originalsourceid><addsrcrecordid>eNo9kE1PwzAMhiMEEmPwC7jkwjEjH02bHLcCY9LGDoB2jLLEhULXjAYh7d-TUrSLbdnva9kPQpjRCWNU3y7L9Wo14ZSxCeMppTalKs9O0IhJqQhP4TTVVGlSFFqdo4sYP2jScMlG6P75sNuGhmzqCLh8tynegQu-bt9wqPAXsd0Bz5rgPnEZPEQcfqDDswWZbuZPvaFtoYmX6KyyTYSr_zxGrw_3L-UjWa7ni3K6JI7L7Js4Z0UBnHovWS4LQUFufX8JV85nljmd2YzTLShQFESuskrpSoFzefqVeTFGatjruhBjB5XZd_UunWgYNT0O84fD9DjMgMMMOJL1ZrDubXS2qTrbujoe_VwoKQTVSXc96GoAOI5lXgitpfgFP3hnUw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels</title><source>IEEE Electronic Library (IEL)</source><creator>Cunha, Daniel C ; Portugheis, Jaime ; do Nascimento, Vagner V</creator><creatorcontrib>Cunha, Daniel C ; Portugheis, Jaime ; do Nascimento, Vagner V</creatorcontrib><description>This letter investigates Chase decoding of q-ary block codes over binary input additive white Gaussian noise channels. Performances of bitwise and symbol-wise test pattern generation are compared. A simple algorithm for evaluating symbol reliability is proposed. Simulation results for Reed-Solomon codes show that the proposed symbol-wise algorithm has a better performance than a bitwise approach with no increase in overall decoding complexity.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2011.122010.100864</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Block codes ; Chase decoding ; Coding, codes ; Complexity theory ; Decoding ; Exact sciences and technology ; Information, signal and communications theory ; Reed-Solomon codes ; Reliability ; Signal and communications theory ; Signal to noise ratio ; soft-decision decoding ; Telecommunications and information theory ; test pattern generation ; Test pattern generators</subject><ispartof>IEEE communications letters, 2011-02, Vol.15 (2), p.229-231</ispartof><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c254t-cca37e20dd5165730e5bd008228cd4a1c94a420be8e80e3684f89f8ecc61101d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5673995$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5673995$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23853309$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Cunha, Daniel C</creatorcontrib><creatorcontrib>Portugheis, Jaime</creatorcontrib><creatorcontrib>do Nascimento, Vagner V</creatorcontrib><title>Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>This letter investigates Chase decoding of q-ary block codes over binary input additive white Gaussian noise channels. Performances of bitwise and symbol-wise test pattern generation are compared. A simple algorithm for evaluating symbol reliability is proposed. Simulation results for Reed-Solomon codes show that the proposed symbol-wise algorithm has a better performance than a bitwise approach with no increase in overall decoding complexity.</description><subject>Applied sciences</subject><subject>Block codes</subject><subject>Chase decoding</subject><subject>Coding, codes</subject><subject>Complexity theory</subject><subject>Decoding</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Reed-Solomon codes</subject><subject>Reliability</subject><subject>Signal and communications theory</subject><subject>Signal to noise ratio</subject><subject>soft-decision decoding</subject><subject>Telecommunications and information theory</subject><subject>test pattern generation</subject><subject>Test pattern generators</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1PwzAMhiMEEmPwC7jkwjEjH02bHLcCY9LGDoB2jLLEhULXjAYh7d-TUrSLbdnva9kPQpjRCWNU3y7L9Wo14ZSxCeMppTalKs9O0IhJqQhP4TTVVGlSFFqdo4sYP2jScMlG6P75sNuGhmzqCLh8tynegQu-bt9wqPAXsd0Bz5rgPnEZPEQcfqDDswWZbuZPvaFtoYmX6KyyTYSr_zxGrw_3L-UjWa7ni3K6JI7L7Js4Z0UBnHovWS4LQUFufX8JV85nljmd2YzTLShQFESuskrpSoFzefqVeTFGatjruhBjB5XZd_UunWgYNT0O84fD9DjMgMMMOJL1ZrDubXS2qTrbujoe_VwoKQTVSXc96GoAOI5lXgitpfgFP3hnUw</recordid><startdate>20110201</startdate><enddate>20110201</enddate><creator>Cunha, Daniel C</creator><creator>Portugheis, Jaime</creator><creator>do Nascimento, Vagner V</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20110201</creationdate><title>Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels</title><author>Cunha, Daniel C ; Portugheis, Jaime ; do Nascimento, Vagner V</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c254t-cca37e20dd5165730e5bd008228cd4a1c94a420be8e80e3684f89f8ecc61101d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Applied sciences</topic><topic>Block codes</topic><topic>Chase decoding</topic><topic>Coding, codes</topic><topic>Complexity theory</topic><topic>Decoding</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Reed-Solomon codes</topic><topic>Reliability</topic><topic>Signal and communications theory</topic><topic>Signal to noise ratio</topic><topic>soft-decision decoding</topic><topic>Telecommunications and information theory</topic><topic>test pattern generation</topic><topic>Test pattern generators</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cunha, Daniel C</creatorcontrib><creatorcontrib>Portugheis, Jaime</creatorcontrib><creatorcontrib>do Nascimento, Vagner V</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>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cunha, Daniel C</au><au>Portugheis, Jaime</au><au>do Nascimento, Vagner V</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2011-02-01</date><risdate>2011</risdate><volume>15</volume><issue>2</issue><spage>229</spage><epage>231</epage><pages>229-231</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>This letter investigates Chase decoding of q-ary block codes over binary input additive white Gaussian noise channels. Performances of bitwise and symbol-wise test pattern generation are compared. A simple algorithm for evaluating symbol reliability is proposed. Simulation results for Reed-Solomon codes show that the proposed symbol-wise algorithm has a better performance than a bitwise approach with no increase in overall decoding complexity.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2011.122010.100864</doi><tpages>3</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2011-02, Vol.15 (2), p.229-231 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_23853309 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Block codes Chase decoding Coding, codes Complexity theory Decoding Exact sciences and technology Information, signal and communications theory Reed-Solomon codes Reliability Signal and communications theory Signal to noise ratio soft-decision decoding Telecommunications and information theory test pattern generation Test pattern generators |
| title | Symbol-Wise Chase Decoding of q-ary Block Codes over BI-AWGN Channels |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T17%3A44%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Symbol-Wise%20Chase%20Decoding%20of%20q-ary%20Block%20Codes%20over%20BI-AWGN%20Channels&rft.jtitle=IEEE%20communications%20letters&rft.au=Cunha,%20Daniel%20C&rft.date=2011-02-01&rft.volume=15&rft.issue=2&rft.spage=229&rft.epage=231&rft.pages=229-231&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2011.122010.100864&rft_dat=%3Cpascalfrancis_RIE%3E23853309%3C/pascalfrancis_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5673995&rfr_iscdi=true |