Efficient Channel Column Sorting Method based on Householder Transformation for QRM-MLD

Shoichi Higuchi, K. Maruta, C. Ahn
{"title":"Efficient Channel Column Sorting Method based on Householder Transformation for QRM-MLD","authors":"Shoichi Higuchi, K. Maruta, C. Ahn","doi":"10.1109/CCE.2018.8465727","DOIUrl":null,"url":null,"abstract":"In recent years, a high speed data transmission system has been widely researched. Multiple-Input and Multiple-Output (MIMO) systems are one of the key technologies to achieve a high speed data transmission. To realize superior bit error rate (BER) performance, several detection methods for MIMO system have been proposed. QR decomposition with M-algorithm (QRM-MLD) has been proposed to achieve the superior BER performance like Maximum Likelihood Detection (MLD) with low computational complexity. Since the signal detection of QRM-MLD has carried on serial processing, the detection order is crucial to improve the detection performance. To mitigate the detection error in the previous stage, Sorted QR decomposition (SQRD) has been proposed. To implement SQRD, we need an accurate channel column order. However, the complexity and processing delay are considerable works. To solve these problems, we propose a novel channel column sorting method to reduce the calculation complexity and latency. From the simulation results, the proposed scheme achieves superior BER performance with low complexity and latency.","PeriodicalId":118716,"journal":{"name":"2018 IEEE Seventh International Conference on Communications and Electronics (ICCE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Seventh International Conference on Communications and Electronics (ICCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCE.2018.8465727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In recent years, a high speed data transmission system has been widely researched. Multiple-Input and Multiple-Output (MIMO) systems are one of the key technologies to achieve a high speed data transmission. To realize superior bit error rate (BER) performance, several detection methods for MIMO system have been proposed. QR decomposition with M-algorithm (QRM-MLD) has been proposed to achieve the superior BER performance like Maximum Likelihood Detection (MLD) with low computational complexity. Since the signal detection of QRM-MLD has carried on serial processing, the detection order is crucial to improve the detection performance. To mitigate the detection error in the previous stage, Sorted QR decomposition (SQRD) has been proposed. To implement SQRD, we need an accurate channel column order. However, the complexity and processing delay are considerable works. To solve these problems, we propose a novel channel column sorting method to reduce the calculation complexity and latency. From the simulation results, the proposed scheme achieves superior BER performance with low complexity and latency.
基于户主变换的QRM-MLD高效通道柱分选方法
近年来,高速数据传输系统得到了广泛的研究。多输入多输出(MIMO)系统是实现高速数据传输的关键技术之一。为了实现更好的误码率性能,提出了几种MIMO系统的检测方法。基于m -算法的QR分解(QRM-MLD)可以获得与最大似然检测(MLD)一样优异的误码率性能和较低的计算复杂度。由于QRM-MLD的信号检测进行了串行处理,因此检测顺序对提高检测性能至关重要。为了减轻前一阶段的检测误差,提出了排序QR分解(SQRD)方法。为了实现SQRD,我们需要一个准确的通道列顺序。然而,复杂性和处理延迟是相当大的工作。为了解决这些问题,我们提出了一种新的通道列排序方法来降低计算复杂度和延迟。仿真结果表明,该方案具有较低的误码率和较低的时延。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信