On dependence balance bounds for two way channels

Ravi Tandon; Sennur Ulukus

doi:10.1109/ACSSC.2007.4487342

On dependence balance bounds for two way channels

Ravi Tandon, Sennur Ulukus

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

3 Scopus citations

Abstract

The idea that no more dependence can be consumed than produced was used to obtain an outer bound to the capacity region of the single output two-way channel in [1]. A parallel channel extension of this bound was used to obtain an outer bound of 0.64628 bits/transmission for the sum-rate point of the binary multiplying channel (BMC) which improved over Zhang-Berger-Schalkwijk bound of 0.64891 bits/transmission [2]. It is not obvious that this selection of parallel channel would yield the best sum-rate outer bound for the BMC using the idea of dependence balance. We show that for all binary adaptive parallel channels, the best sum-rate outer bound for the BMC is 0.64628 bits/transmission and corresponds to the parallel channel selection of [1].

Original language	English (US)
Title of host publication	Conference Record of the 41st Asilomar Conference on Signals, Systems and Computers, ACSSC
Pages	868-872
Number of pages	5
DOIs	https://doi.org/10.1109/ACSSC.2007.4487342
State	Published - 2007
Externally published	Yes
Event	41st Asilomar Conference on Signals, Systems and Computers, ACSSC - Pacific Grove, CA, United States Duration: Nov 4 2007 → Nov 7 2007

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)	1058-6393

Other

Other	41st Asilomar Conference on Signals, Systems and Computers, ACSSC
Country/Territory	United States
City	Pacific Grove, CA
Period	11/4/07 → 11/7/07

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2007.4487342

Cite this

Tandon, R & Ulukus, S 2007, On dependence balance bounds for two way channels. in Conference Record of the 41st Asilomar Conference on Signals, Systems and Computers, ACSSC., 4487342, Conference Record - Asilomar Conference on Signals, Systems and Computers, pp. 868-872, 41st Asilomar Conference on Signals, Systems and Computers, ACSSC, Pacific Grove, CA, United States, 11/4/07. https://doi.org/10.1109/ACSSC.2007.4487342

@inproceedings{995ddb7d8ff74fa7810e6035f57acb0a,

title = "On dependence balance bounds for two way channels",

abstract = "The idea that no more dependence can be consumed than produced was used to obtain an outer bound to the capacity region of the single output two-way channel in [1]. A parallel channel extension of this bound was used to obtain an outer bound of 0.64628 bits/transmission for the sum-rate point of the binary multiplying channel (BMC) which improved over Zhang-Berger-Schalkwijk bound of 0.64891 bits/transmission [2]. It is not obvious that this selection of parallel channel would yield the best sum-rate outer bound for the BMC using the idea of dependence balance. We show that for all binary adaptive parallel channels, the best sum-rate outer bound for the BMC is 0.64628 bits/transmission and corresponds to the parallel channel selection of [1].",

author = "Ravi Tandon and Sennur Ulukus",

year = "2007",

doi = "10.1109/ACSSC.2007.4487342",

language = "English (US)",

isbn = "9781424421107",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

pages = "868--872",

booktitle = "Conference Record of the 41st Asilomar Conference on Signals, Systems and Computers, ACSSC",

note = "41st Asilomar Conference on Signals, Systems and Computers, ACSSC ; Conference date: 04-11-2007 Through 07-11-2007",

}

TY - GEN

T1 - On dependence balance bounds for two way channels

AU - Tandon, Ravi

AU - Ulukus, Sennur

PY - 2007

Y1 - 2007

N2 - The idea that no more dependence can be consumed than produced was used to obtain an outer bound to the capacity region of the single output two-way channel in [1]. A parallel channel extension of this bound was used to obtain an outer bound of 0.64628 bits/transmission for the sum-rate point of the binary multiplying channel (BMC) which improved over Zhang-Berger-Schalkwijk bound of 0.64891 bits/transmission [2]. It is not obvious that this selection of parallel channel would yield the best sum-rate outer bound for the BMC using the idea of dependence balance. We show that for all binary adaptive parallel channels, the best sum-rate outer bound for the BMC is 0.64628 bits/transmission and corresponds to the parallel channel selection of [1].

AB - The idea that no more dependence can be consumed than produced was used to obtain an outer bound to the capacity region of the single output two-way channel in [1]. A parallel channel extension of this bound was used to obtain an outer bound of 0.64628 bits/transmission for the sum-rate point of the binary multiplying channel (BMC) which improved over Zhang-Berger-Schalkwijk bound of 0.64891 bits/transmission [2]. It is not obvious that this selection of parallel channel would yield the best sum-rate outer bound for the BMC using the idea of dependence balance. We show that for all binary adaptive parallel channels, the best sum-rate outer bound for the BMC is 0.64628 bits/transmission and corresponds to the parallel channel selection of [1].

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

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

U2 - 10.1109/ACSSC.2007.4487342

DO - 10.1109/ACSSC.2007.4487342

M3 - Conference contribution

AN - SCOPUS:50249106376

SN - 9781424421107

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 868

EP - 872

BT - Conference Record of the 41st Asilomar Conference on Signals, Systems and Computers, ACSSC

T2 - 41st Asilomar Conference on Signals, Systems and Computers, ACSSC

Y2 - 4 November 2007 through 7 November 2007

ER -

On dependence balance bounds for two way channels

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this