English
Related papers

Related papers: Noncoherent Capacity of Underspread Fading Channel…

200 papers

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

Capacity bounds for waveform channels under square-law detection of time-limited complex-valued signals are derived. The upper bound is the capacity of the channel under (complex-valued) coherent detection. The lower bound is one bit less,…

Information Theory · Computer Science 2021-05-31 Amir Tasbihi , Frank R. Kschischang

Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender two-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity…

Quantum Physics · Physics 2016-11-15 Masahiro Takeoka , Kaushik P. Seshadreesan , Mark M. Wilde

Statistical prior channel knowledge, such as the wide-sense-stationary-uncorrelated-scattering (WSSUS) property, and additional side information both can be used to enhance physical layer applications in wireless communication. Generally,…

Signal Processing · Electrical Eng. & Systems 2024-06-07 Benedikt Böck , Michael Baur , Nurettin Turan , Dominik Semmler , Wolfgang Utschick

Optimal link adaption to the scattering function of wide sense stationary uncorrelated mobile communication channels is still an unsolved problem despite its importance for next-generation system design. In multicarrier transmission such…

Information Theory · Computer Science 2007-10-23 Peter Jung , Gerhard Wunder

The capacity of a discrete-time channel with correlated phase noises is investigated. In particular, the electro-optic frequency comb system is considered, where the phase noise of each subchannel is a combination of two independent Wiener…

Information Theory · Computer Science 2025-07-15 Mohammad Farsi , Hamdi Joudeh , Gabriele Liga , Alex Alvarado , Magnus Karlsson , Erik Agrell

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

Information Theory · Computer Science 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the…

Information Theory · Computer Science 2008-05-15 Jaspreet Singh , Onkar Dabeer , Upamanyu Madhow

The single-letter characterisation of the entanglement-assisted capacity of a quantum channel is one of the seminal results of quantum information theory. In this paper, we consider a modified communication scenario in which the receiver is…

Quantum Physics · Physics 2024-09-16 Kaiyuan Ji , Bartosz Regula , Mark M. Wilde

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

An upper bound on the capacity of multiple-input multiple-output (MIMO) Gaussian fading channels is derived under peak amplitude constraints. The upper bound is obtained borrowing concepts from convex geometry and it extends to MIMO…

Information Theory · Computer Science 2021-11-29 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

In traditional spread-spectrum techniques, a wideband transmit signal is obtained by modulating a wideband carrier by a narrowband signal containing a relatively low-rate message. In the receiver, the respective demodulation/despreading…

Signal Processing · Electrical Eng. & Systems 2020-08-17 Alexei V. Nikitin , Ruslan L. Davidchack

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

Information Theory · Computer Science 2015-08-21 Meryem Benammar , Pablo Piantanida

In this paper, we study the capacity and degree-of-freedom (DoF) scaling for the continuous-time amplitude limited AWGN channels in radio frequency (RF) and intensity modulated optical communication (OC) channels. More precisely, we study…

Information Theory · Computer Science 2016-05-10 Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

In the setting of a Gaussian channel without power constraints, proposed by Poltyrev, the codewords are points in an n-dimensional Euclidean space (an infinite constellation) and the tradeoff between their density and the error probability…

Information Theory · Computer Science 2013-02-28 Amir Ingber , Ram Zamir , Meir Feder

We consider the discrete memoryless asymmetric 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…

Information Theory · Computer Science 2020-08-11 Yasutada Oohama
‹ Prev 1 4 5 6 7 8 10 Next ›