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 条
  • [21] Capacity Analysis of Time-Varying Flat-Fading Channels Using Particle Methods
    Taylor, Stephen
    Sadeghi, Parastoo
    2007 AUSTRALASIANTELECOMMUNICATION NETWORKS AND APPLICATIONS CONFERENCE, 2007, : 299 - 304
  • [22] Window-based expectation propagation for adaptive signal detection in flat-fading channels
    Qi, Yuan
    Minka, Thomas P.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (01) : 348 - 355
  • [23] Secrecy Rate for MISO Rayleigh Fading Channels with Relative Distance of Eavesdropper
    Chang, Namseok
    Chae, Chan-Byoung
    Ha, Jeongseok
    Kang, Joonhyuk
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (09) : 1408 - 1411
  • [24] Achievable Rate of a Two-Way Relay Channel with Structured Code under Rayleigh Fading
    Sagar, Youvaraj T.
    Yang, Jie
    Kwon, Hyuck M.
    Nam, Wooseok
    2014 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2014, : 644 - 648
  • [25] Multiuser detection in flat fading non-Gaussian channels
    Poor, HV
    Tanda, M
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (11) : 1769 - 1777
  • [26] On the analysis of achievable rate for NOMA networks with cooperative users over κ-μ shadowed fading channels
    Bilim, Mehmet
    Kapucu, Nuri
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (12)
  • [27] On the Capacity of Bernoulli-Gaussian Impulsive Noise Channels in Rayleigh Fading
    Vu, Hung V.
    Tran, Nghi H.
    Nguyen, Truyen V.
    Hariharan, S. I.
    2013 IEEE 24TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2013, : 1281 - 1285
  • [28] On the Achievable Rate of MISO Fading Channels With Instantaneous CSI Only at the Transmitter
    Khormuji, Majid Nasiri
    Wang, Peng
    Emadi, Mohammad Javad
    Popovic, Branislav M.
    IEEE COMMUNICATIONS LETTERS, 2020, 24 (12) : 2710 - 2714
  • [29] Achievable Rate and Power Allocation for Single-Relay AF Systems Over Rayleigh Fading Channels at High and Low SNRs
    Rodriguez, Leonardo Jimenez
    Tran, Nghi H.
    Le-Ngoc, Tho
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2014, 63 (04) : 1726 - 1739
  • [30] Error Probability Analysis and Applications of Amplitude-Coherent Detection in Flat Rayleigh Fading Channels
    Al-Dweik, Arafat
    Iraqi, Youssef
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (05) : 2235 - 2244