English
Related papers

Related papers: The Noncoherent Rician Fading Channel -- Part I : …

200 papers

This paper mainly illustrates the Bit error rate performance of M-ary QAM and M-ary PSK for different values of SNR over Rician Fading channel. A signal experiences multipath propagation in the wireless communication system which causes…

Signal Processing · Electrical Eng. & Systems 2020-05-06 Subrato Bharati , Mohammad Atikur Rahman , Prajoy Podder , Muhammad Ashiqul Islam , Mohammad Hossain

Reliable communication over the discrete-input/continuous-output noncoherent multiple-input multiple-output (MIMO) Rayleigh block fading channel is considered when the signal-to-noise ratio (SNR) per degree of freedom is low. Two key…

Information Theory · Computer Science 2008-09-22 Shivratna Giri Srinivasan , Mahesh K. Varanasi

The capacity-achieving input covariance matrices for coherent block-fading correlated MIMO Rician channels are determined. In this case, no closed-form expressions for the eigenvectors of the optimum input covariance matrix are available.…

Probability · Mathematics 2011-06-07 Julien Dumont , W. Hachem , Samson Lasaulce , Philippe Loubaton , Jamal Najim

Accurate fading characterization and channel capacity determination are of paramount importance in both conventional and emerging communication systems. The present work addresses the nonlinearity of the propagation medium and its effects…

Information Theory · Computer Science 2016-12-30 Paschalis C. Sofotasios , Sami Muhaidat , Mikko Valkama , Mounir Ghogho , George K. Karagiannidis

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

The impact of phase fading on the classical Costa dirty paper coding channel is studied. We consider a variation of this channel model in which the amplitude of the interference sequence is known at the transmitter while its phase is known…

Information Theory · Computer Science 2014-01-20 Stefano Rini , Shlomo Shamai

In this paper, fading Gaussian multiuser channels are considered. If the channel is perfectly known to the transmitter, capacity has been established for many cases in which the channels may satisfy certain information theoretic orders such…

Information Theory · Computer Science 2018-10-04 Pin-Hsun Lin , Eduard A. Jorswieck , Rafael F. Schaefer , Martin Mittelbach , Carsten R. Janda

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…

Information Theory · Computer Science 2016-09-29 Borzoo Rassouli , Bruno Clerckx

This paper studies an $n$-dimensional additive Gaussian noise channel with a peak-power-constrained input. It is well known that, in this case, when $n=1$ the capacity-achieving input distribution is discrete with finitely many mass points,…

Information Theory · Computer Science 2019-11-18 Alex Dytso , Semih Yagli , H. Vincent Poor , Shlomo Shamai

In this paper, the capacity and energy efficiency of training-based communication schemes employed for transmission over a-priori unknown Rayleigh block fading channels are studied. In these schemes, periodically transmitted training…

Information Theory · Computer Science 2007-12-20 Mustafa Cenk Gursoy

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential…

Information Theory · Computer Science 2016-11-17 Yingbin Liang , H. Vincent Poor , Shlomo Shamai

In this paper, we study the fundamental limits of simultaneous information and power transfer over a Rayleigh fading channel, where the channel input is constrained to peak-power constraints that vary in each channel use by taking into…

Information Theory · Computer Science 2021-02-03 Nizar Khalfet , Ioannis Krikidis

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

Information Theory · Computer Science 2016-11-18 Tobias Koch , Amos Lapidoth

This paper considers a discrete time-Poisson noise channel which is used to model pulse-amplitude modulated optical communication with a direct-detection receiver. The goal of this paper is to obtain insights into the capacity and the…

Information Theory · Computer Science 2021-11-23 Luca Barletta , Alex Dytso

The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic…

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

This paper considers point to point secure communication over flat fading channels under an outage constraint. More specifically, we extend the definition of outage capacity to account for the secrecy constraint and obtain sharp…

Information Theory · Computer Science 2011-12-14 Onur Gungor , Jian Tan , C. Emre Koksal , Hesham El Gamal , Ness B. Shroff

Fundamental limits of the cognitive interference channel (CIC) with two pairs of transmitter-receiver has been under exploration for several years. In this paper, we study the discrete memoryless cognitive interference channel (DM-CIC) in…

Information Theory · Computer Science 2012-10-09 Mojtaba Vaezi

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

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