Results 241 to 250 of about 231,239 (274)
Some of the next articles are maybe not open access.
BROADCAST CHANNEL TRANSMISSION CAPACITY
Vestnik komp'iuternykh i informatsionnykh tekhnologii, 2019The most important studies of well-known Broadcast Communication Channels (BCC) models are associated with obtaining accurate information efficiency estimates(IE). Earlier, the coding problem was stated, the joint information measure (JI) of the proposed BCC model was introduced and investigated.
O. A. Ostroumov, A. D. Sinyuk
openaire +1 more source
Precoder Design for MIMO Broadcast Channels
2005 Australian Communications Theory Workshop, 2005This paper considers precoder designs in downlink MIMO broadcast channels (BC). A preceding scheme that is analog to the MMSE decision feedback equalizer in the uplink MIMO multiple access channels is first introduced. The proposed scheme can asymptotically achieve the sum-capacity of MIMO-BC at high SNRs. At medium SNRs, its achievable sum capacity is
null Xun Shao +2 more
openaire +1 more source
1981
Broadcast channels have been introduced by Cover in a paper published in 1972 [1] ; as an acknowledgement to the importance of this work he was granted the IEEE award in 1973. By now broadcast channels are firmly established as one of the most relevant channel networks for multi-terminal communication.
openaire +1 more source
Broadcast channels have been introduced by Cover in a paper published in 1972 [1] ; as an acknowledgement to the importance of this work he was granted the IEEE award in 1973. By now broadcast channels are firmly established as one of the most relevant channel networks for multi-terminal communication.
openaire +1 more source
Parallel relay broadcast channels
2010 IEEE International Symposium on Information Theory, 2010In this paper, we study the achievable rate regions of parallel relay broadcast channels. We present two system models, the parallel unshared-relay broadcast channel and the parallel shared-relay broadcast channel. In the first system, each relay node is peculiar to one of the users and does not assist any other user.
openaire +1 more source
1978
Let A = {1,..., a}, B = {1,..., b}, and C = {1,..., c}. Let w1(· | ·) be the c.p.f. of a d.m.c. A → B, and w2(· | ·) the c.p.f. of a d.m.c. B → C. Write A n * for the Cartesian product of n A’s, with similar definitions for B n * , C n * , and, later, for D n * .
openaire +1 more source
Let A = {1,..., a}, B = {1,..., b}, and C = {1,..., c}. Let w1(· | ·) be the c.p.f. of a d.m.c. A → B, and w2(· | ·) the c.p.f. of a d.m.c. B → C. Write A n * for the Cartesian product of n A’s, with similar definitions for B n * , C n * , and, later, for D n * .
openaire +1 more source
Comments on broadcast channels
IEEE Transactions on Information Theory, 1998Summary: The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region. The capacity region is still unknown.
openaire +2 more sources
Comments on Broadcast Channels
2009The key ideas in the theory of broadcast channels are illustrated by discussing some of the progress toward finding the capacity region. The capacity region is still unknown.
openaire +1 more source
Advances in TRP channel drug discovery: from target validation to clinical studies
Nature Reviews Drug Discovery, 2021Ari-Pekka Koivisto +2 more
exaly