Related papers: Writing on Dirty Paper with Resizing and its Appli…
The downlink of a multiple-input multiple output (MIMO) broadcast channel (BC) is considered, where each receiver is equipped with a single antenna and the transmitter performs nonlinear Dirty-Paper Coding (DPC). We present an efficient…
The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL)…
We analytically approximate the expected sum capacity loss between the optimal downlink precoding technique of dirty paper coding (DPC), and the sub-optimal technique of zero-forcing precoding, for multiuser channels. We also consider the…
The Gaussian broadcast channel (GBC) with $K$ transmit antennas and $K$ single-antenna users is considered for the case in which the channel state information is obtained at the transmitter via a finite-rate feedback link of capacity $r$…
In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate…
Recently, researchers showed that dirty paper coding (DPC) is the optimal transmission strategy for multiple-input multiple-output broadcast channels (MIMO-BC). In this paper, we study how to determine the maximum weighted sum of DPC rates…
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity linear precoding (e.g., zero-forcing and block diagonalization)…
For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum achievable expected rate for coding over a finite number of coherent blocks represents a fundamental measure of the…
In this paper, delay-limited transmission of quasi-stationary sources over block fading channels are considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive…
In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white…
In this paper, the ergodic sum-rate and outage probability of a downlink single-antenna channel with K users are analyzed in the presence of Rayleigh flat fading, where limited channel state information (CSI) feedback is assumed.…
We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but…
In this work, we consider a partially cooperative relay broadcast channel (PC-RBC) controlled by random parameters. We provide rate regions for two different situations: 1) when side information (SI) S^n on the random parameters is…
We consider a problem of unsourced random access in the quasi-static Rayleigh fading channel. In the previous work, the authors have proposed LDPC code based solutions based on joint and treat interference as noise in combination with…
This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…
Recently there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with…
We derive various error exponents for communication channels with random states, which are available non-causally at the encoder only. For both the finite-alphabet Gel'fand-Pinsker channel and its Gaussian counterpart, the dirty-paper…
A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…
We investigate the MIMO broadcast channel in the high SNR regime when linear filtering is applied instead of dirty paper coding. Using a user-wise rate duality where the streams of every single user are not treated as self-interference as…
In streaming applications, doping improves the performance of spatially-coupled low-density parity-check (SC-LDPC) codes by creating reduced-degree check nodes in the coupled chain. We formulate a scaling law to predict the bit and block…