Entropy of general gaussian distributions and MIMO channel capacity maximizing precoder and decoder

被引:0
作者
Tuan, H. D. [1 ]
Pham, D. H. [1 ]
Vo, B. [2 ]
Nguyen, T. Q. [3 ]
机构
[1] Univ New S Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
[2] Univ Melbourne, Dept EEE, Melbourne, Vic 3052, Australia
[3] Univ Calif San Diego, Dept ECE, San Diego, CA 92093 USA
来源
2007 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL III, PTS 1-3, PROCEEDINGS | 2007年
关键词
mIMO system; entropy; mutual information; precoder and decoder;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
Exploiting channel state information at the transmitter and receiver to design an optimal linear precoder and decoder for a multiple-input multiple-output (MIMO) communication system is an active research area. The design is often based on the information rate criterion, that is to design the precoder and decoder such that the system capacity is maximized, subject to the average transmit power constraint. Although such an optimization problem has been considered intensively and there have been numerous proposals so far, they are not rigorously correct. We propose a mathematically rigorous framework for solving this optimization problem. Our proposed solution is applicable to both MIMO flat fading and frequency selective fading channels. Simulations verify the theoretical analysis.
引用
收藏
页码:325 / +
页数:2
相关论文
共 3 条
  • [1] An MMSE Approach to the Secrecy Capacity of the MIMO Gaussian Wiretap Channel
    Bustin, Ronit
    Liu, Ruoheng
    Poor, H. Vincent
    Shamai , Shlomo
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2602 - +
  • [2] An MMSE Approach to the Secrecy Capacity of the MIMO Gaussian Wiretap Channel
    Bustin, Ronit
    Liu, Ruoheng
    Poor, H. Vincent
    Shamai , Shlomo
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2009,
  • [3] The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel
    Ekrem, Ersen
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2083 - 2114