On the role of mismatch in rate distortion theory
Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d/sub 0/(x,x/spl circ//sub 0/). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d/sub 1/(x,x/spl circ/...
        Saved in:
      
    
          | Published in | IEEE transactions on information theory Vol. 43; no. 1; pp. 38 - 47 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | English | 
| Published | 
        New York
          IEEE
    
        01.01.1997
     The Institute of Electrical and Electronics Engineers, Inc. (IEEE)  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0018-9448 1557-9654  | 
| DOI | 10.1109/18.567644 | 
Cover
| Abstract | Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d/sub 0/(x,x/spl circ//sub 0/). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d/sub 1/(x,x/spl circ//sub 1/), where, in general, d/sub 1/(x,x/spl circ//sub 1/)/spl ne/d/sub 0/(x,x/spl circ//sub 0/). We study the minimum resulting d/sub 1/(x,x/spl circ//sub 1/)-distortion between the reconstructed sequence and the source sequence as we optimize over the codebook subject to a rate constraint. Using a random coding argument we derive an upper bound on the resulting distortion. Applying this bound to blocks of source symbols we construct a sequence of bounds which are shown to converge to the least distortion achievable in this setup. This solves the rate distortion dual of an open problem related to the capacity of channels with a given decoding rule-the mismatch capacity. Addressing a different kind of mismatch, we also study the mean-squared error description of non-Gaussian sources with random Gaussian codebooks. It is shown that the use of a Gaussian codebook to compress any ergodic source results in an average distortion which depends on the source via its second moment only. The source with a given second moment that is most difficult to describe is the memoryless zero-mean Gaussian source, and it is best described using a Gaussian codebook. Once a Gaussian codebook is used, we show that all sources of a given second moment become equally hard to describe. | 
    
|---|---|
| AbstractList | Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d(0)(x,xˆ(0)). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d(1)(x,xˆ(1)), where, in general, d(1)(x,xˆ(1))(not equal to)d(0)(x,xˆ(0 )). We study the minimum resulting d(1)(x,xˆ(1 ))-distortion between the reconstructed sequence and the source sequence as we optimize over the codebook subject to a rate constraint. Using a random coding argument we derive an upper bound on the resulting distortion. Applying this bound to blocks of source symbols we construct a sequence of bounds which are shown to converge to the least distortion achievable in this setup. This solves the rate distortion dual of an open problem related to the capacity of channels with a given decoding rule-the mismatch capacity. Addressing a different kind of mismatch, we also study the mean-squared error description of non-Gaussian sources with random Gaussian codebooks. It is shown that the use of a Gaussian codebook to compress any ergodic source results in an average distortion which depends on the source via its second moment only. The source with a given second moment that is most difficult to describe is the memoryless zero-mean Gaussian source, and it is best described using a Gaussian codebook. Once a Gaussian codebook is used, we show that all sources of a given second moment become equally hard to describe Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d/sub 0/(x,x/spl circ//sub 0/). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d/sub 1/(x,x/spl circ//sub 1/), where, in general, d/sub 1/(x,x/spl circ//sub 1/)/spl ne/d/sub 0/(x,x/spl circ//sub 0/). We study the minimum resulting d/sub 1/(x,x/spl circ//sub 1/)-distortion between the reconstructed sequence and the source sequence as we optimize over the codebook subject to a rate constraint. Using a random coding argument we derive an upper bound on the resulting distortion. Applying this bound to blocks of source symbols we construct a sequence of bounds which are shown to converge to the least distortion achievable in this setup. This solves the rate distortion dual of an open problem related to the capacity of channels with a given decoding rule-the mismatch capacity. Addressing a different kind of mismatch, we also study the mean-squared error description of non-Gaussian sources with random Gaussian codebooks. It is shown that the use of a Gaussian codebook to compress any ergodic source results in an average distortion which depends on the source via its second moment only. The source with a given second moment that is most difficult to describe is the memoryless zero-mean Gaussian source, and it is best described using a Gaussian codebook. Once a Gaussian codebook is used, we show that all sources of a given second moment become equally hard to describe. A source sequence is described by the codeword that is closest to it according to the distortion measure d0(x,x0) using a codebook C.  | 
    
| Author | Lapidoth, A. | 
    
| Author_xml | – sequence: 1 givenname: A. surname: Lapidoth fullname: Lapidoth, A. organization: AT&T Bell Labs., Murray Hill, NJ, USA  | 
    
| BookMark | eNpt0DtrwzAQAGBRUmiSdujayXQodHCi0yvyWEJfEMjSzkKWJaLgWKmkDPn3derQoXQ6jvvuuLsJGnWhswjdAp4B4GoOcsbFQjB2gcbA-aKsBGcjNMYYZFkxJq_QJKVtnzIOZIxg3RV5Y4sYWlsEV-x82ulsNoXviqizLRqfcojZhx8X4vEaXTrdJntzjlP0-fL8sXwrV-vX9-XTqjQUs1wSbI0kWmjhqJVUgNEMalZR4lhDNdML5yiuF642tGkcpVBzTDQWvK4rYRo6RQ_D3H0MXwebsup3M7ZtdWfDISkimcSEQQ_v_8BtOMSu301BxSvMCRE9mg_IxJBStE4Zn_XprBy1bxVgdfqfAqmG__Udj3869tHvdDz-a-8G6621v-5c_AZgbXh6 | 
    
| CODEN | IETTAW | 
    
| CitedBy_id | crossref_primary_10_1109_TIT_2018_2875765 crossref_primary_10_3390_e23030347 crossref_primary_10_1186_1471_2105_14_187 crossref_primary_10_1109_TIT_2024_3356477 crossref_primary_10_1016_j_cviu_2003_10_015 crossref_primary_10_1109_18_720535 crossref_primary_10_1109_18_979328 crossref_primary_10_1109_TCOMM_2018_2834349 crossref_primary_10_1109_TIT_2014_2313085 crossref_primary_10_1093_bioinformatics_btu183 crossref_primary_10_1016_j_mathsocsci_2024_07_002 crossref_primary_10_1109_TCOMM_2009_04_070165 crossref_primary_10_2139_ssrn_3219784 crossref_primary_10_1109_TIT_2010_2090225 crossref_primary_10_1109_TIT_2014_2314676 crossref_primary_10_1109_TWC_2019_2923399 crossref_primary_10_1109_TIT_2021_3083271 crossref_primary_10_1109_JPROC_2016_2575858 crossref_primary_10_1109_TIT_2005_855578 crossref_primary_10_1109_18_796418 crossref_primary_10_1109_TIT_2021_3068981 crossref_primary_10_1109_18_720541 crossref_primary_10_1109_TIT_2003_819336 crossref_primary_10_1142_S0219720020500316 crossref_primary_10_1109_TIT_2006_876237 crossref_primary_10_1109_TIT_2002_1003841 crossref_primary_10_1109_TIT_2016_2620161 crossref_primary_10_1109_TIT_2006_872845 crossref_primary_10_1109_TIT_2008_920343 crossref_primary_10_1109_TIT_2021_3058663 crossref_primary_10_1109_TIT_2018_2886959 crossref_primary_10_1109_TIT_2023_3244232 crossref_primary_10_1109_TIT_2003_810637 crossref_primary_10_1109_18_904515 crossref_primary_10_1109_TIP_2007_899612  | 
    
| Cites_doi | 10.1109/TIT.1985.1057034 10.1109/TIT.1983.1056758 10.1109/18.53740 10.1109/18.119699 10.1002/j.1538-7305.1967.tb04246.x 10.1109/18.370121 10.1109/18.340469 10.1109/TIT.1982.1056588 10.1109/18.9781 10.1109/18.532892 10.1109/ISIT.1994.394637 10.1109/18.532884 10.1109/26.380049 10.1109/TIT.1970.1054469 10.1109/TIT.1970.1054394 10.1109/18.532876 10.1109/18.476314 10.1016/S0019-9958(69)90403-3 10.1002/0471200611  | 
    
| ContentType | Journal Article | 
    
| Copyright | Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 1997 | 
    
| Copyright_xml | – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 1997 | 
    
| DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D  | 
    
| DOI | 10.1109/18.567644 | 
    
| DatabaseName | 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  | 
    
| DeliveryMethod | fulltext_linktorsrc | 
    
| Discipline | Engineering Computer Science  | 
    
| EISSN | 1557-9654 | 
    
| EndPage | 47 | 
    
| ExternalDocumentID | 11081818 10_1109_18_567644 567644  | 
    
| 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 RIG  | 
    
| ID | FETCH-LOGICAL-c304t-20ec82a6a6f3e8361ca41b4932f4d3a4a7ff30b7fbc3ddf331b502a065bb96cd3 | 
    
| IEDL.DBID | RIE | 
    
| ISSN | 0018-9448 | 
    
| IngestDate | Sat Sep 27 20:17:15 EDT 2025 Fri Jul 25 04:23:49 EDT 2025 Wed Oct 01 02:20:24 EDT 2025 Thu Apr 24 22:59:05 EDT 2025 Tue Aug 26 20:58:34 EDT 2025  | 
    
| IsPeerReviewed | true | 
    
| IsScholarly | true | 
    
| Issue | 1 | 
    
| Language | English | 
    
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html | 
    
| LinkModel | DirectLink | 
    
| MergedId | FETCHMERGED-LOGICAL-c304t-20ec82a6a6f3e8361ca41b4932f4d3a4a7ff30b7fbc3ddf331b502a065bb96cd3 | 
    
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23  | 
    
| PQID | 195905226 | 
    
| PQPubID | 36024 | 
    
| PageCount | 10 | 
    
| ParticipantIDs | proquest_miscellaneous_28480241 proquest_journals_195905226 crossref_citationtrail_10_1109_18_567644 crossref_primary_10_1109_18_567644 ieee_primary_567644  | 
    
| ProviderPackageCode | CITATION AAYXX  | 
    
| PublicationCentury | 1900 | 
    
| PublicationDate | 1997-Jan. 1997-01-00 19970101  | 
    
| PublicationDateYYYYMMDD | 1997-01-01 | 
    
| PublicationDate_xml | – month: 01 year: 1997 text: 1997-Jan.  | 
    
| PublicationDecade | 1990 | 
    
| PublicationPlace | New York | 
    
| PublicationPlace_xml | – name: New York | 
    
| PublicationTitle | IEEE transactions on information theory | 
    
| PublicationTitleAbbrev | TIT | 
    
| PublicationYear | 1997 | 
    
| 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 ref15 ref14 csisza´r (ref9) 1981 ref11 ref22 ref10 lapidoth (ref18) 1993 ref21 ref2 ref17 ref16 ref19 ref8 owen (ref20) 1982 ref7 ref4 ref3 ref6 ref5 cover (ref1) 1991  | 
    
| References_xml | – year: 1981 ident: ref9 publication-title: Information Theory Coding Theorems for Discrete Memoryless Systems – ident: ref15 doi: 10.1109/TIT.1985.1057034 – ident: ref10 doi: 10.1109/TIT.1983.1056758 – ident: ref22 doi: 10.1109/18.53740 – ident: ref16 doi: 10.1109/18.119699 – start-page: 26 year: 1993 ident: ref18 article-title: on information rates for mismatched decoders publication-title: Proc 2nd Int Winter Meet on Coding and Information Theory Dec 12– 15 1993 – ident: ref21 doi: 10.1002/j.1538-7305.1967.tb04246.x – ident: ref5 doi: 10.1109/18.370121 – ident: ref6 doi: 10.1109/18.340469 – ident: ref8 doi: 10.1109/TIT.1982.1056588 – ident: ref11 doi: 10.1109/18.9781 – ident: ref3 doi: 10.1109/18.532892 – year: 1982 ident: ref20 publication-title: Game Theory – ident: ref19 doi: 10.1109/ISIT.1994.394637 – ident: ref2 doi: 10.1109/18.532884 – ident: ref7 doi: 10.1109/26.380049 – ident: ref12 doi: 10.1109/TIT.1970.1054469 – ident: ref14 doi: 10.1109/TIT.1970.1054394 – ident: ref17 doi: 10.1109/18.532876 – ident: ref4 doi: 10.1109/18.476314 – ident: ref13 doi: 10.1016/S0019-9958(69)90403-3 – year: 1991 ident: ref1 publication-title: Elements of Information Theory doi: 10.1002/0471200611  | 
    
| SSID | ssj0014512 | 
    
| Score | 1.8120123 | 
    
| Snippet | Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d/sub 0/(x,x/spl circ//sub 0/).... A source sequence is described by the codeword that is closest to it according to the distortion measure d0(x,x0) using a codebook C. Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d(0)(x,xˆ(0)). Based on this...  | 
    
| SourceID | proquest crossref ieee  | 
    
| SourceType | Aggregation Database Enrichment Source Index Database Publisher  | 
    
| StartPage | 38 | 
    
| SubjectTerms | Additives Channel capacity Codes Constraint optimization Decoding Distortion measurement Encoding Information technology Rate distortion theory Rate-distortion Upper bound  | 
    
| Title | On the role of mismatch in rate distortion theory | 
    
| URI | https://ieeexplore.ieee.org/document/567644 https://www.proquest.com/docview/195905226 https://www.proquest.com/docview/28480241  | 
    
| Volume | 43 | 
    
| 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://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZoJxgoFBClPCzEwJI2jh3HGRGiqpCAhUrdIj8FAiWIJgP8emznIR4d2CLHtqKzL_edffcdABcUWyObJCKIExUGRIk0ECKSQcxkJJW2_phwicJ393S-ILfLeNnwbPtcGK21Dz7TE_fo7_JVISt3VDaNaWJn7oFewmidqtVdGJAY1cTgyOqvdTkaEiEUplPEJvXAH6bH11L58wP2VmU2qNO1V56M0AWTvEyqUkzk5y-qxn9-8A7YbtAlvKq3wy7Y0PkQDNrKDbBR5CHY-kZDuAfQQw4tDoQu0hAWBtqltzhWPsHnHDomCag8l4hbQugTHz_2wWJ283g9D5pSCoHEISmtLmjJIk45NVgzTJHkBAliwZshCnPCE2NwKBIjJFbKYIxEHEbc4hMhUioVPgD9vMj1IYCxVlwJyg1y40jKiKAJ14JxqY2O1AhctlLOZMMz7spdvGbe3wjTDLGsFswInHdd32pyjXWdhk6wXYe2ddyuXNZo3SpzRDmhA5QjcNa9tTJzdyA810W1yqw1ZhaWoKO1s47BZk1P645YjkG_fK_0iQUdpTj12-0LL-zVxA | 
    
| linkProvider | IEEE | 
    
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED7xGICBQgFRXrUQA0tKHD-SjAiBChRYWqlb5KdAoBTRdoBfj-2kFa-BLXJsKzr7ct_Zd98BnHDijGyayoilOo6olnkkZaIilqlEaeP8MekThe_ueXdAb4ZsWPNsh1wYY0wIPjMd_xju8vVITf1R2RnjqZt5EZYZpZRVyVrzKwPKcEUNjp0GO6ejphHCcX6Gs0419JvxCdVUfv2Cg125alQJ2-NAR-jDSZ4704nsqI8fZI3__OQNWK_xJTqvNsQmLJiyCY1Z7QZUq3IT1r4QEW4BfiiRQ4LIxxqikUVu8R2SVY_oqUSeSwLpwCbiFxGF1Mf3bRhcXfYvulFdTCFSJKYTpw1GZYnggltiMsKxEhRL6uCbpZoIKlJrSSxTKxXR2hKCJYsT4RCKlDlXmuzAUjkqzS4gZrTQkguL_TiaZ1TyVBiZCWWsSXQLTmdSLlTNNO4LXrwUweOI8wJnRSWYFhzPu75W9Bp_dWp6wc47zFr3ZytX1Ho3LjxVTuwhZQva87dOZv4WRJRmNB0Xzh5nDpjgvT9nbcNKt3_XK3rX97f7sFqR1foDlwNYmrxNzaGDIBN5FLbeJ4ez2RE | 
    
| 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=On+the+role+of+mismatch+in+rate+distortion+theory&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Lapidoth%2C+A&rft.date=1997-01-01&rft.issn=0018-9448&rft.volume=43&rft.issue=1&rft.spage=38&rft.epage=47&rft_id=info:doi/10.1109%2F18.567644&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 |