Achievable Rate Regions for Two-Way Relay Channel using Nested Lattice Coding

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing a layered coding : a common layer is decoded by both receivers and a refinement layer is recovered only by the receiver which has the best channel conditions. The achievable rates of the new scheme are characterized and are shown to be higher than those provided by the decode-and-forward strategy in some regions.Comment: 27 pages, 13 figures, Submitted to IEEE Transactions on Wireless Communications (October 2013

Cooperative Compute-and-Forward

We examine the benefits of user cooperation under compute-and-forward. Much like in network coding, receivers in a compute-and-forward network recover finite-field linear combinations of transmitters' messages. Recovery is enabled by linear codes: transmitters map messages to a linear codebook, and receivers attempt to decode the incoming superposition of signals to an integer combination of codewords. However, the achievable computation rates are low if channel gains do not correspond to a suitable linear combination. In response to this challenge, we propose a cooperative approach to compute-and-forward. We devise a lattice-coding approach to block Markov encoding with which we construct a decode-and-forward style computation strategy. Transmitters broadcast lattice codewords, decode each other's messages, and then cooperatively transmit resolution information to aid receivers in decoding the integer combinations. Using our strategy, we show that cooperation offers a significant improvement both in the achievable computation rate and in the diversity-multiplexing tradeoff.Comment: submitted to IEEE Transactions on Information Theor

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

On AVCs with Quadratic Constraints

In this work we study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "oblivious" jammer (along with additional AWGN) under a maximum probability of error criterion, and no private randomness between the transmitter and the receiver. This is in contrast to similar AVC models under the average probability of error criterion considered in [1], and models wherein common randomness is allowed [2] -- these distinctions are important in some communication scenarios outlined below. We consider the regime where the jammer's power constraint is smaller than the transmitter's power constraint (in the other regime it is known no positive rate is possible). For this regime we show the existence of stochastic codes (with no common randomness between the transmitter and receiver) that enables reliable communication at the same rate as when the jammer is replaced with AWGN with the same power constraint. This matches known information-theoretic outer bounds. In addition to being a stronger result than that in [1] (enabling recovery of the results therein), our proof techniques are also somewhat more direct, and hence may be of independent interest.Comment: A shorter version of this work will be send to ISIT13, Istanbul. 8 pages, 3 figure

COVERT COMMUNICATIONS IN CONTINUOUS-TIME SYSTEMS

This dissertation studies covert wireless communications where a transmitter (Alice) intends to transmit messages to a legitimate receiver (Bob) such that the presence of the message is hidden from an attentive warden (Willie). Here we consider pertinent aspects of covert communications that focus on moving such systems closer to implementation. For example, previous studies use the standard discrete-time communication model when analyzing covert communications, since this is commonly assumed without loss of generality in standard communication theory. However, it is not clear that such a model captures the salient aspects of the continuous-time covert communications problem. A power detector that is optimal for the warden in a discrete-time covert communications scenario may not be optimal on a continuous- time model. Thus, it is of interest to consider this more realistic model for physical channels. After analyzing a power optimization problem using the standard discrete-time model, we move to the key part of system implementation: the instantiation in true continuous-time systems of the discrete-time models studied to this point in the literature. A key goal is to examine Willie’s detection capability on a continuous-time model and study how the limits of covert communications change from the discrete-time case. In particular, we show that detectors for Willie can benefit from the continuous-time setting and outperform detectors based on the discrete-time model; not surprisingly, this has a significant impact on the true covert throughput of the system. Nevertheless, we establish constructions such that efficient covert communications can still be achieved in a continuous-time model, and prove the fundamental limit on the covert communication rate. After considering the continuous-time problem in detail, we then turn to addressing another limitation of previous work - the requirement for an intentional jammer to facilitate efficient covert communication. Instead, we consider how to exploit a pre-existing interference source – a radar - to achieve covert communication. We establish a covert communication scheme in such an environment, and analyze the corresponding covert rate. Finally, we consider the use of a detection technique similar to that in the covert communications problem, in the area of quantized signal detection

Optimizing Pilot Overhead for Ultra-Reliable Short-Packet Transmission

In this paper we optimize the pilot overhead for ultra-reliable short-packet transmission and investigate the dependence of this overhead on packet size and error probability. In particular, we consider a point-to-point communication in which one sensor sends messages to a central node, or base-station, over AWGN with Rayleigh fading channel. We formalize the optimization in terms of approximate achievable rates at a given block length, pilot length, and error probability. This leads to more accurate pilot overhead optimization. Simulation results show that it is important to take into account the packet size and the error probability when optimizing the pilot overhead.Comment: To be published on IEEE ICC 2017 Communication Theory Symposiu

Optimization of capacity in non-Gaussian noise models with and without fading channels for sustainable communication systems

The highest rate at which information may be reliably sent via a communication link is known as its capacity. In the case of non-Gaussian noise, the capacity of the channel depends on the specific characteristics of the noise, which can cause severe errors and reduce the reliability of communication systems over a fading channel. The Gaussian mixture impulsive noise model (GMINM), which is a more general and flexible non-Gaussian model for impulsive noise, has been compared in this paper with the Middleton Class-A impulsive noise model (MCAINM) in terms of derived channel capacity normalized by channel bandwidth (C/BW) with and without Rayleigh fading (Rf) channels. It also investigated the trade-off between complexity and accuracy in modeling the impulsive noise using two simplified Middleton Class-A impulsive noise models based on derived C/BW. The derived C/BW of these models under various conditions, such as different signal-to-noise ratios and impulsive noise parameters and models, have been performed and evaluated using two different scenarios: the exact method and the semi-analytical method. When the impulsive noise parameters  and A are both near 0 in GMINM and MCAINM, respectively, the capacity of the impulsive noise channel is found to be equivalent to that of the Gaussian channel sustainable, as shown by the findings based on Monte-Carlo simulations. We have shown that when the impulsive noise decreases, the capacity increases in all models; however, the capacity of Gaussian noise is higher than the capacity of non-Gaussian noise, which in turn is higher than the capacity of non-Gaussian noise over the Rf channel overall values of SNR in dB. Moreover, multi-channel configuration introduces spatial diversity and multiplexing gains that have been proposed to sustainably optimize the ergodic capacity for the challenge case when the channel state information (CSI) is unknown at the transmitter in non-Gaussian noise over Rf channel. In today's rapidly evolving world, sustainable communication systems play a crucial role in ensuring efficient and responsible utilization of resources. As the demand for wireless communication continues to rise, it becomes imperative to optimize the capacity of communication channels, especially in scenarios involving non-Gaussian noise models and fading channels.