On the Achievable Rate of Stationary Rayleigh Flat-Fading Channels With Gaussian Inputs

被引:4
作者
Doerpinghaus, Meik [1 ,3 ]
Meyr, Heinrich [2 ]
Mathar, Rudolf [3 ]
机构
[1] Rhein Westfal TH Aachen, Inst Integrated Signal Proc Syst, D-52056 Aachen, Germany
[2] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland
[3] Rhein Westfal TH Aachen, Inst Theoret Informat Technol, D-52056 Aachen, Germany
关键词
Channel capacity; fading channels; Gaussian distributions; information rates; noncoherent; Rayleigh; time selective; CAPACITY; COMMUNICATION; PERFECT;
D O I
10.1109/TIT.2012.2234206
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver side is studied. The law of the channel is presumed to be known to the receiver. For independent identically distributed (i.i.d.) zero-mean proper Gaussian input distributions, the achievable rate is investigated. The main contribution of this paper is the derivation of two new upper bounds on the achievable rate with Gaussian input symbols. One of these bounds is based on the one-step channel prediction error variance but is not restricted to peak power constrained input symbols like known bounds. Moreover, it is shown that Gaussian inputs yield the same pre-log as the peak power constrained capacity. The derived bounds are compared with a known lower bound on the capacity given by Deng and Haimovich and with bounds on the peak power constrained capacity given by Sethuraman et al.. Finally, the achievable rate with i.i.d. Gaussian input symbols is compared to the achievable rate using a coherent detection in combination with a solely pilot-based channel estimation.
引用
收藏
页码:2208 / 2220
页数:13
相关论文
共 50 条
[41]   Signal detection over Rayleigh-fading channels with non-Gaussian noise [J].
Buzzi, S ;
Conte, E ;
Lops, M .
IEE PROCEEDINGS-COMMUNICATIONS, 1997, 144 (06) :381-386
[42]   Achievable Sum-Rate of Multiuser Massive MIMO Downlink in Ricean Fading Channels [J].
Tan, Weiqiang ;
Jin, Shi ;
Wang, Jue ;
Matthaiou, Michail .
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, :1453-1458
[43]   Estimating Information Rates of Bernoulli-Gaussian Impulsive Noise Channels in Rayleigh Fading [J].
Vu, Hung V. ;
Tran, Nghi H. ;
Nguyen, Truyen V. ;
Hariharan, S. I. .
2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, :5859-5864
[44]   Performance Analysis of Distributed MIMO Systems in Rayleigh/Inverse-Gaussian Fading Channels [J].
Gopal, Vetriselvam ;
Matthaiou, Michail ;
Zhong, Caijun .
2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012,
[45]   Achievable Sum Rate Analysis for Moving Relay Assisted Cooperative NOMA System Over Rician Fading Channels [J].
Ahmad, Qazi Saeed ;
Khan, Mohd Javed ;
Khan, Imran Ullah ;
Singh, Indrasen ;
Ahmad, Saif ;
Singh, Ghanshyam .
IEEE ACCESS, 2025, 13 :29778-29788
[46]   Ergodic Secrecy Rate for Gaussian MISO Wiretap Channels with Rician Fading [J].
Li, Jiangyuan ;
Luo, Shuangyu ;
Petropulu, Athina P. .
2010 CONFERENCE RECORD OF THE FORTY FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2010, :295-299
[47]   Low-Complexity Receiver for Wavelet-Filtered M-ary Modulations over Flat-Fading Channels [J].
Silveira, Luiz F. Q. ;
Silveira Junior, Luiz G. de Q. ;
de Assis, Francisco M. ;
Pinto, Ernesto Leite .
2015 SBMO/IEEE MTT-S INTERNATIONAL MICROWAVE AND OPTOELECTRONICS CONFERENCE (IMOC), 2015,
[48]   Block-error rate model for DPSK in Rayleigh- and sub-Rayleigh-fading channels [J].
Subotic, V ;
Primak, S .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (09) :1875-1883
[49]   PREDICTING FLAT-FADING CHANNELS VIA META-LEARNED CLOSED-FORM LINEAR FILTERS AND EQUILIBRIUM PROPAGATION [J].
Park, Sangwoo ;
Simeone, Osvaldo .
2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, :8817-8821
[50]   Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels [J].
Vishwanath, S ;
Jindal, N ;
Goldsmith, AG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2658-2668