Related papers: Precoding for Outage Probability Minimization on B…
The next generation of wireless communications systems will employ new frequency bands such as those in the upper midband, millimeter-wave and sub-terahertz frequency bands. The high energy consumption of analog-to-digital converters…
This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…
We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…
As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…
We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…
In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed over both coherent and noncoherent fading channels. Two modulation schemes, namely on-off phase-shift keying (OOPSK) and on-off…
Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…
This paper seeks an efficient algorithm for stochastic precoding to maximize the long-term average weighted sum rates throughout a multiple-input multiple-output (MIMO) network. Unlike many existing works that assume a particular…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
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 propose a simple and accurate method to evaluate the outage probability at the output of arbitrarily fading L-branch diversity combining receiver. The method is based on the saddlepoint approximation, which only requires the knowledge of…
In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the…
We study irregular binary turbo codes over non-ergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo…
This paper studies the outage probability and the throughput of amplify-and-forward relay networks with wireless information and energy transfer. We use some recent results on finite block-length codes to analyze the system performance in…
An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem…
This paper studies the optimal power allocation for outage minimization in point-to-point fading channels with the energy-harvesting constraints and channel distribution information (CDI) at the transmitter. Both the cases with non-causal…
We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We…
A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.
We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…
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.…