Communication via decentralized processing

Amichai Sanderovich; Shlomo Shamai; Yossef Steinberg; Gerhard Kramer

doi:10.1109/ISIT.2005.1523532

Communication via decentralized processing

Amichai Sanderovich, Shlomo Shamai, Yossef Steinberg, Gerhard Kramer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

14 Scopus citations

Abstract

The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. access points of a wireless network, where each access point is equipped with a different connection bandwidth. The case where these agents do not have any decoding ability is fully characterized for the Gaussian channel, when the transmitter uses "typical" codewords. For general discrete memoryless channels, lower and upper bounds are derived. An achievable rate with unrestricted agents, which are capable of decoding, is also given and then demonstrated by a numerical example for the Gaussian channel.

Original language	English
Title of host publication	Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages	1201-1205
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2005.1523532
State	Published - 2005
Externally published	Yes
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 4 Sep 2005 → 9 Sep 2005

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2005
ISSN (Print)	2157-8099

Conference

Conference	2005 IEEE International Symposium on Information Theory, ISIT 05
Country/Territory	Australia
City	Adelaide
Period	4/09/05 → 9/09/05

Access to Document

10.1109/ISIT.2005.1523532

Cite this

@inproceedings{0c84d4843de74063bf6226a616d8ef8a,

title = "Communication via decentralized processing",

abstract = "The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. access points of a wireless network, where each access point is equipped with a different connection bandwidth. The case where these agents do not have any decoding ability is fully characterized for the Gaussian channel, when the transmitter uses {"}typical{"} codewords. For general discrete memoryless channels, lower and upper bounds are derived. An achievable rate with unrestricted agents, which are capable of decoding, is also given and then demonstrated by a numerical example for the Gaussian channel.",

author = "Amichai Sanderovich and Shlomo Shamai and Yossef Steinberg and Gerhard Kramer",

year = "2005",

doi = "10.1109/ISIT.2005.1523532",

language = "English",

isbn = "0780391519",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1201--1205",

booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05",

note = "2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

}

Sanderovich, A, Shamai, S, Steinberg, Y & Kramer, G 2005, Communication via decentralized processing. in Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05., 1523532, IEEE International Symposium on Information Theory - Proceedings, vol. 2005, pp. 1201-1205, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 4/09/05. https://doi.org/10.1109/ISIT.2005.1523532

Communication via decentralized processing. / Sanderovich, Amichai; Shamai, Shlomo; Steinberg, Yossef et al.
Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. 2005. p. 1201-1205 1523532 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Communication via decentralized processing

AU - Sanderovich, Amichai

AU - Shamai, Shlomo

AU - Steinberg, Yossef

AU - Kramer, Gerhard

PY - 2005

Y1 - 2005

N2 - The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. access points of a wireless network, where each access point is equipped with a different connection bandwidth. The case where these agents do not have any decoding ability is fully characterized for the Gaussian channel, when the transmitter uses "typical" codewords. For general discrete memoryless channels, lower and upper bounds are derived. An achievable rate with unrestricted agents, which are capable of decoding, is also given and then demonstrated by a numerical example for the Gaussian channel.

AB - The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. access points of a wireless network, where each access point is equipped with a different connection bandwidth. The case where these agents do not have any decoding ability is fully characterized for the Gaussian channel, when the transmitter uses "typical" codewords. For general discrete memoryless channels, lower and upper bounds are derived. An achievable rate with unrestricted agents, which are capable of decoding, is also given and then demonstrated by a numerical example for the Gaussian channel.

UR - http://www.scopus.com/inward/record.url?scp=33749441450&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2005.1523532

DO - 10.1109/ISIT.2005.1523532

M3 - Conference contribution

AN - SCOPUS:33749441450

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1201

EP - 1205

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

Communication via decentralized processing

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this