酉空时调制系统中基于球形译码的多符号差分检测算法

为酉空时调制系统设计的多符号差分球形译码能以较低复杂度获得最大似然检测性能.但该算法基于准静态信道假设,当将它用于快衰落信道时会出现严重的误码平层现象.文中基于连续衰落信道假设,将最大似然度量的一种递推形式嵌入自动球形译码中,构建了多符号差分自动球形译码算法,并以此为基础提出了降低计算复杂度的多符号差分近似自动球形译码与降低比较操作次数的多符号差分裁减自动球形译码.与现存的两种典型算法,即多符号判决反馈检测(MS-DFD)和非相干序列检测(NSD)相比,所提算法的性能明显优于MS-DFD,接近NSD的性能,但其平均复杂度远低于NSD,在大多数情况下明显低于MS-DFD的复杂度.     

适合酉空时调制的多进制Turbo码及其MAP译码算法

酉空时调制技术可以在发射和接收两端均无信道状态信息的环境中实现无线通信,适合快速Rayleigh平衰落信道,然而它的一个本质问题是只有在高信噪比条件下才会有理想的差错性能.现有的比特级处理方案在改善系统可靠性的同时带来了过大的计算量、存储量和译码时延的问题.文中提出一种适用于酉空时调制的多进制Turbo码方案,同时给出其相应的酉空时符号级多进制MAP译码算法.仿真表明:相比于现有方案,文中的算法可以降低系统组成及处理的复杂度,同时又保持良好的差错性能.另外,文中从酉空时调制的概念出发,首次给出了信噪比过低时结合纠错编码的情况下发射分集性能恶化的定性分析.     

多符号差分球形译码在无线传感器网络分布式检测中的应用研究

在无线传感器网络分布式检测中,信道条件复杂,难于估计.比较相关检测,差分检测的优势是不需要信道估计,但总是付出一定的性能损失.为了缩短这一差距,本文提出多符号差分检测,并结合低复杂度球形译码算法,对多符号差分球形检测的迭代搜索过程进行了详细分析.算法检测性能和复杂度的分析表明,该检测算法不仅能有效降低计算复杂度,而且能保证较好的检测性能.结果证明该算法可作为一种有效检测算法应用于无线传感器网络分布式检测中.     

一种低复杂度次优自动球形译码算法

提出一种低复杂度次优自动球形译码算法。针对常规自动球形译码边界节点列表长度过大的问题,本文通过设置算法中的边界节点列表长度为固定值,使译码过程的复杂度大大减少;并通过仿真确定对应不同信噪比范围内的似费诺偏移量,补偿到对应节点的距离度量,保证系统的性能。对算法进行仿真验证,结果表明,该算法与常规自动球形译码算法相比,在性能基本不变的前提下,译码复杂度得到有效的减少,并更适宜硬件实现。     

多符号差分检测的低复杂度球形译码设计

在多符号差分检测系统中,深度优先的球形译码是一种典型的次优的检测算法。然而从复杂度角度来说,它仍有较高的计算复杂度,且存在流水线和并行操作困难等缺点。针对这些问题,目前主要从两个方面对该算法进行改进：一是通过选择合适的约束半径来降低复杂度;二是与K-Best（M）算法结合来解决并行操作问题。主要研究前者,并在现有的理论基础上,提出了两种半径选择方法,即线性半径和非线性半径。仿真结果表明,两种半径约束下的球形译码在复杂度上低于最大似然检测却同时能保证它们的性能损失小于0.5 dB。     

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

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

LTE-A系统中球形译码检测算法研究

详细研究了球形译码算法流程以及两种常用的初始半径选择算法,提出了一种基于阈值的球形译码检测算法,充分考虑到信噪比以及信道条件数对检测算法的影响,在保证球形译码性能的前提下,降低球形译码算法复杂度.该算法已应用于TD-LTE无线综合测试仪表的开发中.     

长期演进系统中一种低复杂度球形译码算法

在长期演进(LTE)系统中,球形译码算法拥有接近于最大似然(ML)的误码率(BER)性能。针对在16QAM和64QAM等高阶调制情况下球形译码算法计算复杂度和所需硬件资源的急剧增加,提出了一种调整符号搜索策略的改进型球形译码算法。该算法在不同的检测层采用特定的符号搜索方案,并结合一种基于信噪比的动态调整半径方法。在无线瑞利信道环境下,对各种球形译码算法进行了仿真。仿真结果表明,提出的改进型算法基本保持传统球形译码算法较低的BER性能,同时还有效地降低了计算复杂度和硬件实现复杂度。     

无线信道下基于可译集的喷泉码增量译码算法

针对无线信道中数字喷泉码BP译码算法复杂度高、增量译码效率低下的问题,提出了一种基于可译集的增量译码算法。该算法给出变量节点成功译码时似然比所需达到的合适门限值Tre的理论分析方法,将译码过程中似然比高于门限值的变量节点归入可译集,提前译出以减少计算量;另一方面,若译码失败,增加开销重新译码时可先利用已成功译出的部分变量节点简化Tanner图,只对未达到译码门限的变量节点进行迭代,进一步减少计算量,并给出了算法描述和复杂度分析。最后通过仿真表明,该算法与传统的BP译码算法性能相同,但计算量大大减少,效率显著提高。     

球形译码算法在信号空间分集系统中的应用研究

针对信号空间分集系统中最大似然检测算法复杂度高的问题,选用球形译码算法作为信号空间分集系统接收机检测算法,可以使接收机在接近最大似然算法检测性能的同时,降低接收机检测复杂度。为进一步降低检测复杂度,通过采用最小均方误差算法减小噪声对接收信号的干扰,来降低因搜索噪声点而产生的复杂度,并利用衰减因子k加快搜索半径收缩来达到进一步降低球形译码算法检测复杂度的目的。仿真结果表明,在信号空间分集系统中引入球形译码算法可以降低接收机检测复杂度,并且改进后的球形译码算法检测时间在低信噪比情况下约为传统球形译码算法的12%—33%。因此,球形译码算法可以有效地降低信号空间分集系统接收机检测复杂度。     

Multiple symbol differential detection based on sphere decoding for unitary space-time modulation

Recently, a multiple symbol differential (MSD) sphere decoding (SD) algorithm for unitary space-time modulation over quasi-static channel has been proved to achieve the performance of maximum-likelihood (ML) detection with relatively low complexity. However, an error floor occurs if the algorithm is applied over rapid-fading channels. Based on the assumption of continuous fading, a multiple symbol differential automatic sphere decoding (MSDASD) algorithm is developed by incorporating a recursive form of an ML metric into automatic SD (ASD) algorithm. Furthermore, two algorithms, termed as MSD approximate ASD (MSDAASD) and MSD pruning ASD (MSDPASD), are proposed to reduce computational complexity and the number of comparisons, respectively. Compared with the existing typical algorithms, i.e., multiple symbol differential feedback detection (MS-DFD) and noncoherent sequence detection (NSD), the performance of the proposed algorithms is much superior to that of MS-DFD and a little inferior to that of NSD, while the complexity is lower than that of MS-DFD in most cases and significantly lower than that of NSD. Supported by the National Basic Research Program of China (973 Program) (Grant No. 2009CB320403), and the National Defense Pre-research Project of the 11th Five-Year-Plan of China (Grant No. 1060741001020102)     

Non-coherent space-time code based on full diversity space-time block coding

A non-unitary non-coherent space-time code which is capable of achieving full algebraic diversity is proposed based on full diversity space-time block coding, The error performance is optimized by transforming the non-unitary space-time code into unitary space-time code, By exploiting the desired structure of the proposed code, a grouped generalized likelihood ratio test decoding algorithm is presented to overcome the high complexity of the optimal algorithm, Simulation results show that the proposed code possesses high spectrum efficiency in contrast to the unitary space-time code despite slight loss in the SNR, and besides, the proposed grouped decoding algorithm provides good tradeoff between performance and complexity,     

基于球形检测的MIMO均衡技术

均衡技术在提高MIMO频率选择性衰落信道传输质量的同时产生了极大的接收信号检测复杂度。以球形译码算法(SDA)为基础提出的多符号判决反馈球译码算法较好地解决了此问题。假设被检测的某个矢量信号外的其它信号已知,对接收信号表达式进行变换再运用SDA。理论分析和仿真结果表明,该方法可以用较少的计算量获得接近最大似然(ML)检测的性能。     

Differential space-time block-diagonal codes

A new differential space-time code, called differential space-time block-diagonal code (DSTBDC), is proposed for multiple-input multiple-output (MIMO) wireless communication systems. By exploiting the block-diagonal construction of DSTBDC, we can design a variety of high-performance DSTBDC, especially for the cases of large numbers of transmit antennas and high date rates. In flat fading channels, DSTBDC outperforms traditional differential space-time codes if the data rate is higher than 1 bps/Hz, especially when the number of transmit antennas is large. In frequency-selective fading channels, multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems using DSTBDC have the powerful ability to achieve very high diversity gain in space, time, and frequency simultaneously. Due to the special orthogonal construction, DSTBDC has a simple decoding algorithm. In addition, DSTBDC can significantly save the cost of radio frequency circuits.     

Reduced complexity list sphere decoding for MIMO systems

Depth-first sphere decoding of MIMO systems has near maximum likelihood performance with reasonable computational complexity. In this paper, lower complexity depth-first sphere decoding and list sphere decoding algorithms are proposed. Several criteria for re-ordering the search dimensions are proposed. The proposed sphere decoders are shown to have a significantly reduced decoding complexity at low SNRs. To further reduce the complexity at high SNRs, the point search-space at each ordered dimension is adaptively reduced. Further reductions in the decoding complexity are achieved by inter-layer interference cancellation. It is shown that the proposed sphere decoding algorithms maintain their near-optimal performance, concurrently with a significant complexity reduction, over a wide SNR range.     

永磁同步电机多步模型预测电流控制球形编码研究

传统多步模型预测电流控制遍历所有开关序列, 并寻求成本函数最小, 使得运算量较大. 球形编码算法将成本函数转换为开关序列对应的矩阵二范数平方, 并采用事件触发机制动态精简计算量. 仿真结果表明: 基于球形编码的多步模型预测电流控制性能良好, 与传统方法完全等价, 控制效果相当. 基于STM32H743单片机平台, 球形编码和传统方法单控制周期执行时间实验结果表明: 对于多步预测, 球形编码算法可减少单控制周期执行时间, 2步预测减小至96.78%, 3步预测减小至87.99%, 4步预测减小至73.41%, 5步预测减少至63.63%, 在控制性能与传统方法相当的条件下, 提高系统实时性能     

Performance of multiuser CDMA system with space-time block coding in MIMO Rayleigh fading channels

In this paper, by introducing orthogonal space-time coding scheme, the multiuser CDMA systems with different space time codes are given, and corresponding system performance is investigated over Rayleigh fading channel. A low-complexity multiuser receiver scheme is developed for space-time coded CDMA systems. The scheme can make full use of the complex orthogonality of space-time coding to simplify the high decoding complexity of the existing scheme. Compared to the existing scheme with exponential decoding complexity, it has linear decoding complexity. Based on the performance analysis and mathematical calculation, average bit error rate (BER) of the system is derived in detail, and tight closed-form approximation expressions of BER are attained. Simulation results on average BER are in agreement with the theory analysis. The results show that the proposed scheme can achieve almost the same performance as the existing scheme. Moreover, on the condition of same system throughput and concatenation of channel code, the given full-rate space-time coded CDMA system has lower BER than the full-diversity space-time coded CDMA systems.