J. Xue, Md. Zahurul I. Sarkar, T. Ratnarajah, C. Zhong
{"title":"瑞利衰落积MIMO信道的误差指数","authors":"J. Xue, Md. Zahurul I. Sarkar, T. Ratnarajah, C. Zhong","doi":"10.1109/ISIT.2012.6283835","DOIUrl":null,"url":null,"abstract":"Along with the channel capacity, the error exponent is one of the most important information theoretic measures of reliability, as it sets ultimate bounds on the performance of communication systems employing codes of finite complexity. In this paper, we derive the closed-form expressions for the Gallager's random coding and expurgated error exponents for Rayleigh fading product multiple-input multiple-output (MIMO) channels under the assumption that there is no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. From the derived analytical expressions, we get insight into an elementary tradeoff between the communication reliability and information rate for the Rayleigh fading product MIMO channels. Moreover, we can easily compute the necessary codeword length without the extensive Monte-carlo simulation to achieve predefined error probability at a given rate below the channel capacity. In addition, we derive the exact closed-form expressions for the ergodic capacity and cutoff rate based on easily computable Meijer G-function. The closed-form expressions for the error exponents, ergodic capacity and cutoff rate have also been derived for Rayleigh fading keyhole MIMO channels as the example of special case.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Error exponents for Rayleigh fading product MIMO channels\",\"authors\":\"J. Xue, Md. Zahurul I. Sarkar, T. Ratnarajah, C. Zhong\",\"doi\":\"10.1109/ISIT.2012.6283835\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Along with the channel capacity, the error exponent is one of the most important information theoretic measures of reliability, as it sets ultimate bounds on the performance of communication systems employing codes of finite complexity. In this paper, we derive the closed-form expressions for the Gallager's random coding and expurgated error exponents for Rayleigh fading product multiple-input multiple-output (MIMO) channels under the assumption that there is no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. From the derived analytical expressions, we get insight into an elementary tradeoff between the communication reliability and information rate for the Rayleigh fading product MIMO channels. Moreover, we can easily compute the necessary codeword length without the extensive Monte-carlo simulation to achieve predefined error probability at a given rate below the channel capacity. In addition, we derive the exact closed-form expressions for the ergodic capacity and cutoff rate based on easily computable Meijer G-function. The closed-form expressions for the error exponents, ergodic capacity and cutoff rate have also been derived for Rayleigh fading keyhole MIMO channels as the example of special case.\",\"PeriodicalId\":300161,\"journal\":{\"name\":\"2012 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2012.6283835\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2012.6283835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
摘要
与信道容量一样,误差指数是衡量可靠性的最重要的信息论指标之一,因为它为使用有限复杂度码的通信系统的性能设定了极限。本文推导了Rayleigh衰落积多输入多输出(MIMO)信道在发送端不存在信道状态信息(CSI)、接收端不存在完美CSI的情况下,加拉格随机编码和剔除误差指数的封闭表达式。从导出的解析表达式中,我们深入了解了瑞利衰落积MIMO信道通信可靠性和信息速率之间的基本权衡。此外,我们可以很容易地计算必要的码字长度,而无需广泛的蒙特卡罗模拟,以在低于信道容量的给定速率下实现预定义的错误概率。此外,基于易于计算的Meijer g -函数,我们导出了遍历容量和截止率的精确封闭表达式。以特殊情况为例,导出了瑞利衰落锁孔MIMO信道的误差指数、遍历容量和截止率的封闭表达式。
Error exponents for Rayleigh fading product MIMO channels
Along with the channel capacity, the error exponent is one of the most important information theoretic measures of reliability, as it sets ultimate bounds on the performance of communication systems employing codes of finite complexity. In this paper, we derive the closed-form expressions for the Gallager's random coding and expurgated error exponents for Rayleigh fading product multiple-input multiple-output (MIMO) channels under the assumption that there is no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. From the derived analytical expressions, we get insight into an elementary tradeoff between the communication reliability and information rate for the Rayleigh fading product MIMO channels. Moreover, we can easily compute the necessary codeword length without the extensive Monte-carlo simulation to achieve predefined error probability at a given rate below the channel capacity. In addition, we derive the exact closed-form expressions for the ergodic capacity and cutoff rate based on easily computable Meijer G-function. The closed-form expressions for the error exponents, ergodic capacity and cutoff rate have also been derived for Rayleigh fading keyhole MIMO channels as the example of special case.