Related papers: Explicit Lower Bounds on the Outage Probability of…
This paper analyzes the maximal achievable rate for a given blocklength and error probability over a multiple-antenna ambient backscatter channel with perfect channel state information at the receiver. The result consists of a finite…
A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary…
While the channel capacity reflects a theoretical upper bound on the achievable information transmission rate in the limit of infinitely many bits, it does not characterise the information transfer of a given encoding routine with finitely…
We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…
We consider the discrete memoryless degraded broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent function.…
An outer bound to the capacity region of the two-receiver discrete memoryless broadcast channel is given. The outer bound is tight for all cases where the capacity region is known. When specialized to the case of no common information, this…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
This letter concerns the power allocation across the multiple transmission rounds under the Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) policy, in pursuit of an energy-efficient way of fulfilling the outage probability…
MIMO processing techniques in fiber optical communications have been proposed as a promising approach to meet increasing demand for information throughput. In this context, the multiple channels correspond to the multiple modes and/or…
The multi-user diversity in spectrum sharing cognitive radio systems with average power constraints over fading channels is investigated. Average power constraints are imposed for both the transmit power at the secondary transmitter and the…
In practice, since many communication networks are huge in scale, or complicated in structure, or even dynamic, the predesigned linear network codes based on the network topology is impossible even if the topological structure is known.…
In this paper, we investigate the outage performance of time division broadcasting (TDBC) protocol in independent but non-identical Rayleigh flat-fading channels, where all nodes are interfered by a finite number of co-channel interferers.…
Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications…
In this paper, we consider a massive uncoordinated non-orthogonal multiple access (NOMA) scheme where devices have strict latency requirements and no retransmission opportunities are available. Each device chooses a pilot sequence from a…
The joint detection uses Kalman filtering (KF) to estimate the prior probability of control outputs to assist channel decoding. In this paper, we regard the joint detection as maximum a posteriori (MAP) decoding and derive the lower and…
In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…
This study considers a virtual multiuser multiple-input multiple-output system with PSK modulation realized via the reconfigurable intelligent surface-based passive transmitter setup. Under this framework, the study derives the formulation…
This paper analyzes the outage performance in finite wireless networks. Unlike most prior works, which either assumed a specific network shape or considered a special location of the reference receiver, we propose two general frameworks for…
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…
In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized…