大规模MIMO系统上行链路中改进的混合迭代检测算法

信号检测的任务是通过基站接收到的信号来估计出用户的发送信号。在大规模MIMO系统上行中,基于最速下降（Steepest descent,SD）算法和高斯-赛得尔（Gauss Seidel,GS）迭代的混合迭代（SDGS）算法解决了最小均方误差（Minimum mean square error,MMSE）算法中矩阵求逆的运算问题,将复杂度从O(K³)降为O(K²)（其中K为用户数）。同时,SD算法有很好收敛方向的特性加快了检测速度。本文基于SDGS算法,改进了其中对数似然比（Log likelihood ratio,LLR）的计算,在保持低复杂度（O(K²)）的同时,改善检测性能。仿真结果表明,经过几次迭代后,改进后的混合迭代算法收敛较快并接近MMSE检测性能。     

全双工MIMO中继系统中基于最大速率的波束成形算法

全双工系统能实现在同一时隙与同一频率传输数据,相比于半双工系统能大大地提升数据吞吐量和频谱效率。为了进一步提高全双工多输入多输出(Multi-input and multi-output,MIMO)中继系统传输速率,本文基于放大转发(Amplify-and-forward,AF)传输模式,在全双工双向中继系统中引入梯度下降算法,将用户发送端、接收端波束成形与中继端波束成形矩阵相结合设计一种最大化速率的交替迭代算法,并构造出一种最小均方误差（Minimum mean square error,MMSE）迭代算法作为初始条件,在此基础上推导出中继接收端与发射端的波束成形矩阵表达式。仿真结果表明,本文构造的交替迭代算法收敛速度快,而且相比于迫零、最小均方误差以及最大泄信噪比算法,和速率有显著提高。     

WCDMA系统中的差分最小均方误差多用户检测算法

宽带码分多址(Wideband code division multiple access,WCDMA)系统中现有的自适应多用户检测算法需要训练比特,不能适应快衰落信道。本文根据WCDMA系统中特有的二级扩频体制的特点,提出基于差分最小均方误差(Differential minimum mean square error,DMMSE)准则的自适应多用户检测算法。该算法根据相邻接收符号幅度变化的比率变化自适应调整横向滤波器的权系数,从而不需要通过训练比特开销跟踪信道状态信息的方式来抑制多址干扰。仿真结果表明,在存在多普勒频移的传播环境下,DMMSE算法的误码性能优于现有的自适应最小均方误差(Minimum mean square error,MMSE)算法。     

MIMO-GFDM系统中低复杂度动态禁忌搜索检测算法的改进

针对多输入多输出的广义频分复用（MIMO-GFDM）系统的等效信道矩阵维度极大，传统的MIMO检测算法复杂度高且性能不佳的问题，将大规模MIMO系统中的动态禁忌搜索（RTS）检测算法运用到MIMO-GFDM系统中，并解决了RTS算法初始值的求解复杂度高的问题。首先利用最小均方误差（MMSE）检测算法所用到矩阵的正定对称性将矩阵Cholesky分解，并结合Sherman-Morrison公式迭代计算初始值，降低了初始值求逆的高复杂度；然后以改进的MMSE检测结果作为RTS算法的初始值，从初始值逐步全局搜索最优解；最后通过仿真，对不同算法的迭代次数和误码率（BER）性能进行了研究。理论分析与仿真结果表明：在MIMO-GFDM中，所提改进RTS信号检测算法误码率远低于传统信号检测算法。在4QAM时，RTS算法大约有低于MMSE检测6 dB的信噪比性能增益（误码率在10^-3时）；在16QAM时，RTS算法大约有低于MMSE检测4 dB的信噪比性能增益（误码率在10^-2时）。与传统RTS算法性相比，所提改进算法在不影响误码率性能的同时降低了算法复杂度。     

基于对称连续超松弛的大规模MIMO信号检测算法

在大规模MIMO系统中,当基站端天线数远大于单天线用户数时,传统的最小均方误差(MMSE)算法能达到接近最优的线性信号检测性能。但是,由于MMSE算法涉及了复杂的矩阵求逆,从而导致其难以快速有效地实现。利用信道特征,改进了MMSE检测算法,提出了对称连续超松弛(Symmetric Successive Over-Relaxation,SSOR)算法以避免矩阵求逆,并给出了合适的松弛参数和初始值。此外,从算法实现角度考虑,采用信道硬化信息传递(Channel Hardening-Exploiting Message Passing,CHEMP)接收机对信道进行估计。结果表明,通过简单的几次迭代,在给定的松弛参数和初始值条件下,SSOR算法就能快速接近MMSE算法的检测性能,并大幅降低了计算复杂度。     

大规模MIMO通信中基于Jacobi预迭代的改进Gauss-Seide算法

在大规模MIMO系统中,现有的高斯-赛德尔（Gauss-Seide,GS）算法相较于最小均方误差（Minimum mean-square error,MMSE）算法,GS的复杂度较低,但其检测性能相比而言较差。本文提出一种适用于大规模MIMO系统上行链路检测的基于雅克比预迭代改进的高斯-赛德尔（Jacobi-improved Gauss-Seide,JA-IGS）检测算法,该算法首先通过引入雅可比（Jacobi,JA）预迭代器来优化迭代初始解,然后对传统的GS进行线性优化,在增加较低复杂度情况下,检测性能和收敛速度有明显提升。仿真结果表明,与传统GS和JA检测算法相比,该算法具有较低的误码率（Bit error ratio,BER）和较高的计算效率。     

基于矩阵和求逆及MRC的低复杂度MIMO检测器

信道编码MIMO系统需要检测器具有软输入软输出特性,而常规的检测算法通常具有很高的计算复杂度,阻碍了其在实际中的应用.提出一种低复杂度MIMO检测方案.首次迭代中,利用低复杂度快速矩阵和分解方案来获得MMSE检测输出,避免了常规矩阵和求逆中的Jordan标准型化简;其余迭代中,利用信道解码器提供的软信息将MIMO系统转...     

结合最小均方误差的改进球形译码检测算法

在多输入多输出(MIMO)系统的信号检测算法中,球形译码算法的检测性能最接近最大似然算法,但传统球形译码算法运算复杂度较高。为降低球形译码算法复杂度,提出一种新型的球形译码检测算法。新算法由改进的快速球形译码算法与最小均方误差算法相结合而成。改进的快速球形译码算法通过在球形半径收缩时乘上一个常量参数来提高半径收缩速度,减少算法搜索的信号点数,从而达到降低复杂度的目的。最小均方误差算法则能够通过减小噪声对接收信号的干扰来降低因搜索噪声点而产生的复杂度。将最小均方误差算法的信道矩阵应用在改进的快速球形译码算法中,将两种算法有效地结合,能够进一步降低算法复杂度。仿真结果表明,当信噪比(SNR)低于10 dB时,新算法相比于原始球形译码算法,检测性能平均提高了9%左右。     

STBC MC-CDMA系统自适应MBER多用户检测算法

针对MC-CDMA(Multicarrier code division multiple access)系统,描述了其时变多径衰落环境下采用空时分组编码(Space-time block coding,STBC)的同步上行链路模型,提出一种基于最小误比特率(Minimum biter-ror rate,MBER)的多用户检测算法。利用内核密度估计和梯度下降的方法,推导了该算法自适应实现形式。对具有2个发射天线和2个接收天线的STBC MC-CDMA同步上行链路系统进行了自适应MBER检测算法的计算机仿真。结果表明:当系统负荷较小时,该算法误码性能较好;当系统负荷较大时,该算法误码性能有所下降,但仍然优于具有类似计算复杂度的MMSE(Minimum mean squared error)自适应检测算法。     

MUSA系统中一种快速多用户检测算法

多用户共享接入是一种5G非正交多址接入方案,由于采用了串行干扰消除(SIC)检测算法,算法运行时间较长,时延和复杂度较大。针对5G低时延、高可靠性的需求,提出了一种基于并行干扰消除(PIC)结构的快速非线性检测算法,该算法不需要多级PIC结构。首先让接收信号经过最小均方误差(MMSE)检测器,并把MMSE检测器的输出作为PIC检测器的输入。该算法避免了串行干扰消除算法中多次排序和对矩阵多次求逆的问题,在不降低符号错误率的情况下,算法的运行时间减小了54%,复杂度降低了一个级别。     

Multiuser detection algorithm based on belief propagation in multiple-input multiple-output systems

In MIMO (multiple-input, multiple-output) systems, signals from differenttransmitting antennas interfere at each receiving antenna and multiuser detection (MUD)algorithms may be adopted to improve the system performance. This paper proposes anovel multiuser detection algorithm in MIMO systems based on the idea of "beliefpropagation" which has achieved great accomplishment in decoding of low-densityparity-check codes. The proposed algorithm has a low computation complexityproportional to the square of transmitting/receiving antenna number. Simulation resultsshow that under low signal-to-noise ratio (SNR) circumstances, the proposed algorithmoutperforms the traditional linear minimum mean square error (MMSE) detector while itencounters a "floor' of bit error rate under high SNR circumstances. So the proposedalgorithm is applicable to MIMO systems with channel coding and decoding. Although inthis paper the proposed algorithm is derived in MIMO systems, obviously it can be appliedto ordinary code-division m     

Symbol Detection Based on Back Tracking Search Algorithm in MIMO-NOMA Systems

One of the most important methods used to cope with multipath fading effects, which cause the symbol to be received incorrectly in wireless communication systems, is the use of multiple transceiver antenna structures. By combining the multi-input multi-output (MIMO) antenna structure with non-orthogonal multiple access (NOMA), which is a new multiplexing method, the fading effects of the channels are not only reduced but also high data rate transmission is ensured. However, when the maximum likelihood (ML) algorithm that has high performance on coherent detection, is used as a symbol detector in MIMO NOMA systems, the computational complexity of the system increases due to higher-order constellations and antenna sizes. As a result, the implementation of this algorithm will be impractical. In this study, the backtracking search algorithm (BSA) is proposed to reduce the computational complexity of the symbol detection and have a good bit error performance for MIMO-NOMA systems. To emphasize the efficiency of the proposed algorithm, simulations have been made for the system with various antenna sizes. As can be seen from the obtained results, a considerable reduction in complexity has occurred using BSA compared to the ML algorithm, also the bit error performance of the system is increased compared to other algorithms.     

低复杂度的大规模MIMO上行链路软输出信号检测

针对信道矩阵维度高以及接收信号复杂的情况,提出了一种适用于大规模MIMO系统上行链路信号检测的混合迭代算法,即结合自适应阻尼雅克比(damped Jacobi,DJ)算法和共轭梯度(conjugate gradient,CG)算法。首先利用CG算法为自适应阻尼雅克比迭代算法提供有效的搜索方向;随后提出切比雪夫方法消除松弛参数对信号检测的影响,在降低算法复杂度的同时加快收敛速度;最后,利用信道编译码中的比特似然比近似求解软信息,以提升检测性能。通过理论分析算法的复杂度,仿真在不同判决方式下对不同检测算法进行误码率对比,并对混合迭代算法的收敛进行了分析。仿真结果表明,混合迭代算法在少量迭代次数下快速收敛并近似达到最佳MMSE检测性能,且算法复杂度远低于MMSE算法。     

A low-complexity hybrid algorithm based on particle swarm and ant colony optimization for large-MIMO detection

With rapid increase in demand for higher data rates, multiple-input multiple-output (MIMO) wireless communication systems are getting increased research attention because of their high capacity achieving capability. However, the practical implementation of MIMO systems rely on the computational complexity incurred in detection of the transmitted information symbols. The minimum bit error rate performance (BER) can be achieved by using maximum likelihood (ML) search based detection, but it is computationally impractical when number of transmit antennas increases. In this paper, we present a low-complexity hybrid algorithm (HA) to solve the symbol vector detection problem in large-MIMO systems. The proposed algorithm is inspired from the two well known bio-inspired optimization algorithms namely, particle swarm optimization (PSO) algorithm and ant colony optimization (ACO) algorithm. In the proposed algorithm, we devise a new probabilistic search approach which combines the distance based search of ants in ACO algorithm and the velocity based search of particles in PSO algorithm. The motivation behind using the hybrid of ACO and PSO is to avoid premature convergence to a local solution and to improve the convergence rate. Simulation results show that the proposed algorithm outperforms the popular minimum mean squared error (MMSE) algorithm and the existing ACO algorithms in terms of BER performance while achieve a near ML performance which makes the algorithm suitable for reliable detection in large-MIMO systems. Furthermore, a faster convergence to achieve a target BER is observed which results in reduction in computational efforts.     

Practical aspects of preprocessing techniques for K-Best tree search MIMO detectors

It has been shown in several works that some preprocessing techniques can improve data detection performance when they are applied to the channel matrix of MIMO wireless systems. In particular, these techniques can be used previously to K-Best tree search algorithms, and they are known to achieve successful results. Throughout this work, the performance and complexity of two preprocessing techniques (VBLAST ZF-DFE ordering and LLL lattice-reduction) are evaluated and compared. The LLL algorithm and a recently proposed fixed-complexity version of it are tested. In addition, a low-complexity implementation of the VBLAST ZF-DFE method is proposed. Results show that the LLL preprocessing is less costly than the VBLAST ZF-DFE ordering in average. Also, the BER curves of the K-Best detector in a 4×4 MIMO system reveal that the LLL method can only present better detection performance than the VBLAST ZF-DFE ordering for high SNRs and low values of K.     

Joint DOA and channel estimation with data detection based on 2D unitary ESPRIT in massive MIMO systems

We propose a novel method for joint two-dimensional (2D) direction-of-arrival (DOA) and channel estimation with data detection for uniform rectangular arrays (URAs) for the massive multiple-input multiple-output (MIMO) systems. The conventional DOA estimation algorithms usually assume that the channel impulse responses are known exactly. However, the large number of antennas in a massive MIMO system can lead to a challenge in estimating accurate corresponding channel impulse responses. In contrast, a joint DOA and channel estimation scheme is proposed, which first estimates the channel impulse responses for the links between the transmitters and antenna elements using training sequences. After that, the DOAs of the waves are estimated based on a unitary ESPRIT algorithm using previous channel impulse response estimates instead of accurate channel impulse responses and then, the enhanced channel impulse response estimates can be obtained. The proposed estimator enjoys closed-form expressions, and thus it bypasses the search and pairing processes. In addition, a low-complexity approach toward data detection is presented by reducing the dimension of the inversion matrix in massive MIMO systems. Different cases for the proposed method are analyzed by changing the number of antennas. Experimental results demonstrate the validity of the proposed method.     

A low-complexity Lanczos-algorithm-based detector with soft-output for multiuser massive MIMO systems

Zero-Forcing (ZF) algorithm achieves the near-optimal detection performance for massive multiple-input multiple-output (MIMO) systems at expense of performing the complicated matrix inversion of a high dimensional matrix. In this paper, a novel Lanczos-algorithm-based signal detection method with soft-output is proposed to iteratively realize ZF algorithm for multiuser massive MIIMO systems, which avoids the exact computation of matrix inversion and in turn reduces the computational complexity from $O(K^3)$ to $O(K^2)$, where K denotes the number of users. In the development of the proposed method, by analyzing the iterative process of Lanczos algorithm, an approximate low-complexity scheme is proposed to calculate the log likelihood ratios (LLRs) for soft channel decoding. Simulation results show that the proposed detector provides a relatively good tradeoff between the complexity and performance compared with the several recently proposed detectors, and achieves almost the same performance as the ZF algorithm with only 3 iterations.     

基于大规模MIMO的散射信道估计技术

随着用户对通信速率的要求日益增长,散射通信的通信容量亟待提升。大规模多输入多输出（MIMO）技术是提升容量的一种重要途径,本文研究基于大规模MIMO的对流层散射通信系统的信道估计问题。首先建立基于二维均匀方形天线阵列的大规模MIMO对流层散射信道模型,其次提出一种信道协方差矩阵估计算法对传统最小均方差（MMSE）信道估计算法进行改进,最后与最小二乘（LS）、传统MMSE算法和理想MMSE信道估计算法的准确度进行对比。仿真结果表明：在信噪比（SNR）为0~25 dB的情况下,传统的MMSE算法的准确度相较于LS算法的提升效果并不明显,与理想MMSE算法的准确度有一定差距;但改进MMSE信道估计算法的准确性优于传统MMSE算法,同等条件下NMSE相同时,其SNR可提升3~5 dB,并随着SNR的增大逐渐逼近理想MMSE算法。