信号处理
信號處理
신호처리
SIGNAL PROCESSING
2014年
11期
1292-1297
,共6页
多输入多输出%迫整接收机%格基规约%误比特率性能
多輸入多輸齣%迫整接收機%格基規約%誤比特率性能
다수입다수출%박정접수궤%격기규약%오비특솔성능
multiple-input multiple-output%integer forcing receiver%lattice reduction%bit-error-ratio performance
针对单用户多输入多输出（MIMO）无线信号传输系统，本文采用一种低复杂度高性能的线性接收机结构—迫整接收机（Integer-Forcing），并在此基础上提出一种利用成对列变换依次减小格基的模长的格基规约（Lattice Reduction）算法—排序格基规约。迫整接收机利用整数域的闭环特性以及最大化每层信干噪比（SINR）的优化技术，可以用较低的复杂度获得较好的性能。鉴于最大化各层信干噪比等价于格理论中的最短独立向量组（SIVP）问题，本文提出的排序格基规约算法以较小的正交性能损失作为代价，有效的降低了解决该问题的复杂度，特别适合中大规模的MIMO系统。仿真实验和分析表明，不仅在格基模长性能上优于经典的LLL算法，而且具有更快的运算速度；同时，基于排序格基规约的迫整接收机显示出优于大部分线性接收机，且接近最大似然（ML）接收机的误比特率（BER）性能。
針對單用戶多輸入多輸齣（MIMO）無線信號傳輸繫統，本文採用一種低複雜度高性能的線性接收機結構—迫整接收機（Integer-Forcing），併在此基礎上提齣一種利用成對列變換依次減小格基的模長的格基規約（Lattice Reduction）算法—排序格基規約。迫整接收機利用整數域的閉環特性以及最大化每層信榦譟比（SINR）的優化技術，可以用較低的複雜度穫得較好的性能。鑒于最大化各層信榦譟比等價于格理論中的最短獨立嚮量組（SIVP）問題，本文提齣的排序格基規約算法以較小的正交性能損失作為代價，有效的降低瞭解決該問題的複雜度，特彆適閤中大規模的MIMO繫統。倣真實驗和分析錶明，不僅在格基模長性能上優于經典的LLL算法，而且具有更快的運算速度；同時，基于排序格基規約的迫整接收機顯示齣優于大部分線性接收機，且接近最大似然（ML）接收機的誤比特率（BER）性能。
침대단용호다수입다수출（MIMO）무선신호전수계통，본문채용일충저복잡도고성능적선성접수궤결구—박정접수궤（Integer-Forcing），병재차기출상제출일충이용성대렬변환의차감소격기적모장적격기규약（Lattice Reduction）산법—배서격기규약。박정접수궤이용정수역적폐배특성이급최대화매층신간조비（SINR）적우화기술，가이용교저적복잡도획득교호적성능。감우최대화각층신간조비등개우격이론중적최단독립향량조（SIVP）문제，본문제출적배서격기규약산법이교소적정교성능손실작위대개，유효적강저료해결해문제적복잡도，특별괄합중대규모적MIMO계통。방진실험화분석표명，불부재격기모장성능상우우경전적LLL산법，이차구유경쾌적운산속도；동시，기우배서격기규약적박정접수궤현시출우우대부분선성접수궤，차접근최대사연（ML）접수궤적오비특솔（BER）성능。
Considering a single-user multiple-input multiple-output (MIMO)wireless system,this paper puts forward a novel sorted lattice reduction (SLR)algorithm for integer forcing (IF)linear receiver,which reduces the 2-norm of each lattice basis using a series of column-addition operations.The lower complexity and excellent performance of IF receivers are from the closed-loop property of integer domain and the optimization techniques of maximizing the signal-to-interference-noise-ratio (SINR)of each layer,which is equivalent to a famous NP-Hard problem,referred to as shortest independent vector problem (SIVP),in lattice theory.Thesorted lattice reduction algorithm in this paper can effectively alleviate the complexity of this problem in spite of a little orthogonality performance loss,which goes especially well with large MIMO systems.Computer simulations show that the proposed algorithm not only outperforms the famous LLL algorithm in terms of the length of the maximal lattice basis,but also has a relative lower practical complexity.Moreover,the integer forcing re-ceiver based on the sorted lattice reduction algorithm defeats most linear receivers in terms of the bit-error-ratio (BER)per-formance and is closed to that of the optimal maximal likelihood (ML)receiver.
