分组相关快衰落信道下自适应Turbo码译码算法研究

分析了分组相关快衰落信道的特性，推导出该信道下Turbo码译码算法；研究了迭代次数对Turbo编码系统的影响，在小信噪比弥散度条件下，提出基于平均信噪比的最佳迭代译码次数自适应选择方案，可以兼顾译码性能和译码速度，得到较低的平均误比特率和较高的平均译码速度。仿真结果说明，本文提出的Turbo码译码算法，降低了对信道估计精度要求的同时，得到精确信道估计时的性能；对于目标误比特率为10^-4时，采用自适应Turbo译码算法，与固定迭代4次相比，平均误比特率降低了40％，提高了系统性能；而与固定迭代8次相比，迭代次数降低了约1／4，提高了译码速度。     

低莱斯因子衰落信道下的Turbo码性能研究

基于Turbo码编译码技术,在Rician衰落信道模型下,详细研究了Turbo码Log-MAP译码算法和SOVA译码算法在低Rician因子衰落信道下的性能,并结合调制技术对整个编译码系统进行Matlab仿真。仿真结果表明,在低Rician因子信道下,Log-MAP译码算法的性能优于SOVA译码算法。     

Turbo码联合信道估计在瑞利衰落信道中的运用

如果将信道衰落信息提供给Turbo译码器,则在瑞利衰落信道下更能发挥Turbo码的优良特性。该文分析了在瑞利衰落信道下Turbo译码算法,用Jake方法模拟瑞利衰落信道,采用将多时隙加权平均(WMSA)信道估计和Turbo码结合起来的算法。仿真结果显示此系统性能优异。     

Turbo编码MIMO-OFDM系统中的EM迭代信道估计

该文对频率选择性衰落信道条件下的Turbo编码多入多出正交频分复用(MIMO-OFDM)系统的信道估计进行了研究,提出了一种将Turbo迭代译码与EM迭代信道估计相结合的方法。采用该方法的EM迭代信道估计性能得到了明显提高,且适合于非常恶劣的信道环境。另外,通过仿真可知,利用EM迭代信道估计算法的系统性能优于利用简化的最小二乘(LS)信道估计算法所获得的系统性能。     

基于判决反馈的TurboDPSK

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

瑞利衰落信道下的Turbo均衡

Turbo均衡是一种将Turbo原理和均衡技术结合起来的技术。他通过反复均衡和信道译码来提高接收机性能。针时瑞利衰落信道，采用基于线性滤波器的软输入／软输出均衡器来消除码间干扰，其系数由最小均方误差准则确定。译码器采用最大后验概率算法时卷积码译码。考虑到瑞利衰落信道为随机信道，用非相干检测时信道进行估计。接收机通过联合均衡和译码以充分利用已经获得的信息，实现信道估计及信道均衡与信道译码的迭代更新。仿真结果表明其性能不仅远远优于非迭代系统．而且在信噪比高于4dB时几乎可以完全消除符号间干扰的影响，与MAPSE相比其复杂度大大降低。     

抗相位噪声迭代译码简化算法的性能分析

研究了在频率非选择性慢衰落信道中多符号非相干迭代译码方案,分析了已知衰落信道状态信息的简化抗相位噪声译码算法,并给出了性能仿真结果。     

卷积LDPC码在瑞利信道下的性能分析

本文研究了卷积LDPC码在瑞利衰落信道下的译码性能,给出了瑞利信道下,卷积LDPC码的译码算法,在同等条件下对比了卷积LDPC码在高斯信道和瑞利衰落信道下的译码性能。     

衰落信道下基于线性预测的迭代解调及译码技术:Turbo DPSK

本文针对移动通信中常见的衰落信道的特点,提出了一种基于信道增益线性估计的Turbo DPSK解调、译码技术.其特点是在进行信道增益的线性估计时无需知道信道的自相关函数,可简化接收机的复杂度.同时在系统中引入Per-Survivor Process(PSP)和迭代译码技术,充分利用每次迭代后的信息进一步提高系统的性能.计算机仿真表明,采用这种基于线性信道估计的Turbo DPSK系统有很好的抗衰落性能.     

一种无线信道状态估计新算法

在实践中,Nakagami衰落信道下的信道状态的估值算法在很多最优化的信号处理技术中都是必需的。该文根据高阶统计量的分析提出一种简单有效的信噪比估值算法,而且首次提出了Nakagami衰落信道下的全盲信道状态估值算法,同时通过进行信道状态估值对turbo码译码精度的灵敏性仿真测试证明了新算法的有效性。     

基于天线阵元功率限制MIMO系统的自适应调制

本文研究了天线阵元的发射功率受限MIMO系统。在信道准静态和系统发端已知信道信息的假设下,我们研究了该受限MIMO系统性能。在系统优化分析基础上,设计了一种简单的Bit分配方案进行系统自适应调制逼近系统容量。仿真结果表明该系统能更好接近真实环境,调制方案有较好性能。     

OFDM系统中基于分组导频的迭代信道估计算法

对OFDM系统中由于信道的时变性产生的载波间干扰进行了分析,并在此基础上提出了一种分组导频结构的DFT迭代信道估计算法。与原有的信道估计算法相比,此种算法不仅在一般的信道条件下具有良好的性能,而且更加适合快变信道条件下的OFDM系统。仿真结果表明:提出的OFDM信道估计算法不仅可以给出精度较高的信道信息,而且近似达到理想信道估计的性能。     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.     

BEM-based SISO detection of orthogonal space-time block codes over frequency flat-fading channels

The expectation-maximization algorithm for maximum a posteriori (MAP) estimation of a random vector is applied to the problem of detection of orthogonal space-time block codes over time-selective Rayleigh fading channels. This results in a soft-in soft-out detection algorithm suitable for iterative detection/decoding schemes. Simulation results show that the error performance of the proposed detection algorithm is very close to that of a MAP detector endowed with an ideal knowledge of the channel state if the fading rate is not too fast.     

一种OFDM导频的信道估计算法的研究

提出了一种基于编码的OFDM系统的导频符号迭代辅助信道估计。利用信道解码器中的APP符号来形成虚拟的导频。与原有的信道估计算法相比,此种算法不仅在一般的信道条件下具有良好的性能,而且更加适合快变信道条件下的OFDM系统。仿真结果表明:提出的OFDM信道估计算法不仅可以给出精度较高的信道信息,而且近似达到EM信道估计的性能。     

异步垂直空时结构中的功率扩展技术

在平坦衰落信道中,针对异步垂直贝尔实验室空时结构(V-BLAST)信号模型下,现有线性最佳检测算法误码率性能随信噪比提高改善缓慢的问题,提出一种基于功率扩展的迭代检测方法:发射端用功率扩展将发射信号扩展到整个空时信号块上,接收端进行基于功率扩展的迭代检测。同时,分析了所提方法在每次迭代检测后的误码率性能。分析和仿真验证了误码率性能的改进。在4发4收场景下,误码率为10-5时,相比于线性最优最小均方误差(MMSE)方法,获得了约6dB信噪比增益。     

Soft Decoding Assisted SNR Estimation Under Block Fading Channels for Orthogonal Modulations

The performance of the coded orthogonal modulation (OM) system under slow fading channels heavily depends on the estimation of the signal-to-noise ratio (SNR), including the fading amplitude and the noise spectral density. However, a relatively long packet of pilot symbols is often required to guarantee the accuracy of the SNR estimation, which makes it impractical in some situations. To address this problem, this paper proposes an iterative SNR estimation algorithm using the soft decoding information based on the expectation-maximization algorithm. In the proposed method, a joint iterative loop between the SNR estimator and decoder is performed, where the extrinsic information generated by the soft decoder is employed to enhance the estimation accuracy and the SNR estimated by the estimator is used to generate the soft information to the decoder. Also, no pilot symbols are needed to estimate the SNR in the proposed estimator. The Cramer–Rao lower bound (CRLB) of fully data-aided (FDA) estimation is derived to works as the final benchmark. The performance of the proposed algorithm is evaluated in terms of the normalized mean square errors (NMSEs) and the bit error rates (BERs) under block fading channels. Simulation results indicate that the NMSE of the proposed estimator reaches the CRLB of the FDA estimator and outperforms that of the approximate ML (ML-A) estimator proposed by Hassan et al. by 4.1 dB. The BER performance of coded OM system with the proposed estimation algorithm is close to the ideal case where the channel fading and the noise spectral density are known at the receiver.     

LDPC-Coded Cooperation with Receive Multi-Antenna and Unknown CSI in the Destination

This paper studies a coded cooperation scheme with receive multi-antenna in the destination. A kind of simple-encoding irregular systematic low-density-parity-check (LDPC) codes is applied to the scheme. For Rayleigh block fading channels, in the unknown channel state information scenario, space-based adaptive least-mean square (LMS) transversal filters are adopted in the destination to realize receive diversity gain. The filtered signals from the source and relay are decoded by a joint “Min-Sum” iterative decoding algorithm. This algorithm agrees with the bilayer Tanner graph that can be used to fully characterize two distinct irregular systematic LDPC codes employed by the source and relay. Simulation results verify the effectiveness of the space-based adaptive LMS transversal filters in the coded cooperation scheme. Meanwhile, theoretical analysis and numerical simulation show that the proposed coded cooperation scheme can well combine cooperation diversity, multi-receive diversity and channel coding gains, and clearly outperforms the coded non-cooperation one under the same conditions.     

An iterative receiver for turbo-coded pilot-assisted modulation infading channels

We introduce an iterative joint channel and data estimation receiver that exploits both the power of pilot-symbol assisted modulation (PSAM) and turbo coding for fading channels. The key innovation is a low-complexity soft channel estimator which divides a processing block into overlapped cells and performs maximum a posteriori (MAP) sequence estimation and MMSE filtering based on the received signal and extrinsic information delivered by the soft channel decoder. Simulation results show that for turbo-coded PSAM systems under time-variant fading the proposed receiver offers significant performance gains over a non-iterative receiver and two other cancellation schemes     

Pilot symbol initiated sub-optimal sequence estimation algorithmfor QAM signals

A sub-optimal decision directed decoding algorithm based on the expectation-maximisation algorithm is proposed. The algorithm performs iterative sequence estimation assuming quadrature amplitude modulation signals in a frequency non-selective fading channel. The iteration begins using periodically inserted pilot symbols, and it was observed that the algorithm converges mostly within two iterations. The bit error rate performances of the proposed algorithm are evaluated using computer simulation. The results show that the proposed algorithm performs better than conventional schemes