Results 211 to 220 of about 95,619 (236)
Some of the next articles are maybe not open access.
Gaussian Broadcast Channel With Feedback
IEEE Transactions on Information Theory, 2008For a Gaussian broadcast channel, it is known that: the capacity region in general is enlarged in the presence of feedback from all the receivers; and in the physically degraded case, feedback does not enlarge the capacity region. It is shown that the capacity region of a two-user Gaussian broadcast channel (GBC) is enlarged even when the feedback is ...
openaire +3 more sources
IEEE Transactions on Information Theory, 1990
An inner bound to the capacity region for identification via a broadcast channel with feedback and a soft outer bound to the capacity region of a general broadcast channel without feedback are established, allowing randomized encoding in both cases.
E.C. van der Meulen, B. Verboven
openaire +2 more sources
An inner bound to the capacity region for identification via a broadcast channel with feedback and a soft outer bound to the capacity region of a general broadcast channel without feedback are established, allowing randomized encoding in both cases.
E.C. van der Meulen, B. Verboven
openaire +2 more sources
On the multiple antenna broadcast channel
Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256), 2001This paper summarizes, with a tutorial flavor, the "quest" for the capacity region of a Gaussian broadcast channel with vector input and scalar outputs, where the channel is linear time-invariant and perfectly known to all terminals. Determining the capacity region of this channel is a challenge, since this model belongs to the class of non-degraded ...
Giuseppe Caire, S. Shamai
openaire +2 more sources
The capacity of a class of broadcast channels [PDF]
IEEE Transactions on Information Theory, 1979 The capacity region is established for those discrete memoryless broadcast channels p(y,z \mid x) for which I(X;Y) \geq I(X;Z) holds for all Input distributions. The capacity region for this class of channels resembles the capacity region for degraded message sets considered by Korner and Marton.
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 +2 more sources
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 +2 more sources
Synchronous atomic broadcast for redundant broadcast channels
Real-Time Systems, 1990We propose a synchronous atomic broadcast protocol for distributed real-time systems based on redundant broadcast channels. The protocol can tolerate a finite number f of concurrent processor crash failures, channel adapter performance failures and channel omission failures. Its message cost is optimal: when no failures occur only f+1 messages are sent
openaire +2 more sources
Advances in TRP channel drug discovery: from target validation to clinical studies
Nature Reviews Drug Discovery, 2022Ari-pekka Koivisto +2 more
exaly
A Survey of Channel Modeling for UAV Communications
IEEE Communications Surveys and Tutorials, 2018Aziz Altaf Khuwaja +2 more
exaly