Joint source-channel coding and guessing with application to sequential decoding
We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level w...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory Jg. 44; H. 5; S. 1756 - 1769 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
IEEE
01.09.1998
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev (1973) and Hellman (1975). Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding. |
|---|---|
| AbstractList | We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev (1973) and Hellman (1975). Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev (1973) and Hellman (1975). Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding. |
| Author | Merhav, N. Arikan, E. |
| Author_xml | – sequence: 1 givenname: E. surname: Arikan fullname: Arikan, E. organization: Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey – sequence: 2 givenname: N. surname: Merhav fullname: Merhav, N. |
| BookMark | eNptkM1LAzEQxYMo2FYPXj0FD4KHbZNN0myOUvykoAc9h5idtinbpG6yiP-9qVs8FC8zDPN7w5s3RMc-eEDogpIxpURNaDWWRAghj9CA5laoqeDHaEAIrQrFeXWKhjGu88gFLQfo9Tk4n3AMXWuhsCvjPTTYhtr5JTa-xssOYtwNXy6tsNluG2dNcsHjFHCEzw58cqbBNfSiM3SyME2E830foff7u7fZYzF_eXia3c4Ly5hKBZsaoWpha1MSQZhQykIpKml4taC5lh9SgJKCW0YFsZJISqcSBFEguQDORui6v7ttQzYRk964aKFpjIfQRV1WjPFKygxeHYDr_KzP3jRVQtGM0Azd9JBtQ4wtLPS2dRvTfmtK9C5YTSvdB5vZyQFrXfqNJLXGNf8qLnuFA4C_y_vlD9KHguw |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_3390_e21030298 crossref_primary_10_1109_TIT_2022_3194073 crossref_primary_10_1109_TIT_2023_3343676 crossref_primary_10_1109_TWC_2023_3238463 crossref_primary_10_3390_e20120896 crossref_primary_10_3390_e22060707 crossref_primary_10_3390_e24111695 crossref_primary_10_1109_18_782106 crossref_primary_10_3390_info12040159 crossref_primary_10_1109_TIT_2008_2011436 crossref_primary_10_1109_TIT_2021_3118878 crossref_primary_10_1109_TIT_2020_3033305 crossref_primary_10_1109_TIT_2018_2803162 crossref_primary_10_1109_TIT_2006_871608 crossref_primary_10_1109_TIT_2018_2856190 crossref_primary_10_1109_TIT_2022_3146463 |
| Cites_doi | 10.1109/TIT.1982.1056585 10.1147/rd.136.0675 10.1109/18.669158 10.1002/0471200611 10.1109/TIT.1963.1057827 10.1109/TIT.1973.1055006 10.1109/18.481781 10.1109/TIT.1975.1055470 10.1109/TIT.1968.1054129 10.1109/TIT.1979.1056085 10.1109/TIT.1965.1053730 10.1109/TIT.1967.1053977 10.1016/S0019-9958(67)90052-6 10.1109/TIT.1974.1055204 |
| ContentType | Journal Article |
| Copyright | Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 1998 |
| Copyright_xml | – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 1998 |
| DBID | RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/18.705557 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 1769 |
| ExternalDocumentID | 33570610 10_1109_18_705557 705557 |
| Genre | Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c339t-36a59d5cda20503599ce2587a48f17a42b75e9754c3150c7071167e509e745e43 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 30 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000075317000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Sun Sep 28 07:50:39 EDT 2025 Sun Nov 30 05:13:56 EST 2025 Sat Nov 29 02:54:45 EST 2025 Tue Nov 18 21:31:44 EST 2025 Tue Aug 26 21:00:16 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c339t-36a59d5cda20503599ce2587a48f17a42b75e9754c3150c7071167e509e745e43 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | https://repository.bilkent.edu.tr/bitstreams/828847b1-c889-40e1-8e69-b9a125734269/download |
| PQID | 195917731 |
| PQPubID | 36024 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1109_18_705557 proquest_journals_195917731 ieee_primary_705557 crossref_citationtrail_10_1109_18_705557 proquest_miscellaneous_28334877 |
| PublicationCentury | 1900 |
| PublicationDate | 1998-09-01 |
| PublicationDateYYYYMMDD | 1998-09-01 |
| PublicationDate_xml | – month: 09 year: 1998 text: 1998-09-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 1998 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 cover (ref3) 1991 ref15 ref14 gallager (ref9) 1968 ref11 ref10 wozencraft (ref18) 1961 ref2 ref1 ref17 csisza´r (ref5) 1981 zigangirov (ref19) 1966; 2 ref8 ref7 re´nyi (ref16) 1961; 1 ref4 ref6 |
| References_xml | – ident: ref4 doi: 10.1109/TIT.1982.1056585 – volume: 2 start-page: 13 year: 1966 ident: ref19 article-title: some sequential decoding procedures publication-title: Probl Pered Inform – ident: ref10 doi: 10.1147/rd.136.0675 – ident: ref2 doi: 10.1109/18.669158 – year: 1991 ident: ref3 publication-title: Elements of Information Theory doi: 10.1002/0471200611 – ident: ref6 doi: 10.1109/TIT.1963.1057827 – ident: ref14 doi: 10.1109/TIT.1973.1055006 – volume: 1 start-page: 547 year: 1961 ident: ref16 article-title: on measures of entropy and information publication-title: Proc 4th Berkeley Symp Math Statist Probability – ident: ref1 doi: 10.1109/18.481781 – year: 1981 ident: ref5 publication-title: Information Theory Coding Systems for Discrete Memoryless Systems – ident: ref12 doi: 10.1109/TIT.1975.1055470 – ident: ref7 doi: 10.1109/TIT.1968.1054129 – ident: ref11 doi: 10.1109/TIT.1979.1056085 – ident: ref8 doi: 10.1109/TIT.1965.1053730 – year: 1961 ident: ref18 publication-title: Sequential Decoding – ident: ref13 doi: 10.1109/TIT.1967.1053977 – ident: ref17 doi: 10.1016/S0019-9958(67)90052-6 – year: 1968 ident: ref9 publication-title: Information Theory and Reliable Transmission – ident: ref15 doi: 10.1109/TIT.1974.1055204 |
| SSID | ssj0014512 |
| Score | 1.7536095 |
| Snippet | We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1756 |
| SubjectTerms | Channel coding Codes Computational complexity Data transmission Decoding Distortion measurement H infinity control Information Information theory Laboratories Random variables Rate-distortion Source coding |
| Title | Joint source-channel coding and guessing with application to sequential decoding |
| URI | https://ieeexplore.ieee.org/document/705557 https://www.proquest.com/docview/195917731 https://www.proquest.com/docview/28334877 |
| Volume | 44 |
| WOSCitedRecordID | wos000075317000004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxQADhQKilIeFGFjS1rEdxyNCVIih6gBSt8hxLqhSlaA25ffjRxIVwcISOcnZss4---y7-w6h-zSKU6UFBDJlNGB0ogOV8tTM5diUI02lyl2yCTGbxYuFnNc42y4WBgCc8xmMbNHZ8rNSb-1V2dgiv3DRQR0hIh-q1RoMGCceGJwY-TVHjhpEiEzkmMQjX_HH1uNyqfxagN2uMu39qz_H6KhWHvGjH-0TtAdFH_WaxAy4ltM-OtxBGTxF89dyWVTYX9MHNtK3gBXWpd21sCoy_LG1vrDmxV7K4h2TNq5K7H2tzTqwwhn4Smfoffr89vQS1IkUAk2prAIaKS4zrjMVWvgXLqWGkMdCsTgn5hmmgoMUnGlq9EMtjNpBIgFGlwDBODB6jrpFWcAFwsBCkJSzMAfNslyoOJVZlppKRnWkIRmgh4bHia5Rxm2yi1XiThsTmZA48XwboLuW9NNDa_xF1Ld8bwmar8Nm3JJa5jaJhckhQlDTh9v2rxEWawFRBZTbTWJ0KWpOaOLyz1aH6MBHHFoPsivUrdZbuEb7-qtabtY3br59A6cz1EI |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZ4ScCBxwAB4xEhDly6LU2yNEeEmAaMiQNIu1Vp6iKkqUWs4_eTNN00xC5cqrR1osiJEye2PwNcJ90o0UZioBLOAs46JtCJSOxcjmy5a5jSWZVsQg6H0WikXmqc7SoWBhEr5zNsuWJly08LM3VXZW2H_CLkKqy7xFl1sNbcZMAF9dDg1EqwPXTUMEK0o9o0avmqvzafKpvKnyW42ld6u__q0R7s1OojufXjvQ8rmDdgd5aagdSS2oDtBZzBA3h5LD7ykviL-sDF-uY4JqZw-xbReUrep84b1r64a1myYNQmZUG8t7VdCcYkRV_pEN569693_aBOpRAYxlQZsK4WKhUm1aEDgBFKGQxFJDWPMmqfYSIFKim4YVZDNNIqHrQr0WoTKLlAzo5gLS9yPAaCPETFBA8zNDzNpI4SlaaJrWSVRxbSE7iZ8Tg2Nc64S3cxjqvzRkfFNIo9307gak766cE1lhE1HN_nBLOvzdm4xbXUTWIHlEOlZLYPl_O_VlycDUTnWEwnsdWmmD2jydOlrV7CZv_1eRAPHoZPTdjy8YfOn-wM1sqvKZ7DhvkuPyZfF9Xc-wHcE9eL |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Joint+source-channel+coding+and+guessing+with+application+to+sequential+decoding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Arikan%2C+E&rft.au=Merhav%2C+N&rft.date=1998-09-01&rft.issn=0018-9448&rft.volume=44&rft.issue=5&rft.spage=1756&rft.epage=1769&rft_id=info:doi/10.1109%2F18.705557&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |