Optimal channel ranking using multiple channel permutation for QRM-MLD

Ye Tiant, Takumi Saito, C. Ann
{"title":"Optimal channel ranking using multiple channel permutation for QRM-MLD","authors":"Ye Tiant, Takumi Saito, C. Ann","doi":"10.1109/TENCON.2016.7848412","DOIUrl":null,"url":null,"abstract":"Recently, high quality data transmission system has been widely researched. To achieve the better BER performance, several detection schemes in Multiple-Input Multiple-Output (MIMO) system have been studied. In the MIMO system, Maximum-Likelihood Detection (MLD) yields the optimal BER performance. However, it requires enormous computational complexity. Regarding the problem of actual implementation, Maximum-Likelihood (ML) Detection with QR Decomposition and M-algorithm (QRM-MLD) has been proposed for reducing the system complexity. On the other hand, this detection shows a little worse BER performance than MLD. Since QRM-MLD is used with a fewer symbol replica candidates than MLD, the error in the former detection stage causes an increase of the error in the latter stage. In this paper, we propose an optimal permutation of the channel matrix using QR Decomposition. The proposed scheme arranges channel matrix optimally, thereby absolute values of the diagonal components in upper triangular matrix are arranged ascending order. From the simulation results, the proposed scheme can improve the BER performance compared with the conventional method.","PeriodicalId":246458,"journal":{"name":"2016 IEEE Region 10 Conference (TENCON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Region 10 Conference (TENCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2016.7848412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Recently, high quality data transmission system has been widely researched. To achieve the better BER performance, several detection schemes in Multiple-Input Multiple-Output (MIMO) system have been studied. In the MIMO system, Maximum-Likelihood Detection (MLD) yields the optimal BER performance. However, it requires enormous computational complexity. Regarding the problem of actual implementation, Maximum-Likelihood (ML) Detection with QR Decomposition and M-algorithm (QRM-MLD) has been proposed for reducing the system complexity. On the other hand, this detection shows a little worse BER performance than MLD. Since QRM-MLD is used with a fewer symbol replica candidates than MLD, the error in the former detection stage causes an increase of the error in the latter stage. In this paper, we propose an optimal permutation of the channel matrix using QR Decomposition. The proposed scheme arranges channel matrix optimally, thereby absolute values of the diagonal components in upper triangular matrix are arranged ascending order. From the simulation results, the proposed scheme can improve the BER performance compared with the conventional method.
基于多信道排列的QRM-MLD最优信道排序
近年来,高质量的数据传输系统得到了广泛的研究。为了获得更好的误码率性能,研究了多输入多输出(MIMO)系统中的几种检测方案。在MIMO系统中,最大似然检测(MLD)可以获得最佳的误码率性能。然而,它需要巨大的计算复杂度。针对实际实现问题,提出了基于QR分解和m算法的最大似然(ML)检测(QRM-MLD)来降低系统复杂度。另一方面,该检测的误码率性能略低于MLD。由于QRM-MLD使用的符号副本候选数比MLD少,因此前一阶段的错误会导致后一阶段的错误增加。本文提出了一种基于QR分解的信道矩阵最优排列方法。该方案对信道矩阵进行最优排列,从而使上三角矩阵对角分量的绝对值按升序排列。仿真结果表明,与传统方法相比,该方案可以提高误码率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信