基于MIMO系统的球形译码算法的改进

在最大似然检测中,球形译码算法是一种有效的快速算法。提出一种基于MIMO系统的新的快速球形译码算法,它的复杂度比传统的算法要小的多。在提出的方法中,初始半径的选择并不重要。这种改进算法的译码性能和复杂度由两个参数来控制。因此,该方法存在着译码性能和复杂度的均衡。通过计算机仿真,可以看到,提出改进算法的译码性能得到了较大的提高。     

短波通信多组空时编码中等效MIMO模型ZF解码

面向短波通信提出了多组空时编码( MGSTC )的一种等效多输入多输出( MIMO )模型迫零( ZF)解码算法。该算法以降低运算复杂度为目的,将原多时隙MIMO系统拆分为多个多时隙单输入多输出( SIMO)系统并分别等效为多个新的单时隙MIMO系统模型,通过各自左乘等效信道矩阵的共轭转置后进行最大比合并( MRC)以及ZF解码获得发送信号估计值,避免了球形解码( SD)中对高阶矩阵的QR分解。仿真结果表明,与虚拟MIMO模型SD解码算法相比,等效MIMO模型ZF解码算法在误码率( BER)性能1 dB损耗的情况下,运算量降低一个数量级以上。     

Reduced Complexity K-Best Sphere Decoder Design for MIMO Systems

The sphere decoding algorithm is widely used for maximum likelihood (ML) detection in multiple-input multiple-output (MIMO) systems, wherein the K-best sphere decoding algorithm is well appreciated for its fixed complexity and throughput. However, to achieve near-ML performance, K needs to be sufficiently large, which leads to large computational complexity in path expansion, sorting, and path updating. In this paper, we propose two efficient decoding schemes that can significantly reduce the average K value and thus the total computational complexity without sacrificing performance. We further present a novel sorting architecture that can save about 70% of the sorting operations compared with the bubble sort method. It is estimated that, for the example 4×4 64 QAM MIMO system, 68% of the total computational complexity can be saved over the conventional design by applying all the proposed techniques. This work was supported by the National Science Foundation under Grant CCF-0514816 and the National Aeronautics and Space Administration under Grant NNX06AC23G.     

一种低复杂度的MIMO预处理球形译码算法

提出了一种新的低复杂度MIMO预处理球形译码算法.球形译码算法是MIMO译码方案达到最大似然性能的低复杂度译码算法,但当信噪比较低或调制阶数较高时,该算法的复杂度仍然很大,甚至接近穷尽搜索方法的复杂度.本文利用迫零译码的初始估值作为软信息,对信道矩阵各列进行重排列,从而改变解向量中各维信号的求解顺序,因此大大减少了低信噪比或较高调制阶数的球形译码计算复杂度.仿真结果表明,当Eb/No为0～3时,16QAM调制方式下的V-BLAST译码复杂度减少了近1/3.     

Complexity study of sphere decoding in multi-antenna systems

In this article a bridge between the expected complexity and performance of sphere decoding (SD) is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound of those for all the finite lattices if given by the same channel matrix and signal noise ratio (SNR). Such expected complexity is an important characterization of SD in multi-antenna systems, because no matter what modulation scheme is used in practice (generally it has finite constellation size) this upper-bound holds. Above bridge also leads to a new method of determining the radius for SD. The numerical results show both the real value and upper-bound of average searched number of candidates in SD for 16-QAM modulated system using the proposed sphere radius determining method. Most important of all new understandings of expected complexity of SD are given based on above mentioned theoretic analysis and numerical results.     

复数域网络编码中最大似然解码算法的改进

针对复数域网络编码中继网络,提出一种改进的中继处的最大似然解码算法。当传统的最大似然解码算法使用在复数域网络编码中继网络中时,计算复杂度会随着信息星座图映射方式的改变而大大增加。为了降低计算复杂度,在前人研究的基础上提出一种改进的最大似然解码算法,该算法利用无线中继网络通信系统的非对称性,在解码时,先进行预判决,然后进行精确判决,这样可以大大降低计算复杂度,提高了系统性能。     

Zero forcing based sphere decoder for generalized spatial modulation systems

To reduce the number of radio frequency (RF) chains in multiple input multiple output (MIMO) systems, generalized spatial modulation (GSM) techniques have been proposed in the literature. In this paper, we propose a zero‐forcing (ZF)‐based detector, which performs an initial pruning of the search tree that will be considered as the initial condition in a sphere decoding (SD) algorithm. The proposed method significantly reduces the computational complexity of GSM systems while achieving a near maximum likelihood (ML) performance. We analyze the performance of the proposed method and provide an analytic performance difference between the proposed method and the ML detector. Simulation results show that the performance of the proposed method is very close to that of the ML detector, while achieving a significant computational complexity reduction in comparison with the conventional SD method, in terms of the number of visited nodes. We also present some simulations to assess the accuracy of our theoretical results.     

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

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

一种新的多天线系统中的快速广义球形解码算法

该文提出了一种新的广义球形解码算法.与常规球形解码算法相比,它能够处理多输入多输出系统(MIMO)中发送天线M多于接收天线N的情形,并且其解码速度远大于已有的广义球形解码算法.其基本思想是将M维的传输信号矢量分成N-1和M-N+1维的子矢量xa和xb,通过一些简单地变换,就可以使用一个常规球形解码器来选取合适的xb,然后再利用另一个常规球形解码器来获得xa,从而得到整个传输信号矢量.仿真结果表明,这种新的快速广义球形解码算法(命名为双层球形解码算法)比现有的广义球形解码算法具有更低的复杂度.     

一种Viterbi译码的改进算法

Viterbi译码是一种应用广泛的最大似然估计算法。本文利用相邻几组判决数据之间的相互关系，对这几组数据进行联合判决估计，从而提高了译码性能。从仿真结果来看，当译码深度不大时，译码性能得到明显的改善。因此该算法可以在保证同等性能前提下，减小硬件规模，降低功耗。     

Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems

Sphere decoding (SD) for multiple‐input and multiple‐output systems is a well‐recognized approach for achieving near‐maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM‐MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal‐to‐noise ratio regime. To demonstrate the potential of our method, we compare the results with another well‐known method — namely, probabilistic tree pruning SD.     

极化码序列连续删除译码算法的改进设计

极化码连续删除译码算法性能和传统的LDPC码存在一定差距。序列连续删除算法(SCL)的提出极大地改善译码性能,是极化码推向实际应用中的重要一步。但是该算法复杂度较高,延迟大。改进的序列连续删除(SCL)译码算法是基于改善极化码码长受限的情况,文中描述SCL算法是通过码树上的搜索序列路径来表示译码过程。改进的算法通过减少译码算法在码树上的序列路径来降低时间和空间复杂度。通过仿真表明,改进的算法有效地降低了译码的复杂度同时在性能上也接近最大似然(ML)译码算法。     

A Statistical Pruning Strategy for Schnorr-Euchner Sphere Decoding

The high computational complexity of maximum likelihood (ML) decoding can impact many applications such as code division multiple access (CDMA) and multiple-input multiple-output (MIMO) systems. The sphere decoder (SD) as an efficient ML decoder has therefore received significant attention in the wireless research community. This letter presents a new statistical method to reduce the complexity of the Schnorr and Euchner sphere decoder (SESD). The method uses a set of bounds, which are computed using the conditional probability based on the minimum metric of the current solution. A lookup tabic for the bounds can be computed offline. The proposed method is effective for any number of antennas with complexity savings about 50% or more over the conventional SD approach.     

标准球形译码算法在发射相关MIMO信道下的平均复杂度分析

球形译码算法作为实现MIMO系统最大似然检测的一种有效方法,受到广泛重视.目前,几乎所有对球形译码算法的研究,均是基于假设信道衰落系数完全统计独立并且同分布,而在实际环境下,天线之间通常存在相关性,这样会使球形译码算法的复杂度发生变化.本文针对标准的球形译码算法,对其在发射相关MIMO信道下的复杂度进行了数学分析,推导了平均复杂度的数学表达式,并利用计算机仿真,比较了在不同的信噪比和不同的发射天线数下,发射相关性强弱对算法复杂度的影响.     

一种新的信噪比自适应的球形译码算法

针对多输入多输出(MIMO)无线通信系统中基于球形译码算法(Sphere Decoding Algorithm,SDA)在低信噪比区域较高的复杂度,提出一种半定松弛算法和有限星座SDA相结合的信噪比自适应的SDA。通过仿真得知,所提出的算法与已有的SDA相比,在低信噪比区域有较低的算法复杂度,并且误比特性能逼近于最优的SDA。     

球解码的改进算法

文中首先对MIMO系统启发式算法中的BLAST算法和球解码(CL算法)进行了研究.然后,在前面介绍的相关知识基础上,提出了一种新的球解码算法.该改进算结合BLAST算法计算量小和球解码算法(CL算法)误码性能好的优点而提出的.改进算法在牺牲一定误码性能的情况下,换取算法计算量的大幅度下降.仿真结果表明了这种改进算法的有效性.     

A Low Complexity Decoding Algorithm for STBC under Non-Constant Module Modulation

This paper presents a low complexity algorithm for the decoding of space-time block codes （STBC） under non-constant module modulation. Simulation results show that in most cases of non-constant module modulation the new algorithm results in more than 50% reduction in computation complexity comparing to the original maximum likelihood algorithm without any loss of BER performance.     

基于判决反馈的TurboDPSK

本文针对衰落信道中DPSK(differential phase-shift keying)信号的特点,提出了一种基于判决反馈的Turbo DPSK解调/译码算法,它利用判决反馈进行衰落信道的估计并计算信息比特的似然比.与基于BCJR(Bahl-Cocke-Jelinek-Raviv)的Turbo DPSK解调/译码算法相比,它可以大大降低运算复杂度,减少迭代译码过程中所需的存储空间.仿真结果表明,采用这种新的迭代解调/译码算法可以获得和基于BCJR的迭代解调/译码算法几乎一样的性能.     

Lattice code decoder for space-time codes

We explore the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulted lattice code. For the uncoded system, SD yields, with small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm. SD of algebraic ST codes exploits the full diversity of the coded multi-antenna system, and makes the proposed scheme very appealing to take advantage of the richness of the multi-antenna environment. The fact that the SD does not depend on the constellation size, gives rise to systems with very high spectral efficiency, maximum-likelihood performance, and low decoding complexity     

4×4 V-BLAST系统分组最大似然检测算法

对于V-BLAST系统的检测,最大似然(ML)算法有着最优的性能却也有最大的计算复杂度;经典的排序连续干扰抵消(OSIC)算法复杂度较低,但数值稳定性差,且性能与ML差距较大.因此,本文基于检测性能和计算复杂度折中的思想,针对4×4 V-BLAST系统提出了一种分组最大似然(Group ML,GML)检测算法,在保证较好检测性能的基础上,通过将四维ML检测器分成两组二维ML检测器来降低计算复杂度.此外,本文还提出了一种简化的最大似然(Simpli-fled ML,SML)检测算法,通过将每组中的二维ML检测器的搜索空间从二维降至一维,进一步降低了计算复杂度,并证明其与ML算法具有一致的性能.仿真表明,在误符号率为10~(-3)时GML算法相比OSIC算法有约7dB的性能提升.经分析知.GML算法复杂度与ML-OSIC算法相比在高阶调制方式下有着显著的降低,易于硬件实现.