English
Related papers

Related papers: Capacity Analysis for Continuous Alphabet Channels…

200 papers

We use white Gaussian noise as a test signal for single-mode and multimode transmission links and estimate the link capacity based on a calculation of mutual information. We also extract the complex amplitude channel estimations and…

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent uniformly distributed (i.u.d.) inputs and computing lower bounds on the mutual information between the input and…

Information Theory · Computer Science 2015-03-17 Mojtaba Rahmati , Tolga M. Duman

Interference between nodes directly limits the capacity of mobile ad hoc networks. This paper focuses on spatial interference cancelation with perfect channel state information (CSI), and analyzes the corresponding network capacity.…

Information Theory · Computer Science 2016-11-17 Kaibin Huang , Jeffrey G. Andrews , Robert W. Heath, , Dongning Guo , Randall A. Berry

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

Information Theory · Computer Science 2013-02-15 Reza K. Farsani

This paper investigates the capacity scaling of multicell massive MIMO systems in the presence of spatially correlated fading. In particular, we focus on the strong spatial correlation regimes where the covariance matrix of each user…

Information Theory · Computer Science 2019-12-10 Junyoung Nam , Giuseppe Caire , Merouane Debbah , H. Vincent Poor

Binary-input memoryless channels with a runlength constrained input are considered. Upper bounds to the capacity of such noisy runlength constrained channels are derived using the dual capacity method with Markov test distributions…

Information Theory · Computer Science 2016-11-17 Andrew Thangaraj

The capacity of a Multiple-Input Multiple-Output (MIMO) channel in which the antenna outputs are processed by an analog linear combining network and quantized by a set of threshold quantizers is studied. The linear combining weights and…

Information Theory · Computer Science 2018-06-06 Abbas Khalili , Stefano Rini , Luca Barletta , Elza Erkip , Yonina C. Eldar

To study the effect of lack of up-to-date channel state information at the transmitters (CSIT), we consider two-user binary fading interference channels with Delayed-CSIT. We characterize the capacity region for such channels under…

Information Theory · Computer Science 2016-11-17 Alireza Vahid , Mohammad Ali Maddah-Ali , Amir Salman Avestimehr

The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analog-to-digital converter (ADC). It is proved that the…

Information Theory · Computer Science 2018-10-17 Borzoo Rassouli , Morteza Varasteh , Deniz Gunduz

Reliability is becoming increasingly important for many applications envisioned for future wireless systems. A technology that could improve reliability in these systems is massive MIMO (Multiple-Input Multiple-Output). One reason for this…

Signal Processing · Electrical Eng. & Systems 2020-04-16 Sara Gunnarsson , José Flordelis , Liesbet Van der Perre , Fredrik Tufvesson

We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel…

Information Theory · Computer Science 2013-05-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case.…

Information Theory · Computer Science 2012-09-06 Fangfang Zhu , Xiaohu Shang , Biao Chen , H. Vincent Poor

The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions for the mutual information between the output and the input of this channel when the input magnitude distribution is…

Information Theory · Computer Science 2007-07-16 Sebastien de la Kethulle de Ryhove , Ninoslav Marina , Geir E. Oien

The capacity regions of multiple-input multiple-output Gaussian Z-interference channels are established for the very strong interference and aligned strong interference cases. The sum-rate capacity of such channels is established under…

Information Theory · Computer Science 2009-11-25 Xiaohu Shang , Biao Chen , Gerhard Kramer , H. Vincent Poor

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…

Information Theory · Computer Science 2015-03-19 Daniel Zahavi , Ron Dabora

In this work, for the first time, we tackle channel estimation design with pilots in the context of covert wireless communication. Specifically, we consider Rayleigh fading for the communication channel from a transmitter to a receiver and…

Information Theory · Computer Science 2019-08-02 Tingzhen Xu , Linlin Sun , Shihao Yan , Jinsong Hu , Feng Shu

The use of multi-antenna arrays in both transmission and reception has been shown to dramatically increase the throughput of wireless communication systems. As a result there has been considerable interest in characterizing the ergodic…

Information Theory · Computer Science 2007-07-16 Aris L. Moustakas , Steven H. Simon

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the support of the fading-process power spectral density (PSD)…

Information Theory · Computer Science 2012-06-29 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

This paper investigates the capacity of compound state-dependent channels with non-causal state information available at only the transmitter. A new lower bound on the capacity of this class of channels is derived. This bound is shown to be…

Information Theory · Computer Science 2010-04-29 Pablo Piantanida , Shlomo Shamai
‹ Prev 1 4 5 6 7 8 10 Next ›