Capacity analysis for finite-state Markov mapping of flat-fading channels

被引:30
|
作者
Sadeghi, P [1 ]
Rapajic, P [1 ]
机构
[1] Univ New S Wales, Mobile Commun Grp, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
关键词
channel information capacity; finite-state Markov models; time-varying flat-fading channels;
D O I
10.1109/TCOMM.2005.847161
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, time-varying flat-fading channels are modeled as first-order finite-state Markov channels (FSMC). The effect of this modeling on the channel information capacity is addressed. The approximation accuracy of the first-order memory assumption in the Markov model is validated by comparing the FSMC capacity with the channel capacity assuming perfect state information at the receiver side. The results indicate that the first-order Markovian assumption is accurate for normalized Doppler frequencies f(d)T :less than or similar to 0.01, in amplitude-only quantization of the channel gain for noncoherent binary signaling. In phase-only and joint phase and amplitude quantization of the channel gain for coherent binary signaling, the first-order Markovian assumption is accurate for f(d)T less than or similar to 0.001. Furthermore, the effect of channel quantization thresholds on the FSMC capacity is studied. In high signal-to-noise ratio (SNR) conditions, nonuniform two-level amplitude quantization scheme outperforms equiprobable quantization method by 0.8-1.5 dB.
引用
收藏
页码:833 / 840
页数:8
相关论文
共 50 条
  • [41] Ordering finite-state Markov channels by mutual information
    Eckford, Andrew W.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 911 - 915
  • [42] Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains
    Chen, Jun
    Permuter, Haim
    Weissman, Tsachy
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 57 (08) : 3660 - 3691
  • [43] Capacity of Finite-State Channels With Delayed Feedback
    Huleihel, Bashar
    Sabag, Oron
    Permuter, Haim H.
    Kostina, Victoria
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (01) : 16 - 29
  • [44] A Deterministic Algorithm for the Capacity of Finite-State Channels
    Wu, Chengyu
    Han, Guangyue
    Anantharam, Venkat
    Marcus, Brian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1465 - 1479
  • [45] Ordering Finite-State Markov Channels by Mutual Information
    Eckford, Andrew W.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3081 - 3086
  • [46] Capacity performance analysis of coherent detection in correlated fading channels using finite state Markov models
    Sadeghi, P
    Rapajic, P
    VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 2158 - 2162
  • [47] Optimal Channel Switching and Randomization Over Flat-Fading Channels for Outage Capacity Maximization
    Masrur, Saad
    Gezici, Sinan
    IEEE COMMUNICATIONS LETTERS, 2023, 27 (02) : 630 - 634
  • [48] A LATTICE PRECODING SCHEME FOR FLAT-FADING MIMO CHANNELS
    He, Jin
    Salehi, Masoud
    2008 IEEE MILITARY COMMUNICATIONS CONFERENCE: MILCOM 2008, VOLS 1-7, 2008, : 3310 - 3315
  • [49] Expectation propagation for signal detection in flat-fading channels
    Qi, Y. (yuanqi@media.mit.edu), 1600, IEEE Information Theory Society (Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States):
  • [50] Capacity-Achieving Feedback Schemes for Gaussian Finite-State Markov Channels With Channel State Information
    Liu, Jialing
    Elia, Nicola
    Tatikonda, Sekhar
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) : 3632 - 3650