TY - JOUR
T1 - The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise
AU - Goldsmith, Andrea J.
AU - Effros, Michelle
N1 - Funding Information:
Manuscript received September 16, 1998; revised December 1, 1999. The work of A. J. Goldsmith was supported by an ONR Young Investigator Award N00014-99-1-0698 and by an NSF CAREER Award NCR-9501452. The work of M. Effros was supported by an NSF CAREER Award MIP-9501977, a grant from the Powell Foundation, and donations from Intel. A. J. Goldsmith is with the Department of Electrical Engineering, Stanford University, Stanford, CA 94025-9515 USA (e-mail: [email protected]). M. Effros is with the Department of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125 USA (e-mail: [email protected]). Communicated by M. L. Honig, Associate Editor for Communications. Publisher Item Identifier S 0018-9448(01)00461-8.
PY - 2001/1
Y1 - 2001/1
N2 - We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We then show that the capacity region of the original broadcast channel equals that of the circular broadcast channel in the limit of infinite block length, and we obtain an explicit formula for the resulting capacity region. The coding strategy used to achieve each point on the convex hull of the capacity region uses superposition coding on some or all of the parallel channels and dedicated transmission on the others. The optimal power allocation for any point in the capacity region is obtained via a multilevel water-filling. We derive this optimal power allocation and the resulting capacity region for several broadcast channel models.
AB - We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We then show that the capacity region of the original broadcast channel equals that of the circular broadcast channel in the limit of infinite block length, and we obtain an explicit formula for the resulting capacity region. The coding strategy used to achieve each point on the convex hull of the capacity region uses superposition coding on some or all of the parallel channels and dedicated transmission on the others. The optimal power allocation for any point in the capacity region is obtained via a multilevel water-filling. We derive this optimal power allocation and the resulting capacity region for several broadcast channel models.
KW - Broadcast channels
KW - Capacity region
KW - Colored Gaussian noise
KW - Intersymbol interference (ISI)
UR - http://www.scopus.com/inward/record.url?scp=0035094678&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035094678&partnerID=8YFLogxK
U2 - 10.1109/18.904524
DO - 10.1109/18.904524
M3 - Article
AN - SCOPUS:0035094678
SN - 0018-9448
VL - 47
SP - 219
EP - 240
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -