On the joint source-channel decoding of variable-length encoded sources: the BSC case

This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2001-12, Vol.49 (12), p.2052-2055
Main Authors: Subbalakshmi, K.P., Vaisey, J.
Format: Article
Language:English
Subjects:
Bit rate
Channel coding
Channels
Code standards
Compression algorithms
Computer aided software engineering
Decoders
Decoding
Entropy
Error correcting codes
Error correction codes
Optimization
Robustness
Source code
Statistics
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-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23
cites cdi_FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23
container_end_page 2055
container_issue 12
container_start_page 2052
container_title IEEE transactions on communications
container_volume 49
creator Subbalakshmi, K.P.
Vaisey, J.
description This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel decoder delivers substantial improvements over the conventional decoder and also over a system that uses a standard forward error correcting code operating at the same over all bit rates. This decoder is also robust to inaccuracies in the estimation of channel statistics.
doi_str_mv 10.1109/26.974247
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_miscellaneous_914663897</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>974247</ieee_id><sourcerecordid>914663897</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23</originalsourceid><addsrcrecordid>eNp90T1PwzAQBmALgUQpDKxMFgOIIeUcO7HNBhVfUqUO0DlynEubKnVKnCDx73FJxcCAFw_33Cu9OkLOGUwYA30bpxMtRSzkARmxJFERqEQekhGAhiiVUh2TE-_XACCA8xFZzB3tVkjXTeU66pu-tRjZlXEOa1qgbYrKLWlT0k_TViavMarRLbsVRRdmWOxX_N1PysPblFrj8ZQclab2eLb_x2Tx9Pg-fYlm8-fX6f0sspynXWRyLjiGJ5DbEjgrykSCtmi0sLkGkVhtU5Qij2MsNBOco-LArNAyEWXMx-R6yN22zUePvss2lbdY18Zh0_ssrKQpV1oGefWvjFPFlYQkwMs_cB0autAiU0ooiIXaoZsB2bbxvsUy27bVxrRfGYNsd4eQlw13CPZisFUo-uv2w2-g04Em</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884802485</pqid></control><display><type>article</type><title>On the joint source-channel decoding of variable-length encoded sources: the BSC case</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Subbalakshmi, K.P. ; Vaisey, J.</creator><creatorcontrib>Subbalakshmi, K.P. ; Vaisey, J.</creatorcontrib><description>This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel decoder delivers substantial improvements over the conventional decoder and also over a system that uses a standard forward error correcting code operating at the same over all bit rates. This decoder is also robust to inaccuracies in the estimation of channel statistics.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/26.974247</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Bit rate ; Channel coding ; Channels ; Code standards ; Compression algorithms ; Computer aided software engineering ; Decoders ; Decoding ; Entropy ; Error correcting codes ; Error correction codes ; Optimization ; Robustness ; Source code ; Statistics</subject><ispartof>IEEE transactions on communications, 2001-12, Vol.49 (12), p.2052-2055</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23</citedby><cites>FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/974247$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids></links><search><creatorcontrib>Subbalakshmi, K.P.</creatorcontrib><creatorcontrib>Vaisey, J.</creatorcontrib><title>On the joint source-channel decoding of variable-length encoded sources: the BSC case</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel decoder delivers substantial improvements over the conventional decoder and also over a system that uses a standard forward error correcting code operating at the same over all bit rates. This decoder is also robust to inaccuracies in the estimation of channel statistics.</description><subject>Bit rate</subject><subject>Channel coding</subject><subject>Channels</subject><subject>Code standards</subject><subject>Compression algorithms</subject><subject>Computer aided software engineering</subject><subject>Decoders</subject><subject>Decoding</subject><subject>Entropy</subject><subject>Error correcting codes</subject><subject>Error correction codes</subject><subject>Optimization</subject><subject>Robustness</subject><subject>Source code</subject><subject>Statistics</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNp90T1PwzAQBmALgUQpDKxMFgOIIeUcO7HNBhVfUqUO0DlynEubKnVKnCDx73FJxcCAFw_33Cu9OkLOGUwYA30bpxMtRSzkARmxJFERqEQekhGAhiiVUh2TE-_XACCA8xFZzB3tVkjXTeU66pu-tRjZlXEOa1qgbYrKLWlT0k_TViavMarRLbsVRRdmWOxX_N1PysPblFrj8ZQclab2eLb_x2Tx9Pg-fYlm8-fX6f0sspynXWRyLjiGJ5DbEjgrykSCtmi0sLkGkVhtU5Qij2MsNBOco-LArNAyEWXMx-R6yN22zUePvss2lbdY18Zh0_ssrKQpV1oGefWvjFPFlYQkwMs_cB0autAiU0ooiIXaoZsB2bbxvsUy27bVxrRfGYNsd4eQlw13CPZisFUo-uv2w2-g04Em</recordid><startdate>20011201</startdate><enddate>20011201</enddate><creator>Subbalakshmi, K.P.</creator><creator>Vaisey, J.</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>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20011201</creationdate><title>On the joint source-channel decoding of variable-length encoded sources: the BSC case</title><author>Subbalakshmi, K.P. ; Vaisey, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Bit rate</topic><topic>Channel coding</topic><topic>Channels</topic><topic>Code standards</topic><topic>Compression algorithms</topic><topic>Computer aided software engineering</topic><topic>Decoders</topic><topic>Decoding</topic><topic>Entropy</topic><topic>Error correcting codes</topic><topic>Error correction codes</topic><topic>Optimization</topic><topic>Robustness</topic><topic>Source code</topic><topic>Statistics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Subbalakshmi, K.P.</creatorcontrib><creatorcontrib>Vaisey, J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Subbalakshmi, K.P.</au><au>Vaisey, J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the joint source-channel decoding of variable-length encoded sources: the BSC case</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2001-12-01</date><risdate>2001</risdate><volume>49</volume><issue>12</issue><spage>2052</spage><epage>2055</epage><pages>2052-2055</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>This paper proposes an optimal maximum a posteriori probability decoder for variable-length encoded sources over binary symmetric channels (BSC) that uses a novel state-space to deal with the problem of variable-length source codes in the decoder. This sequential, finite-delay, joint source-channel decoder delivers substantial improvements over the conventional decoder and also over a system that uses a standard forward error correcting code operating at the same over all bit rates. This decoder is also robust to inaccuracies in the estimation of channel statistics.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/26.974247</doi><tpages>4</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0090-6778
ispartof IEEE transactions on communications, 2001-12, Vol.49 (12), p.2052-2055
issn 0090-6778
1558-0857
language eng
recordid cdi_proquest_miscellaneous_914663897
source IEEE Electronic Library (IEL) Journals
subjects Bit rate
Channel coding
Channels
Code standards
Compression algorithms
Computer aided software engineering
Decoders
Decoding
Entropy
Error correcting codes
Error correction codes
Optimization
Robustness
Source code
Statistics
title On the joint source-channel decoding of variable-length encoded sources: the BSC case
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T14%3A56%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20joint%20source-channel%20decoding%20of%20variable-length%20encoded%20sources:%20the%20BSC%20case&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Subbalakshmi,%20K.P.&rft.date=2001-12-01&rft.volume=49&rft.issue=12&rft.spage=2052&rft.epage=2055&rft.pages=2052-2055&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/26.974247&rft_dat=%3Cproquest_ieee_%3E914663897%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c336t-ab343eeee4e3cf031df5709cea94cb9045c9c6e74b22ed91433e8301c49754f23%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=884802485&rft_id=info:pmid/&rft_ieee_id=974247&rfr_iscdi=true