Results 321 to 330 of about 2,436,826 (370)
Some of the next articles are maybe not open access.

Broadcast channels in Estelle

IEEE Transactions on Computers, 1991
Using notation consistent with the Estelle ISO 9074 International Standard, the syntax and formal semantics for a broadcast channel are presented. These semantics make precise the meaning of an intuitive concept and additionally are compatible with those of the current Estelle FDT (formal description technique).
Paul D. Amer, S.C. Chamberlain
openaire   +2 more sources

Asymmetric Broadcast Channels

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012
Asymmetric Broadcast Channels (ABCs) are of practical importance due to the physical differences between Broadcast Channels' (BCs') sub-channels in reality. In this paper, several classes of ABCs are studied and various inner and outer bounds on their capacity regions are given.
Saeed Hajizadeh, Ghosheh Abed Hodtani
openaire   +2 more sources

Cooperative NOMA Broadcasting/Multicasting for Low-Latency and High-Reliability 5G Cellular V2X Communications

IEEE Internet of Things Journal, 2019
To achieve low-latency and high-reliability (LLHR) for the vehicle-to-everything (V2X) services, the Long Term Evolution (LTE)-based solution has been considered as a promising technology.
Gang Liu   +4 more
semanticscholar   +1 more source

MIMO Broadcast Channels with Channel Estimation

2007 IEEE International Conference on Communications, 2007
We consider a multi-user MIMO downlink where the transmitter has only estimates of the channel while the receivers have perfect channel information. The impact of channel estimation error on the sum rate is studied. It is shown that the sum rate saturates due to the inaccurate channel information.
Jun Shi, Minnie Ho
openaire   +2 more sources

Comments on Broadcast Channels

2009
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.
Sergio VerdÂ, Steven W. McLaughlin
openaire   +2 more sources

Capacity bounds for identification via broadcast channels that are optimal for the determination broadcast channel

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

Asymmetric Broadcast Channels

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   +2 more sources

Distributed broadcast channel access

Computer Networks (1976), 1979
Abstract This paper presents a general approach to sharing a broadcast channel among multiple processors. There are two components to the problem of sharing a single resource: (1) How to specify the usage pattern of the resource; and (2) How to restrict access to the resource so that the specified usage pattern can be realized.
Stephen A. Ward, Aloysius K Mok
openaire   +1 more source

Degraded Broadcast Channels

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

Synchronous atomic broadcast for redundant broadcast channels

Real-Time Systems, 1990
We 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

Home - About - Disclaimer - Privacy