Some Results on Distributed Source Coding for Interactive Function Computation

A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory Jg. 57; H. 9; S. 6180 - 6195
Hauptverfasser: Nan Ma, Ishwar, P.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.09.2011
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 A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a 2-D definite integral and a rate-allocation curve. The benefit of interaction is highlighted in multiterminal function computation problem through examples. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.
AbstractList A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a 2-D definite integral and a rate-allocation curve. The benefit of interaction is highlighted in multiterminal function computation problem through examples. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows. [PUBLICATION ABSTRACT]
A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in terms of single-letter information measures. While interaction is useless in terms of the minimum sum-rate for lossless source reproduction at one or both locations, the gains can be arbitrarily large for function computation even when the sources are independent. For a class of sources and functions, interaction is shown to be useless, even with infinite messages, when a function has to be computed at only one location, but is shown to be useful, if functions have to be computed at both locations. For computing the Boolean AND function of two independent Bernoulli sources at both locations, an achievable infinite-message sum-rate with infinitesimal-rate messages is derived in terms of a 2-D definite integral and a rate-allocation curve. The benefit of interaction is highlighted in multiterminal function computation problem through examples. For networks with a star topology, multiple rounds of interactive coding is shown to decrease the scaling law of the total network rate by an order of magnitude as the network grows.
Author Nan Ma
Ishwar, P.
Author_xml – sequence: 1
  surname: Nan Ma
  fullname: Nan Ma
  email: nanma@eecs.berkeley.edu
  organization: Dept. of Electr. & Comput. Eng., Boston Univ., Boston, MA, USA
– sequence: 2
  givenname: P.
  surname: Ishwar
  fullname: Ishwar, P.
  email: pi@bu.edu
  organization: Dept. of Electr. & Comput. Eng., Boston Univ., Boston, MA, USA
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=24554490$$DView record in Pascal Francis
BookMark eNp9kEFLwzAYQINMcJveBS9B8NiZpEnaHGU6HQwFN88lTRPJ6JqZpIL_3oyOHTx4yhd4L194EzDqXKcBuMZohjES95vlZkYQxjOCORaYn4ExZqzIBGd0BMYI4TITlJYXYBLCNl0pw2QMXtdup-G7Dn0bA3QdfLQhelv3UTdw7XqvNJy7xnaf0DgPl13UXqpovzVc9F0akjJ3u30f5WG-BOdGtkFfHc8p-Fg8beYv2erteTl_WGUqL3nMCqooKQtmDOKqKBsuSiEoqZtaaVIQaXgjEFW5qmtuKEEMSUWUxEhJRg2V-RTcDu_uvfvqdYjVNv21SyurUlAsClqSBN0dIRmUbI2XnbKh2nu7k_6nIpQxSgVKHBo45V0IXpsTglF1iFuluNUhbnWMmxT-R1F2KBC9tO1_4s0gWq31aQ9HiHPM8l-UW4h9
CODEN IETTAW
CitedBy_id crossref_primary_10_1109_TIT_2016_2621749
crossref_primary_10_1109_TIT_2023_3327151
crossref_primary_10_1007_s00453_018_0484_8
crossref_primary_10_1007_s11537_018_1727_9
crossref_primary_10_1109_TIT_2023_3309920
crossref_primary_10_1109_TIT_2020_2980789
crossref_primary_10_3390_e19120635
crossref_primary_10_1109_TIT_2017_2746859
crossref_primary_10_1109_TIT_2023_3327314
crossref_primary_10_1109_TIT_2018_2883295
crossref_primary_10_1109_TSP_2015_2483479
crossref_primary_10_1109_TIT_2022_3182416
crossref_primary_10_1109_TIT_2016_2524576
crossref_primary_10_1109_TIT_2014_2364572
crossref_primary_10_1137_130938517
crossref_primary_10_1109_TIT_2013_2251412
crossref_primary_10_3390_e24010110
crossref_primary_10_1109_TIT_2013_2264355
crossref_primary_10_1109_JPROC_2010_2065790
crossref_primary_10_1109_TIT_2015_2455977
crossref_primary_10_1038_s41467_017_01887_5
crossref_primary_10_1109_TIT_2019_2946364
crossref_primary_10_1109_TWC_2016_2533379
crossref_primary_10_1109_TIT_2019_2953877
crossref_primary_10_1109_TIT_2022_3184643
crossref_primary_10_1109_TIT_2016_2568207
crossref_primary_10_1080_03081079_2012_708342
crossref_primary_10_1134_S0032946016010063
crossref_primary_10_1002_ett_2665
crossref_primary_10_1137_17M1139254
crossref_primary_10_1109_TIT_2015_2428236
crossref_primary_10_1109_TIT_2019_2922634
crossref_primary_10_1109_TIT_2021_3100781
Cites_doi 10.1109/TIT.2010.2040867
10.1109/18.86993
10.1109/MCOM.2006.1632656
10.1109/18.340481
10.1002/0471200611
10.1109/TIT.1982.1056560
10.1109/TIT.1987.1057272
10.1109/18.57210
10.1109/TIT.1979.1056022
10.1109/ALLERTON.2009.5394497
10.1109/TIT.1985.1057118
10.1109/JSAC.2005.843543
10.1109/18.915643
10.1109/ISIT.2009.5205926
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2011
Copyright_xml – notice: 2015 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2011
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TIT.2011.2161916
DatabaseName IEEE Xplore (IEEE)
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
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 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 6195
ExternalDocumentID 2469307011
24554490
10_1109_TIT_2011_2161916
6006615
Genre orig-research
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
ID FETCH-LOGICAL-c386t-74c42875ff06c78d6989942bdbce272af6d904c3cbb6f42050ac2ca10ca54f4a3
IEDL.DBID RIE
ISICitedReferencesCount 71
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000295738800046&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 30 04:50:39 EST 2025
Mon Jul 21 09:13:45 EDT 2025
Tue Nov 18 22:35:36 EST 2025
Sat Nov 29 03:53:12 EST 2025
Tue Aug 26 17:17:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Lossless circuit
Source coding
Resource allocation
Distributed source signal
Rate distortion theory
Boolean function
Star network
Slepian―Wolf coding
Interactive system
Distributed source coding
Scaling law
Information measure
Wyner―Ziv coding
Source localization
interactive coding
rate-distortion region
Wyner Ziv problem
function computation
Resource management
Target detection
two-way coding
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c386t-74c42875ff06c78d6989942bdbce272af6d904c3cbb6f42050ac2ca10ca54f4a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 894197482
PQPubID 36024
PageCount 16
ParticipantIDs crossref_primary_10_1109_TIT_2011_2161916
proquest_journals_894197482
pascalfrancis_primary_24554490
ieee_primary_6006615
crossref_citationtrail_10_1109_TIT_2011_2161916
PublicationCentury 2000
PublicationDate 2011-09-01
PublicationDateYYYYMMDD 2011-09-01
PublicationDate_xml – month: 09
  year: 2011
  text: 2011-09-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2011
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 ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref17
ref8
ref9
ref4
ref3
kushilevitz (ref1) 1997
ref6
ref5
yang (ref7) 2008
ma (ref16) 2010
References_xml – ident: ref8
  doi: 10.1109/TIT.2010.2040867
– start-page: 419
  year: 2008
  ident: ref7
  article-title: On interactive encoding and decoding for lossless source coding with decoder only side information
  publication-title: Proc IEEE Int Symp Information Theory
– ident: ref15
  doi: 10.1109/18.86993
– ident: ref4
  doi: 10.1109/MCOM.2006.1632656
– ident: ref2
  doi: 10.1109/18.340481
– year: 2010
  ident: ref16
  publication-title: Interactive Source Coding for Function Computation in Networks
– ident: ref6
  doi: 10.1002/0471200611
– ident: ref9
  doi: 10.1109/TIT.1982.1056560
– ident: ref10
  doi: 10.1109/TIT.1987.1057272
– ident: ref14
  doi: 10.1109/18.57210
– ident: ref13
  doi: 10.1109/TIT.1979.1056022
– ident: ref12
  doi: 10.1109/ALLERTON.2009.5394497
– ident: ref5
  doi: 10.1109/TIT.1985.1057118
– year: 1997
  ident: ref1
  publication-title: Communication Complexity
– ident: ref3
  doi: 10.1109/JSAC.2005.843543
– ident: ref11
  doi: 10.1109/18.915643
– ident: ref17
  doi: 10.1109/ISIT.2009.5205926
SSID ssj0014512
Score 2.356513
Snippet A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 6180
SubjectTerms Applied sciences
Boolean functions
Coding theory
Coding, codes
Complexity theory
Computational mathematics
Computer science
Decoding
Detection, estimation, filtering, equalization, prediction
Distributed source coding
Exact sciences and technology
function computation
Information theory
Information, signal and communications theory
interactive coding
Mathematical problems
Random variables
Rate-distortion
rate-distortion region
Signal and communications theory
Signal, noise
Slepian-Wolf coding
Source coding
Telecommunications and information theory
two-way coding
Wyner-Ziv coding
Title Some Results on Distributed Source Coding for Interactive Function Computation
URI https://ieeexplore.ieee.org/document/6006615
https://www.proquest.com/docview/894197482
Volume 57
WOSCitedRecordID wos000295738800046&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/eLvHCXMwlV1LS8QwEB5UPOjBt7i-yMGLYN00SZvmKOqiIIvoKt5KOklB0K3YXX-_SdotiiJ4KzR9MF8m88hkPoCjxEjEgvPIli42EQyTSPHYRnGaaG5lzFhI6D_eyOEwe3pSt3Nw0p2FsdaG4jN76i_DXr6pcOpTZf3UG0h_onxeStmc1ep2DEQSN53BY6fALuaYbUlS1R9dj5pency5N8ozm38xQYFTxVdE6toJpWzYLH4szMHaDFb_959rsNJ6leSsmQbrMGfHG7A6Y2wgrQJvwPKX9oObMLyvXi25s_X0ZVKTakwufBddT4BlDbkPWX1yXnnjRpxrS0LyUIf1kQycOfSQkuYbAd4teBhcjs6vopZfIUKepZNICvQBU1KWNEWZGc8lqQQrTIGWSabL1CgqkGNRpKVgNKEaGeqYok5EKTTfhoVxNbY7QKjNjOGoDHOyNyhVZrSyiU41TzErTA_6M5Hn2DYf9xwYL3kIQqjKHUi5BylvQerBcffEW9N444-xmx6Eblwr_x4cfkO1u8-Ec6KEoj3Ym8Gct6pb55kSsQuyMrb7-1v3YKnJK_s6s31YmLxP7QEs4sfkuX4_DJPyE6pe31k
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS-QwFD6ICurDesdZdzUPvgjWSXNpm0dxd1AcB9Fx8a2kJykIOhU74-83STvFxUXYt0LTC-fLybnk5HwAR9KkiAXnkS1dbCIYykjx2EZxIjW3acxYSOj_GaajUfbwoG4W4KQ7C2OtDcVn9tRfhr18U-HMp8r6iTeQ_kT5khSCxc1prW7PQMi46Q0eOxV2Ucd8U5Kq_vhy3HTrZM7BUZ7b_IMRCqwqviZS104sZcNn8WlpDvZmsP5_f7oB31q_kpw1E2ETFuxkC9bnnA2kVeEtWPvQgHAbRnfVsyW3tp49TWtSTcgv30fXU2BZQ-5CXp-cV968EefckpA-1GGFJANnED2opPlGAHgH7ge_x-cXUcuwECHPkmmUCvQhkyxLmmCaGc8mqQQrTIGWpUyXiVFUIMeiSErBqKQaGeqYopaiFJrvwuKkmtg9INRmxnBUhjnZG0xVZrSyUieaJ5gVpgf9uchzbNuPexaMpzyEIVTlDqTcg5S3IPXguHvipWm98cXYbQ9CN66Vfw8O_kK1u8-Ec6OEoj3Yn8Oct8pb55kSsQuzMvb93289hJWL8fUwH16OrvZhtcky-6qzH7A4fZ3Zn7CMb9PH-vUgTNB3bJ3ioA
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=Some+Results+on+Distributed+Source+Coding+for+Interactive+Function+Computation&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Ma%2C+Nan&rft.au=Ishwar%2C+Prakash&rft.date=2011-09-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=57&rft.issue=9&rft.spage=6180&rft.epage=6195&rft_id=info:doi/10.1109%2FTIT.2011.2161916&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2011_2161916
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