English
Related papers

Related papers: On the Fading Number of Multiple-Input Single-Outp…

200 papers

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

The optical fiber multiple-input multiple-output (MIMO) channel with intensity modulation and direct detection (IM/DD) per spatial path is treated. The spatial dimensions represent the multiple modes employed for transmission and the…

Information Theory · Computer Science 2022-01-28 Metodi P. Yankov , Francesco Da Ros , Søren Forchhammer , Lars Gruner-Nielsen

Multimode/multicore fibers are expected to provide an attractive solution to overcome the capacity limit of the current optical communication system. In the presence of high cross-talk between modes/cores, the squared singular values of the…

Information Theory · Computer Science 2020-06-11 Amor Nafkha , Nizar Demni

We consider spatially-constrained apertures of rectangular symmetry and aim to retrieve the limit to the average number of spatial degrees of freedom (DoF), obtained elsewhere through different analyses and tools. Unlike prior works, we use…

Information Theory · Computer Science 2020-02-28 Andrea Pizzo , Thomas L. Marzetta , Luca Sanguinetti

We consider the problem of quantifying the Pareto optimal boundary in the achievable rate region over multiple-input single-output (MISO) interference channels, where the problem boils down to solving a sequence of convex feasibility…

Information Theory · Computer Science 2015-05-20 Jiaming Qiu , Rui Zhang , Zhi-Quan Luo , Shuguang Cui

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial…

Information Theory · Computer Science 2016-11-17 Parastoo Sadeghi , Pascal O. Vontobel , Ramtin Shams

The operational capacity of Gaussian MIMO channels with memory was obtained by Brandenburg and Wyner in [9] under certain mild assumptions on the channel impulse response and its noise covariance matrix, which essentuially require channel…

Information Theory · Computer Science 2022-05-11 Sergey Loyka , Charalambos D. Charalambous

The capacity of fading channels under peak and average power constraints in the low-SNR regime is investigated. We show that the capacity scales essentially as ${C \approx A \ \text{SNR} \int_{1- \frac{1}{A}}^1 F^{-1}\left(t\right)dt}$,…

Signal Processing · Electrical Eng. & Systems 2018-11-21 Longguang Li , Lokman Sboui , Zouheir Rezki , Mohamed-Slim Alouini

This is the second part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. In the first part, we studied the scenario with a fast fading channel, and found Nash equilibria of mixed…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei , Rajgopal Kannan

This paper derives upper and lower bounds on the capacity of the multiple-input single-output free-space optical intensity channel with signal-independent additive Gaussian noise subject to both an average-intensity and a peak-intensity…

Information Theory · Computer Science 2017-10-26 Stefan M. Moser , Ligong Wang , Michèle Wigger

We propose a technique to derive upper bounds on Gallager's cost-constrained random coding exponent function. Applying this technique to the non-coherent peak-power or average-power limited discrete time memoryless Ricean fading channel, we…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Natalia Miliou

This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derivation follows from a generalization of the techniques developed by Kramer and by Etkin et al…

Information Theory · Computer Science 2016-11-17 Daniela Tuninetti

The capacity of the point-to-point vector Gaussian channel under the peak power constraint is not known in general. This paper considers a simpler scenario in which the input signal vector is forced to have a constant envelope (or norm).…

Information Theory · Computer Science 2016-05-13 Borzoo Rassouli , Bruno Clerckx

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-17 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

This paper investigates double RIS-assisted MIMO communication systems over Rician fading channels with finite scatterers, spatial correlation, and the existence of a double-scattering link between the transceiver. First, the statistical…

Information Theory · Computer Science 2023-09-11 Ha An Le , Trinh Van Chien , Van Duc Nguyen , Wan Choi

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

We study a multiple-input multiple-output (MIMO) multiple access channel (MAC) from several multi-antenna transmitters to a multi-antenna receiver. The fading channels between the transmitters and the receiver are modeled by random…

Information Theory · Computer Science 2011-05-04 Jakob Hoydis , Romain Couillet , Merouane Debbah

We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the…

Information Theory · Computer Science 2016-11-17 Neri Merhav

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

Information Theory · Computer Science 2009-01-01 Amin Jafarian , Sriram Vishwanath

This paper studies the capacity of a general multiple-input multiple-output (MIMO) free-space optical intensity channel under a per-input-antenna peak-power constraint and a total average-power constraint over all input antennas. The focus…

Information Theory · Computer Science 2020-02-04 Longguang Li , Stefan M. Moser , Ligong Wang , Michèle Wigger
‹ Prev 1 3 4 5 6 7 10 Next ›