Two-way successively refined joint source-channel coding
Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory Jg. 52; H. 4; S. 1483 - 1494 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.04.2006
Institute of Electrical and Electronics Engineers 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 | Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y/sub i/} part of the process is observed. Similarly, {Y/sub i/} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source. |
|---|---|
| AbstractList | Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y/sub i/} part of the process is observed. Similarly, {Y/sub i/} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source. Consider a source, {X sub(i),Y sub(i)} sub(i=1 ) super( infinity ), producing independent copies of a pair of jointly distributed random variables (RVs). The {X sub(i)} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y sub(i)} part of the process is observed. Similarly, {Y sub(i)} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source. Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The {X/sub i/} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Y/sub i/} part of the process is observed. Similarly, {Y/sub i/} should be reproduced at location A. The communication between the two locations is carried out across two memoryless channels in K iterative bi-directional rounds. In each round, the source components are reconstructed at the other locations based on the information exchanged in all previous rounds and the source component known at that location, and it is desired to find the amount of information that should be exchanged between the two locations in each round, so that the distortions incurred (in each round) will not exceed given thresholds. Our setting extends the results of Steinberg and Merhav as well as Kaspi, combining the notion of successive refinement with this of two-way interactive communication. We first derive a single-letter characterization of achievable rates for a pure source-coding problem with successive refinement. Then, for a joint source-channel coding setting, we prove a separation theorem, asserting that in the limit of long blocks, no optimality is lost by first applying lossy (two-way) successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source. [PUBLICATION ABSTRACT] |
| Author | Merhav, N. Maor, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Maor fullname: Maor, A. organization: Dept. of Electr. Eng., Technion Israel Inst. of Technol., Haifa, Israel – sequence: 2 givenname: N. surname: Merhav fullname: Merhav, N. organization: Dept. of Electr. Eng., Technion Israel Inst. of Technol., Haifa, Israel |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17683681$$DView record in Pascal Francis |
| BookMark | eNp9kc1LAzEQxYMoWD_OHrwsguJlaybfe5TiFwhe6jlk01lNWRPdbJX-96ZUEDx4GgZ-7w3z3gHZjSkiISdApwC0uZo_zKeMUjU1GqjQO2QCUuq6UVLskgmlYOpGCLNPDnJellVIYBNi5l-p_nLrKq-8x5zDJ_brasAuRFxUyxTiWOW0GjzW_tXFiH3l0yLElyOy17k-4_HPPCTPtzfz2X39-HT3MLt-rD03bKydMbJlihsvpROOt4IqD53XLXdSa956NL5paUuh4wzbhWsb3bluIYRkmiE_JBdb3_chfawwj_YtZI997yKmVbbMAANlaAEv_wWBK1kSYRQKevYHXZYXY3nDQiMbYI3hBTr_gVz2ru8GF33I9n0Ib25YW9DKcGU2Zldbzg8p55LcL0LtphlbmrGbZuy2maKQfxQ-jG4MKY6DC_0_utOtLiDi7xUFgmrDvwE1J5tU |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_TIT_2013_2291787 crossref_primary_10_1109_TIT_2010_2046238 crossref_primary_10_1109_TIT_2021_3100781 |
| Cites_doi | 10.1109/tit.2004.831781 10.1002/047174882x 10.1109/18.272493 10.1109/TIT.2005.864423 10.1002/0471219282.eot142 10.1109/TIT.1985.1057118 10.1109/TIT.1976.1055508 |
| ContentType | Journal Article |
| Copyright | 2006 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2006 |
| Copyright_xml | – notice: 2006 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2006 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2006.871047 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| 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 Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database 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 Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 1494 |
| ExternalDocumentID | 1033214971 17683681 10_1109_TIT_2006_871047 1614078 |
| Genre | orig-research 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 IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c382t-a885b2638c55a4a3b406c1fc7b3a5773bce8c9b0b01f32ebdab97fafd445272e3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000236714000013&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 Nov 09 12:59:46 EST 2025 Sun Sep 28 12:07:16 EDT 2025 Sun Nov 30 03:41:32 EST 2025 Mon Jul 21 09:16:17 EDT 2025 Sat Nov 29 08:05:15 EST 2025 Tue Nov 18 22:11:36 EST 2025 Tue Aug 26 16:40:37 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | joint source-channel coding Bidirectional link Channel capacity Source coding successive refinement Refinement method Two channel system two-way communication Lossy medium Iterative method Joint source channel coding Interactive system Memoryless channel Localization Random variable |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c382t-a885b2638c55a4a3b406c1fc7b3a5773bce8c9b0b01f32ebdab97fafd445272e3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 195912983 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | pascalfrancis_primary_17683681 crossref_citationtrail_10_1109_TIT_2006_871047 proquest_journals_195912983 proquest_miscellaneous_1365155201 proquest_miscellaneous_28121680 crossref_primary_10_1109_TIT_2006_871047 ieee_primary_1614078 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-04-01 |
| PublicationDateYYYYMMDD | 2006-04-01 |
| PublicationDate_xml | – month: 04 year: 2006 text: 2006-04-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2006 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref7 ref9 ref4 ref3 ref5 ref2 ref1 Csiszár (ref6) 1981 Koshelev (ref8) 1994; 30 |
| References_xml | – ident: ref1 doi: 10.1109/tit.2004.831781 – ident: ref4 doi: 10.1002/047174882x – volume: 30 start-page: 31 issue: 1 year: 1994 ident: ref8 article-title: On the divisibility of discrete sources with an additive single-letter distortion measure publication-title: Probl. Pered. Inform. – volume-title: Information Theory: Coding Theorems for Discrete Memoryless Systems year: 1981 ident: ref6 – ident: ref9 doi: 10.1109/18.272493 – ident: ref2 doi: 10.1109/TIT.2005.864423 – ident: ref7 doi: 10.1002/0471219282.eot142 – ident: ref3 doi: 10.1109/TIT.1985.1057118 – ident: ref5 doi: 10.1109/TIT.1976.1055508 |
| SSID | ssj0014512 |
| Score | 1.8890558 |
| Snippet | Consider a source, {X/sub i/,Y/sub i/}/sub i=1//sup /spl infin//, producing independent copies of a pair of jointly distributed random variables (RVs). The... Consider a source, {X sub(i),Y sub(i)} sub(i=1 ) super( infinity ), producing independent copies of a pair of jointly distributed random variables (RVs). The... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1483 |
| SubjectTerms | Applied sciences Bidirectional control Channel capacity Channels Codecs Coding Coding, codes Computer networks Decoding Distortion Exact sciences and technology Exchanging Information, signal and communications theory Interactive joint source-channel coding Memoryless systems Optimization Performance analysis Position (location) Random variables Reproduction Signal and communications theory Source coding successive refinement Telecommunications and information theory Theorems TV broadcasting two-way communication Wireless networks |
| Title | Two-way successively refined joint source-channel coding |
| URI | https://ieeexplore.ieee.org/document/1614078 https://www.proquest.com/docview/195912983 https://www.proquest.com/docview/1365155201 https://www.proquest.com/docview/28121680 |
| Volume | 52 |
| WOSCitedRecordID | wos000236714000013&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/eLvHCXMwlV1LS8QwEB508aAH32JdHxU8eLDaNk2aHkUUvYiHFbyVJE1AWVpxdxX_vTNNd1XUg5dS6BTCTCbzzHwAR0xqGgPHI-GMiNBei6hQKT6s0xW1YcTKtGAT-e2tfHgo7ubgZHYXxlrbNp_ZU3pta_lVYyaUKjtD74TKTvMwn-fC39WaVQwynvjJ4AkqMMYc3RifJC7OBjcDX3XA4CAmHJUvFqiFVKGGSDVCnjgPZvHjXG6NzdXK_5a5CsudUxme-12wBnO2XoeVKWBD2OnvOix9mT64AXLw1kRv6j0cTVrURDz3hu8hrhdJqvCpeazHoc_tR3Q9uLbD0DRk6jbh_upycHEddUAKkWEyHUdKSq5T1DTDucoU02jFTeJMrpniec60sdIUmnKijqVWV0oXuVOuyjKe5qllW9Crm9puQ2gy60yVGBpFlknydqh0yYTgiZOZLQI4nTK3NN2UcQK7GJZttBEXJUqDsC9F6aURwPHsh2c_YONv0g1i9ieZ53MA-9-k9_kdQykmZBJAfyrOstPQUUlDddDXkSyAw9lXVC2ql6jaNhMkYYQTz9FFCuDgD5oUHaREyHjn97X1YdHnbKjVZxd645eJ3YMF8zp-HL3stzv4AwLB7W8 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS9xAEB_UCtqH2vpBU62m4IMPRpPsbrJ5LFJRao8-RPAt7G52QTkS8e487r_vTDZ3KupDX0IgE1hmdnY-d34Ah0xqGgMnosyZLEJ7nUWFSvFhna6pDSNWpgObyAcDeXNT_F2C48VdGGtt13xmT-i1q-XXrZlQquwUvRMqOy3DB8F5GvvbWouaAReJnw2eoApj1NEP8kni4rS8LH3dAcODmJBUntmgDlSFWiLVCLniPJzFq5O5MzfnG_-30M_wqXcrw59-H3yBJdtswsYcsiHsNXgTPj6bP7gFspy20VTNwtGkw03Ek284C3G9SFKHd-1tMw59dj-iC8KNHYamJWO3Ddfnv8qzi6iHUogMk-k4UlIKnaKuGSEUV0yjHTeJM7lmSuQ508ZKU2jKijqWWl0rXeROuZpzkeapZTuw0rSN_Qqh4daZOjE0jIxL8neoeMmyTCROclsEcDJnbmX6OeMEdzGsungjLiqUBqFfZpWXRgBHix_u_YiN90m3iNlPZJ7PAey_kN7TdwymWCaTAHbn4qx6HR1VNFYHvR3JAvix-IrKRRUT1dh2giSMkOIFOkkBHLxDk6KLlGQy_vb22g5g7aL8c1VdXQ5-78K6z-BQ488erIwfJvY7rJrH8e3oYb_bzf8Afpvwtg |
| 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=Two-Way+Successively+Refined+Joint+Source-Channel+Coding&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Maor%2C+A&rft.au=Merhav%2C+N&rft.date=2006-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=52&rft.issue=4&rft.spage=1483&rft_id=info:doi/10.1109%2FTIT.2006.871047&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=1033214971 |
| 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 |