RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2015 Volume 51, Issue 1, Pages 3–22 (Mi ppi2157)

This article is cited in 4 papers

Information Theory

Error exponents for multi-keyhole MIMO channels

J. Xuea, T. Ratnarajaha, C. Zhongbc

a Institute for Digital Communications, School of Engineering, The University of Edinburgh, Edinburgh, UK
b National Mobile Communications Research Laboratory, Southeast University, Nanjing, China
c Institute of Information and Communication Engineering, Zhejiang University, Zhejiang, China

Abstract: Along with the channel capacity, the error exponent is one of the most important information-theoretic measures of reliability, because it sets ultimate bounds on the performance of communication systems employing codes of finite complexity. In this paper, we derive closed-form expressions for the Gallager random coding and expurgated error exponents for multi-keyhole multiple-input multiple-output (MIMO) channels, which provide insights into a fundamental tradeoff between the communication reliability and information rate. We investigate the effect of keyholes on the error exponents and cutoff rate. Moreover, without an extensive Monte-Carlo simulation we can easily compute the codeword length necessary to achieve a predefined error probability at a given rate, which quantifies the effects of the number of antennas, channel coherence time, and the number of keyholes. In addition, we derive exact closed-form expressions for the ergodic capacity and cutoff rate based on the easily computable Meijer $G$-function. Finally, we extend our study to Rayleigh-product MIMO channels and keyhole MIMO channels.

UDC: 621.391.1+519.72

Received: 27.01.2014
Revised: 29.11.2014


 English version:
Problems of Information Transmission, 2015, 51:1, 1–19

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025