Extending a Fixed-Complexity Sphere Decoder to Obtain Likelihood Information for Turbo-MIMO Systems

A list extension for a fixed-complexity sphere decoder (FSD) to perform iterative detection and decoding in turbo-multiple input-multiple output (MIMO) systems is proposed in this paper. The algorithm obtains a list of candidates that can be used to calculate likelihood information about the transmitted bits required by the outer decoder. The list FSD (LFSD) overcomes the two main problems of the list sphere decoder (LSD), namely, its variable complexity and the sequential nature of its tree search. It combines a search through a very small subset of the complete transmit constellation and a specific channel matrix ordering to approximate the soft- quality of the list of candidates obtained by the LSD. A simple method is proposed to generate that subset, extending the subset searched by the original FSD. Simulation results show that the LFSD can be used to approach the performance of the LSD while having a lower and fixed complexity, making the algorithm suitable for hardware implementation.      

球解码的改进算法

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

The Effect of Phase Error on DPSK Error Probability

Expressions are found for the effect of an error in the delay of the preceding signal, which provides the reference phase for the decoding of the present signal in differential phase-shift-keying reception. The signal-to-noise ratio is allowed to be different for the two signals that are compared by the receiver's phase detector. The results are applicable to both binary and quaternary DPSK. In addition, an approximation is obtained for the error probability when the two Signal-to-noise ratios are equal to the same large value.     

基于软输出固定复杂度球形译码的高效迭代检测算法

该文在软输出固定复杂度球形译码(SFSD)算法的基础上,提出一种低复杂度高性能的MIMO迭代检测方法。该算法利用迭代过程中译码器的反馈信息更新SFSD检测算法的软输出,获得明显的迭代增益,并利用多级比特映射星座图的特点大大降低分支度量的运算次数。针对SFSD算法预处理复杂度较高的问题,该文将检测顺序调整和QR分解两个预处理步骤相结合,从而减少了矩阵求逆运算。在长期演进方案(LTE)下行链路环境中的仿真结果表明,该文提出的算法性能十分接近最优的最大后验概率(MAP)检测,并且实现复杂度相对于MAP有显著的下降。     

一种MIMO系统中的快速广义复球形解码算法

该文提出了一种广义复球形解码算法。它能处理多输入多输出系统(MIMO)中发送天线多于接收天线的情形,并能同时检测具有格型结构和不具有格型结构的二维空间星座信号。该算法对信号矢量的超定部分进行优化搜索,从而避免了穷尽搜索的高复杂度。仿真结果表明该广义复球形解码算法的复杂度明显低于采用穷尽搜索策略的复杂度。     

An Efficient Software List Sphere Decoder for Polar Codes

Journal of Signal Processing Systems - Polar codes, first achieving the capacity of symmetric binary-input discrete memoryless channels (B-DMCs), have been standardized for eMBB control channels....     

无线MIMO系统中球解码算法的一种改进

简要介绍了无线M IMO(多输入多输出)系统模型,研究了CL以及KCL球解码算法,并对其性能和复杂度进行了比较;重点介绍了CLimp算法,这种近似算法是一种新的低计算量、准最优的球检测算法,并对其性能进行了详细分析。在此基础上,提出了加权KCL与CLimp近似算法结合的JCLimp新算法,仿真结果表明此新算法在与CL算法、CLimp算法误比特率性能近似的情况下,算法复杂度具有一定的优势,证明了JCLimp算法的有效性。     

降低高条件数信道下的球形译码算法复杂度的方法

MIMO系统中,球形译码可以在保证接近ML检测性能的前提下大大降低检测复杂度。但当信道矩阵条件数很高时,球形译码的复杂度仍然会很高。在分析了这一现象的原因后,本文提出了在高层对权值进行合并的一种球形译码算法,因为其减小了译码搜索过程中对树的高层节点的访问的概率,由此降低了搜索复杂度。仿真结果表明,这种算法在低信噪比、高条件数时可以节约20％的浮点运算操作次数。     

突发信道中的Turbo译码结构的研究

在突发信道中,同步误差会显著降低Turbo码的误比特率性能。利用二进制对称信道（BSC）和高斯信道（AWGN）的级联进行信道建模,提出了一种扩展的Turbo译码结构,该结构有效地克服了突发噪声带来的信号相位偏移。仿真结果表明这种方案与传统方法相比,在复杂提高不多的情况下,提高了误比特率性能。     

一种用模拟LSI实现的新型概率解码器的研究

本文利用工作在亚阈值模式的MOS管特性,设计了一种低功耗的模拟电流型乘法器,并以此乘法器为核心,设计了一组利用电流进行概率计算的模拟单元电路.根据这些单元电路,基于最大后验概率算法(MAP),实现了(5,2,3)格码软判决译码的概率解码器.在解码器的输入部分设计了新型的具有流水线结构的串行输入接口.用标准的0.6μm CMOS工艺对解码器进行了性能模拟验证.     

Computing the Average Symbol Error Probability of the MPSK System Having Quadrature Error

When quadrature error exists, the shape of the M‐ary phase shift keying (MPSK) signal constellation becomes skewed‐elliptic. Each MPSK symbol takes on a different symbol error probability (SEP) value. The analytical results presented thus far have been derived from studies which examined the SEP problem assuming that the SEP of each MPSK symbol is equally likely; therefore, those results should not be treated as offering a complete solution. In this letter, we present a new and more complete solution to the SEP problem of MPSK by relaxing the above assumption and finding the expressions for the average as well as individual SEP in the presence of quadrature error.     

Minimum Error Probability Cooperative Relay Design

In wireless networks, user cooperation has been proposed to mitigate the effect of multipath fading channels. Recognizing the connection between cooperative relay with finite alphabet sources and the distributed detection problem, we design relay signaling via channel aware distributed detection theory. Focusing on a wireless relay network composed of a single source-destination pair with L relay nodes, we derive the necessary conditions for optimal relay signaling that minimizes the error probability at the destination node. The derived conditions are person-by-person optimal: each local relay rule is optimized by assuming fixed relay rules at all other relay nodes and fixed decoding rule at the destination node. An iterative algorithm is proposed for finding a set of relay signaling approaches that are simultaneously person-by-person optimal. Numerical examples indicate that the proposed scheme provides performance improvement over the two existing cooperative relay strategies, namely amplify-forward and decode-forward     

Truncation Error Probability in Viterbi Decoding

An upper bound on the bit error probability due to truncation of the path length in Viterbi decoding is obtained for any given convolutional code. This bound is then used to determine the path length at which the additional error probability due to truncation becomes negligible compared to the maximum likelihood decoding error probability. These results are tested by simulation using several short constraint length codes.     

统计置信度应用于误差概率估计

本文介绍利用统计学的方法对元件误码率进行估测。     

The Effect of Bandlimiting Filters on Probability of Error of MSK

Minimum Shift Keying (MSK) is a method of modulation which can be viewed as a special case of Frequency Shift Keying or a special form of Offset Quadrature Phase Shift Keying; therefore, it can be detected either by a discriminator or with a pair of matched filters. In the latter case, the system is optimal, provided there are no bandlimiting filters in the transmitter and receiver. These filters introduce intersymbol interference and hence degrade the performance of the system. In this paper we investigate analytically the effect of a bandlimiting filter in the receiver on the error probability of the system, presenting numerical results when that filter is of the Butterworth type. It is shown that a very simple suboptimal detector outperforms the matched filter detector so long as2W/R_{b} < 1.3, where Rbis the bit rate andWis the single sided 3 dB bandwidth of the bandlimiting filter.     

The Influence of Cycle Slipping on the Error Probability of a PAM Receiver

In this paper, we evaluate the error probability of a PAM receiver, which derives symbol timing from the received waveform by means of a synchronizer. We point out that the conventional way (using the distribution of the synchronizer's modulo-2π- reduced phase error) of evaluating this error probability does not take into account the effect of the synchronizer's cycle slips. We present a correct expression for the error probability, which uses the distribution of the so-called renewal phase. Also, we derive simple but accurate approximations for both the conventional and the correct error probability, which clearly show the influence of the characteristics of the PAM receiver. These approximate expressions indicate that, for a decreasing additive noise level at the receiver input, the conventional error probability becomes vanishingly small, whereas the correct error probability approaches a nonzero value, which is inversely proportional to the mean time between slips. Hence, cycle slipping imposes a (sometimes rather large) lower limit on the attainable error probability.     

关于某些BCH码的不可检错误概率

本文研究了二元对称信道上，某些ＢＣＨ码的不可检错误概率。首先得到了几个重要的不等式。然后证明了纠正两个错误二进制本原ＢＣＨ码的扩展码是最佳检错码。     

Error Probability and Bandwidth of Digital Modulation

The bandwidth in which 99 percent of the power is contained is presented for ASK, QASK, OQASK, PSK, FSK, and MSK. An example is given in which the bandwidth of FSK is one eighth the bandwidth of ASK and of the modulating signal. Error probability is presented for the various types of modulation with various detectors, detector filters and Butterworth receiver filters of orderN = 4orinfty. Comparisons are made between the performance and bandwidth efficiency of the various systems.     

Error Probability Performance of Unbalanced QPSK Receivers

A simple technique for calculating the error probability performance and associated noisy reference loss of practical unbalanced QPSK receivers is presented. The approach is based on expanding the error probability conditioned on the loop phase error φ in a power series in φ and then, keeping only the first few terms of this series, averaging this conditional error probability over the probability density function of φ. Doing so results in an expression for the average error probability which is in the form of a leading term representing the ideal (perfect synchronization references) performance plus a term proportional to the mean-squared crosstalk. Thus, the additional error probability due to noisy synchronization references occurs as an additive term proportional to the mean-squared phase jittersigma_{phi}^{2}directly associated with the receiver's tracking loop. Similar arguments are advanced to give closed-form results for the noisy reference loss itself.