MIMO系统中局域化最大似然信号检测算法

提出了一种MIM0系统中低复杂度的局域化最大似然信号检测算法，该方法通过调整信号有效搜索域大小，在计算复杂度与系统性能之间折衷．实验结果表明：该信号检测算法明显降低了高阶QAM调制的计算复杂度，在QPSK和16QAM调制时，当系统性能接近最大似然算法时计算量仅为其很小一部分。     

MIMO系统中球形译码算法的应用

MIMO系统在带来巨大容量的同时,也产生了极大的接收信号检测复杂度。球形译码算法是较好解决这一问题的有效途径之一,通过减少比较信号点的个数达到降低计算量的要求。根据MIMO系统的信号模型特点,结合相关研究的新进展,对球形译码原理和算法进行了探讨。理论分析表明,该方法可以用较少的计算量来获得最大似然检测性能,有较高的应用价值。     

分布式MIMO系统中最优检测的简化算法

在V-BLAST结构的分布式MIMO系统中,针对发射天线地域上的分布性所引起的发射符号异步到达接收天线的问题,提出了一种接近最优检测性能简化算法。该算法首先遍历部分码元符号,且每次遍历时都使用分布式排序干扰抵消算法检测剩余符号,然后对得到的符号候选集进行搜索,恢复发送信号。莱斯衰落信道下的计算机仿真表明,该算法对接收端天线数目没有要求,且在获取接近最优检测性能的同时,有效地降低了计算复杂度。     

V-BLAST光MIMO系统检测算法分析

为了降低系统光多输入多输出(MIMO)系统的复杂度,提高系统的性能,介绍了迫零(ZF)检测算法、最小均方误差(MMSE)检测算法、最大似然(ML)检测算法在垂直分层空时编码(V-BLAST)光MIMO空时系统中的应用。从理论上对算法性能和复杂度进行研究,然后在MATLAB建立仿真模型,对多模光纤的传输函数进行仿真,结果表明在多模光纤链路中,ZF算法性能较低;MMSE算法较ZF算法有所改进;ML算法通过比较接收符号和原发送的符号之间的相似度,从而获得原符号的最小差错概率,其性能最好。     

MIMO系统中球形译码算法的研究

针对多输入多输出（MIMO）通信系统中球形译码检测算法在较低信噪比和较高的调制阶数时复杂度仍然很高的问题,提出一种不影响检测性能同时又能大大降低其复杂度的方案。首先,对传统的球形译码算法进行研究;其次,介绍改进的球形译码算法;最后,通过仿真结果对其进行验证。     

基于SINR判决的MIMO联合检测算法

一种低复杂度的MMSE-QRD-QRDM检测方法被提出,该算法根据接收端各子流的信干噪比(SINR)和门限值的比较,对各子流分别进行最小均方误差QR分解(MMSE-QRD)检测或QR分解-M(QRD-M)检测。对MMSE-QRD-QRDM算法进行了误码率(BER)性能仿真和算法复杂度分析。结果表明,和OSD-MLD算法相比,MMSE-QRD-QRDM算法可以在大大降低检测算法复杂度的情况下,获得优于OSD-MLD算法的BER性能,同时通过减少运算中的矩阵求逆次数,提高了算法的数值稳定性。     

MIMO系统中基于MMSE准则的检测算法对容量的影响

文中对MIMO系统中各种基于MMSE准则的接收算法，包括线性MMSE算法、MMSE-BLAST以及MMSE-SQRD算法，对检测后系统容量带来的影响做了详细的分析与推导，给出了其具体表达式，并用计算机仿真给予验证，得出了MMSE-SQRD算法的检测后系统容量最好的结论。     

基于QRM-MLD的MIMO检测算法研究

在多输入多输出( MIMO)通信系统中,MIMO检测是发送端MIMO编码的逆过程,是根据接收到的信号及接收信号质量、信道状态信息等获得发送端发送比特的概率信息过程。通信信道矩阵的QR分解( QRD)是几种MIMO信号检测方案的基本先决条件。首先针对QRD方案进行研究,详细介绍了QRM-MLD的算法实现并进行了优化。最后对复杂度进行了统计并对仿真结果进行了分析,证明此方案可以作为MIMO检测的优选方案。     

MIMO系统V-BLAST检测算法的FPGA实现

用FPGA实现了多种垂直分层空时码(Vertical-Bell Laboratories Layered Space-Time,V-BLAST)检测算法,包括最大似然(Maximum Likelihood,ML)检测算法、破零(Zero Forcing,ZF)检测算法和最小均方误差(Minimum Mean Square Error,MMSE)检测算法。首先研究了MIMO V-BLAST系统架构、数学模型和多种接收机检测算法,分析了关键检测算法的特性和性能,重点使用Verilog硬件描述语言在Xilinx的Vertex4-VC4VSX55 FPGA开发板上实现了V-BLAST系统架构和三种检测算法,并通过仿真结果比较了每一种算法的复杂度和性能。仿真结果表明对于V-BLAST检测,ML具有最优的性能但复杂度最高;ZF算法具有较低的复杂度但比ML的性能略差;MMSE算法复杂度只比ZF算法略大但性能却有显著提升。     

低复杂度的MIMO系统粒子滤波检测

该文通过降低采样大小和信号检测搜索空间给出了两种低复杂度的多输入多输出(MIMO)系统粒子滤波(PF)检测方法：球形约束PF和多层映射PF。在球形约束PF中,首先基于迫零原则求得所需的球形约束,然后利用该球形约束减少粒子滤波过程中每一级重要性采样生成的粒子数。多层映射PF则采用多层映射将大小为4L的正交幅度调制(QAM)星座划分为L个4-QAM星座的级联以降低信号检测的搜索范围。计算机仿真结果表明,第1种方法能够在大发送天线数的情况下保持系统性能且有效地降低粒子滤波的计算复杂度;而第2种方法能够以较低的错误性能损失为代价获得计算复杂度的极大降低。     

基于星座距离限制的MIMO检测算法

为了提高最小均方误差(MMSE)MIMO系统信号检测算法的性能,提出基于星座距离判决的改进型MMSE检测算法。该算法能够判断经过初次检测后信号的可靠性,并根据判断结果,利用最大似然(ML)准则将被判断为不可靠的信号重新估计检测,以提高算法的性能。理论分析和仿真结果表明:在使用QPSK调制,目标误码率(BER)为10-3的情况下,对于不同天线数量的系统,新提出的算法可以在增加极低计算复杂度的情况下,获得2～10 dB的信噪比(SNR)增益。     

基于TD-LTE中下行MIMO技术的信号检测算法

MIMO技术是LTE系统中的一个关键技术。在实际应用中,下行MIMO信号检测算法的选用需要在计算复杂度和系统性能之间取得合理的折中。文中对几种传统的检测算法—ML、MMSE、最优排序的SIC算法、QR分解算法、循环迭代QR分解算法进行了分析与研究。经仿真表明,除最大似然算法,循环迭代QR分解算法在这几种算法中性能是最好的。但是从计算复杂度出发,循环迭代QR分解算法远优于最大似然算法。所以,选用循环迭代QR分解算法运用于TD-LTE无线综合测试仪。     

Soft MIMO ML demodulation based on bitwise constellation partitioning

In this letter, we propose a soft-decoding ML MIMO demodulation method that lowers the complexity of the existing ML method. The proposed method finds the nearest point without calculating the Euclidean distance by exploiting the regular structure of bit-to-symbol mapping. It enables significant reduction of the number of distance calculations which is a major complexity burden.     

New detection algorithms based on the jointly Gaussian approach and successive interference cancelation for iterative MIMO systems

A new detection algorithm based on the jointly Gaussian approach (JGA) and successive interference cancelation (SIC), named the SIC‐JGA algorithm, is proposed for iterative MIMO systems. Both the a priori symbol estimates of the undetected layers and the a posteriori symbol estimates of the previously detected layers are used in the SIC process. To reduce the complexity of covariance matrix inversion in the proposed algorithm, simplified algorithms named S‐SIC‐JGA are investigated for both the single path and multipath block fading channels under M Phase Shift Keying modulations. A detailed complexity analysis is presented for both the SIC‐JGA and S‐SIC‐JGA algorithms. Numerical results exhibit that the system using the SIC‐JGA algorithm outperforms the JGA algorithm, with an additional complexity for determining the detection order of SIC. The S‐SIC‐JGA algorithm has a much lower complexity compared with the SIC‐JGA algorithm while experiencing an acceptable system performance degradation. Proper detection algorithms can be chosen in different iterations to balance the system performance and the detection complexity. Copyright © 2012 John Wiley & Sons, Ltd.     

基于传输信号源非圆特性的MIMO检测算法研究

针对传输非圆信号的多输入/输出(MIMO)通信系统提出了几种新检测算法,可估计来自接收信号及其复共轭的传输信号,并针对性能改进给出了相关分析结果。所提算法的计算复杂度在阶数方面与传统迫零(ZF)相同。仿真结果表明,扩展迫零(EZF)及扩展最小均方误差(EMMSE)检测器均优于最小均方误差(MMSE)检测器,且EZF或EMMSE的排序串行干扰消除(OSIC)法在误码率(BER)方面具有准最优性能。     

MIMO移动通信系统中的预编码技术研究

MIMO技术利用多根天线实现多发多收,能够在不增加传输带宽和发射功率的条件下,成倍地提高系统的数据速率;而预编码技术则可以利用接收端反馈回来的信道状态信息对信号进行预处理以改善信号的传输性能,从而达到消除干扰的目的,使得无线通信系统的可靠性得以提升。因此对MIMO系统预编码技术的研究,是解决如何提升无线通信系统性能的关键问题,具有重大的研究意义。     

Analysis of receiver algorithms for lte LTE SC-FDMA based uplink MIMO systems

This letter derives mathematical expressions for the received signal-to-interference-plus-noise ratio (SINR) of uplink Single Carrier (SC) Frequency Division Multiple Access (FDMA) multiuser MIMO systems. An improved frequency domain receiver algorithm is derived for the studied systems, and is shown to be significantly superior to the conventional linear MMSE based receiver in terms of SINR and bit error rate (BER) performance.     

Space-time diversity systems based on linear constellation precoding

We present a unified approach to designing space-time (ST) block codes using linear constellation precoding (LCP). Our designs are based either on parameterizations of unitary matrices, or on algebraic number-theoretic constructions. With an arbitrary number of N/sub t/ transmit- and N/sub r/ receive-antennas, ST-LCP achieves rate 1 symbol/s/Hz and enjoys diversity gain as high as N/sub t/N/sub r/ over (possibly correlated) quasi-static and fast fading channels. As figures of merit, we use diversity and coding gains, as well as mutual information of the underlying multiple-input-multiple-output system. We show that over quadrature-amplitude modulation and pulse-amplitude modulation, our LCP achieves the upper bound on the coding gain of all linear precoders for certain values of N/sub t/ and comes close to this upper bound for other values of N/sub t/, in both correlated and independent fading channels. Compared with existing ST block codes adhering to an orthogonal design (ST-OD), ST-LCP offers not only better performance, but also higher mutual information for N/sub t/>2. For decoding ST-LCP, we adopt the near-optimum sphere-decoding algorithm, as well as reduced-complexity suboptimum alternatives. Although ST-OD codes afford simpler decoding, the tradeoff between performance and rate versus complexity favors the ST-LCP codes when N/sub t/, N/sub r/, or the spectral efficiency of the system increase. Simulations corroborate our theoretical findings.     

MIMO无线通信系统中调度算法分析

对轮询算法、最大载干比算法和比例公平算法三种经典的调度算法进行了深入的研究,并在MIMO系统环境中,对它们的性能进行了计算机仿真。从基本原理和仿真结果两个方面,对上述三种调度算法的公平性和系统吞吐量性能进行了对比分析,证明了轮询算法具有最好的公平性性能,最大载干比算法具有最好的吞吐量性能,比例公平算法则很好的在两者之间取得了一个平衡。     

Reduced complexity Schnorr-Euchner decoding algorithms for MIMO systems

A new reduced-complexity Schnorr-Euchner decoding algorithm is proposed in this letter for uncoded multi-input multi-output systems with q-QAM (q=4,16,...) modulation. Furthermore, a Fano-like metric bias is introduced to the algorithm from the perspective of sequential decoding, as well as an early termination technique. Simulation results show that these modifications reduce the algorithm complexity efficiently, with only a small degradation in bit error rate at high signal to noise ratios.