一种改进的LDPC编码FSO-MIMO系统迭代检测解码算法

基于双伽玛(Gamma-Gamma)湍流信道,研究了低 密度奇偶校验码(LDPC)的自由空间光通信多输入多输出(FSO-MIMO)系统迭代检测解码(ID D)算法。针对最优最大后验概率(MAP)算法复杂度高和BP迭代过程 中比特节点后验对数似然比(LLR)震荡现象,结合概率数据辅助(PDA)算法在信号检测中 的良好性能, 提出了一种基于反馈均值的LDPC+PDA系统IDD码算法,采用BP解码方法,经迭代处理,求出 每次内 迭代中比特节点输出的后验信息均值,并将其作为解码器的输出反馈给检测器,从而提高了 解码器传递给 检测器的消息可靠性。仿真结果表明,当误码率(BER)为10－5左右 时,在弱湍流条件下,改进的IDD算法相 对传统的算法具有0.3dB的性能优势;在强湍流条件下,改进的IDD 算法比传统的算法提高了0.65dB 的性能增益。因而,改进的IDD算法能够进一步抑制湍流特别是强湍流的影响,提高了系统 性能。     

部分并行软干扰消除迭代多用户检测算法研究

本文提出了一种基于部分并行干扰消除(PPIC)结构的迭代多用户检测算法,并对基于PPIC的迭代多用户检测器的迭代结构进行了改进.由于PPIC多用户检测器前一级输出的信息的准确度会影响到后一级的检测,所以为了提高基于PPIC的迭代多用户检测器的性能,对PPIC每一级的输出信息结合最大后验概率(MAP)信道译码器单独进行迭代处理,这样就提高了PPIC每一级输出的信息的准确性.该迭代结构可用于其他基于PIC型的迭代多用户检测算法.     

一种高速率的重叠复用传输系统及检测译码性能

该文研究了AWGN信道下重叠时分复用系统(OvTDM)及性能;在此基础上,研究了信道编码的OvTDM系统,并给出了最佳的检测译码算法-最大后验概率准则下的软入软出迭代算法。OvTDM系统与同频谱效率的QAM调制相比较,随着频谱效率的提高显示出性能增益。信道编码的OvTDM系统接收端在最大后验概率(MAP)准则下,检测与译码之间传递软信息进行迭代处理。仿真结果表明,软入软出迭代算法充分利用了符号重叠所自然形成的编码约束关系,获得了最大编码增益。     

一种频选衰落信道下的Turbo多用户检测算法

联合MAP多用户检测与信道解码的迭代多用户检测(MUD)技术可显著提高宽带移动CDMA系统的容量和性能.在多径时变衰落的编码信道下,提出一种迭代实现干扰抑制、符号估计、信道解码的Turbo多用户检测算法.在每次迭代中,MUD自适应地实现干扰抑制并输出符号估计的软信息,软输入软输出的信道解码器使用LOG MAP方法实现信道解码并反馈符号估计的软信息作为下一次TurboMUD迭代的先验信息.仿真结果证实了该算法在频选衰落信道下经两次迭代就能逼近单用户编码CDMA系统的接收性能.     

MIMO系统中基于因子图的联合迭代检测和LDPC译码

本文提出了多输入多输出系统中频率选择性衰落信道下的一种联合迭代检测和LDPC译码的算法,采用因子图的模型将检测器和译码器融合到了一个框架中,通过检测器与译码器两个处理器内部及全局的信息混合调度改善系统性能。与MAP检测比,该算法以较低的复杂度获得良好的性能,因子图检测特有的并行调度在硬件快速实现上更具优势。     

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

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

编码的多载波CDMA系统中Turbo时空多用户检测

联合MAP多用户检测和信道译码的迭代多用户检测技术可显著提高多载波CDMA系统的容量和性能,本文给出了结合智能天线和迭代MAP多用户检测的Turbo时空多用户检测算法,该方法进一步提高了系统的性能.Turbo时空多用户检测算法不仅极大减小了传统最优MAP多用户检测算法的运算量,而且,此算法性能在AWGN和频率选择性衰落信道中都能逼近单用户编码多载波CDMA系统多天线接收的性能.     

基于LDPC编码的MIM0系统迭代接收机研究

研究了基于LDPC编码无线MIMO通信系统中的软输出最小均方误差干扰抵消迭代(MMSE PIC)检测算法.针对初次迭代检测时PIC输出的后验比特对数似然比(LLR)不可靠的问题,利用MMSE滤波器输出的高斯近似表示,给出了基于后验概率估计的迭代干扰抵消检测算法,以提高检测器输出的编码比特对数似然比的可靠性.仿真结果表明:改进的检测算法优于现有算法.     

基于LDPC编码的MIM0系统迭代接收机研究

研究了基于LDPC编码无线MIMO通信系统中的软输出最小均方误差干扰抵消迭代(MMSE PIC)检测算法.针对初次迭代检测时PIC输出的后验比特对数似然比(LLR)不可靠的问题,利用MMSE滤波器输出的高斯近似表示,给出了基于后验概率估计的迭代干扰抵消检测算法,以提高检测器输出的编码比特对数似然比的可靠性.仿真结果表明...     

CPM调制的迭代检测技术

CPM信号具有包络恒定、峰均比小、功率利用率高的优点。针对CPM信号的特征,比较了最大似然序列检测Viterbi算法和逐符号的最大后验概率(MAP)解调算法的特点,重点研究了使用迭代检测技术进行软输入输出解调及译码的MAP解调方法。在AWGN信道条件下对CPM全响应和部分响应信号进行了误码性能仿真,结果表明采用相干解调和译码,迭代检测方案可得到较高的编码增益。     

Complexity-reduced iterative MAP receiver for interference suppression in OFDM-based spatial multiplexing systems

In this paper, we propose a reduced-complexity iterative algorithm for joint maximum a posteriori (MAP) detection and the cochannel interferences (CCIs) suppression in orthogonal frequency-division multiplex (OFDM)-based spatial multiplexing systems, also known as multiple-input-multiple-output systems. The receiver employs an iterative architecture in which each iteration stage consists of channel/covariance estimation for CCIs and MAP detection, which suppresses interference while detecting the data. The interference suppression is performed in the MAP detection by whitening the interferences through a combination of the estimated covariance with the conventional MAP detection metric. Moreover, a complexity-reduction scheme is proposed for implementing an iterative MAP receiver without incurring performance degradation. Extensive simulations have demonstrated that the proposed scheme dramatically improves the performance compared to that of an iterative MAP scheme without interference suppression. The receiver complexity is significantly reduced with negligible performance degradation. Furthermore, it also can effectively suppress not only synchronous CCIs, but also all kinds of asynchronous CCIs without any a priori information on the CCIs.     

An approximate MAP-based iterative receiver for MIMO channels using modified sphere detection

For coded multiple-input multiple-output spatial multiplexing (MIMO-SM) systems, the iterative receiver consisting of the MIMO detector and decoding can provide near optimal performance. While the sphere detection (SD) technique can be employed to implement the MIMO maximum likelihood (ML) detection with a lower complexity, some modifications of the SD have been proposed to provide a soft-decision for iterative receivers. In the paper, we propose an alternative approach that is based on a quadratic cost function to find the maximum a-posteriori (MAP) solution for the MIMO detection. Using the proposed approach, the MAP detection with the soft-decision can be straightforwardly implemented by the SD technique. Compared to the existing approach, in the new scheme, the soft-decision is well defined and it avoids a numerical instability in computing a soft-decision (which is an approximation of the log likelihood ratio (LLR)). Through simulation results, it is shown that the performance of the proposed scheme is comparable to that of the existing approach.     

改进的基于序列列表的MIMO迭代检测算法

该文改进了列表检测算法的列表搜索方法,提出首序列优先的搜索方法,同时提出了一种降低复杂度的迭代检测算法,该算法改变了列表检测基于列表的软信息计算方式,利用半定松弛算法思想采用最大似然测试降低了计算复杂度。仿真结果表明首序列优先检测算法与基本列表算法相比,在复杂度增加很小的情况下取得了更好的性能,提出的迭代检测算法降低了平均计算复杂度,取得了和首序列优先算法相同的性能。     

Turbo greedy multiuser detection

Previously, a novel scheme for iterative multiuser detection and turbo decoding was proposed by Damnjanovic and Vojcic (2000, 2001). In this scheme, multiuser detection and single-user turbo decoding are tightly coupled to maximize the overall gain. The extrinsic probabilities for the coded bits of the interfering users, obtained after each turbo decoding iteration, are used as a priori probabilities in the following multiuser iteration and the extrinsic information for the systematic bits of the desired user is used as a priori information in the next single-user turbo decoding iteration. Turbo decoding of parallel concatenated convolutional codes is carried out in parallel fashion. It has been shown that the proposed detector approaches the multiuser capacity limit within 1 dB in the low signal-to-noise ratio region. However, the main drawback of the scheme is its exponential complexity in the number of users, which is due to the complexity of the maximum a posteriori probability (MAP) multiuser detector. In this paper, we show that the complexity of the scheme can be significantly reduced by replacing the (MAP) multiuser detector with an iterative detector derived from the greedy multiuser detector proposed by AlRustamani and Vojcic (2000). In this paper, we demonstrate that, for both the additive white Gaussian noise and the frequency-nonselective Rayleigh fading, the substantial reduction in complexity of the iterative scheme proposed by Damnjanovic and Vojcic when the greedy detector is utilized introduces a slight degradation in performance     

Reduced-complexity MAP-based iterative multiuser detection for coded multicarrier CDMA systems

In recent years, combining multiuser detection (MUD) and channel decoding has received considerable attention. The maximum a posteriori (MAP) criterion-based iterative multiuser detector greatly improves the system performance and can approach the performance of single-user coded systems. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a medium-to-large number of users. In this paper, a reduced complexity MAP-based iterative MUD based on the use of a soft sensitive bits algorithm is proposed for coded multicarrier code-division multiple-access systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.     

Iterative vector channel estimation/MAP/PIC for CDMA systems in time-selective correlated multipath fading channels

Recently, Gao et al. proposed the expectation-maximization (EM) vector channel estimation for single-user direct-sequence code-division multiple-access (DS-CDMA) systems to estimate the correlated fading channel coefficients of the paths of a user. They also used one D-lag decision-feedback maximum a posteriori (MAP) detector to detect the information bits. A straightforward extension (noniterative) to multiuser synchronous CDMA cases, i.e., adding the parallel interference cancellation (PIC) multiuser detector into their scheme, results in poor performance. Therefore, we propose an iterative scheme which combines vector channel estimation, decision-feedback MAP detection, and PIC. The partial PIC is applied in the sequence hypothesis stage of MAP in each iteration before the final MAP decision. The proposed scheme has twice the decision delay of the previous scheme for single-user cases. The performance of the proposed system in the time-selective, correlated multipath fading channel environment is investigated. Simulation results show that the proposed scheme significantly outperforms the noniterative scheme. Simulation results also show that the proposed scheme performs better than its scalar channel-estimation version.     

Near-Optimum Iterative Multiuser Receiver for FEC Encoded DS-CDMA

The powerful iterative algorithm of Turbo code is employed in the proposed iterative multiuser receiver for the downlink of a forward error correction (FEC) coded direct-sequence code-division multiple access (DS-CDMA) environment. The receiver iterates between the 2 coding dimensions, namely the spreading codes and the FEC codes. The optimum iterative multiuser receiver uses the optimum decentralised single-user detector to generate the single-user extrinsic information for the single-user decoders. This paper suggests a near-optimum detector using a folded trellis preselection stage for the multiuser signal detection, in order to reduce the dominating complexity of the optimum decentralised detector. Simulation results show that performance is close to optimum. The effect of the single-user decoders' extrinsic information on the signal detection stage is also investigated and it is found that extrinsic information improves performance.     

Mismatched decoding of intersymbol interference using a parallelconcatenated scheme

A turbo-type scheme that uses parallel concatenation and soft-output iterative detection is proposed for transmission over linear intersymbol interference channels. When the receiver has perfect knowledge of the channel, the scheme offers only marginal improvement in performance over optimum linear coded modulation with Viterbi or reduced search detection. However, the improvement is significantly higher when the detector is mismatched, i.e., if it uses an imperfect channel estimate. The delay is low since the block sizes are small, and the performance improvement is achieved with few iterations. The technique may be applied as a retransmission strategy in order to save power for systems that suffer from losses due to ISI and channel mismatch     

Iterative multiuser detection for coded CDMA signals in AWGN andfading channels

A new iterative receiver for joint detection and decoding of code division multiple access (CDMA) signals is presented. The new scheme is based on a combination of the minimum mean square error (MMSE) criterion and the turbo processing principle by Hagenauer (see Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, p.1-9, 1997). The complexity of the new scheme is of polynomial order in the number of users. The new scheme is applicable to two situations: (a) when the receiver is capable of decoding the signals from all users and (b) when the receiver is only capable of decoding the signals from a subset of users. In the first scenario, we establish that the proposed receiver achieves superior performance to the iterative soft interference cancellation technique under certain conditions. On the other hand, in the second scenario, we argue that the proposed receiver outperforms both the iterative soft interference canceler and the iterative maximum a posteriori (MAP) receiver because of its superior near-far resistance. For operation over fading channels, the estimation of the complex fading parameters for all users becomes an important ingredient in any multiuser detector. In our scheme, the soft information provided by the decoders is used to enhance this estimation process. Two iterative soft-input channel estimation algorithms are presented: the first is based on the MMSE criterion, and the second is a lower-complexity approximation of the first. The proposed multiuser detection algorithm(s) are suitable for both terrestrial and satellite applications of CDMA     

Turbo Multiuser Detection for TD-CDMA

In this paper the novel detection scheme multi-step joint detection for TD-CDMA mobile radio systems is presented. Multi-step joint detection uses the turbo principle for iteratively improving data detection. Extrinsic information obtained by FEC-decoding in a previous step is used for a joint reduction of interference and improvement of asymptotic efficiency of the linear multiuser detector. Multi-step joint detection helps to overcome the problems of small asymptotic efficiencies present in linear multiuser detectors like the zero forcing equalizer in TD-CDMA mobile radio systems in the case of high system loads. Simultaneously complexity is much lower than that of optimum nonlinear multiuser detectors based on the Viterbi algorithm. As an alternative to simulations the performance of multi-step joint detection can be theoretically determined under certain not too restrictive assumptions. Both approximate and simulative performance results are presented in the paper. It is shown that in typical mobile radio systems the required SNR at the receiver input can be reduced by approximately 10 dB compared to linear multiuser detection. Thus, multi-step joint detection helps to increase the permissible number of mobile stations per cell or to decrease the required cluster size in TD-CDMA mobile radio systems and thus improves spectrum efficiency and capacity.