未知相位信道下Turbo码编码DPSK信号的联合迭代解调码

本文提出了未知位信道下Turbo码编码DPSK信号的联合迭代解调解码算法。推导了未知相位信道的最大后验概率（MAP）算法，推导表明该MAP算法同样可用前向、后向递推方程来有效实现。其次，采用等效信道的方法将未知相位信道的Turbo码解码问题化为AWGN信道下Turbo码的解码问题。最后，引进了联合迭代解调解码算法，可用于Turbo码的解调解码。模拟表明本文算法可有效用于未知相应信道Turbo码的解码。     

在未知信道条件下基于MUSIC算法的Turbo码解码

在相位和频偏等信道参数未知条件下，Turbo码的解码性能急剧恶化。本文将存在频偏的接收信号等效为高斯白噪声中的正弦信号，提出了一种基于MUSIC算法的信道参数估计算法，并在Turbo码解码中对信道参数进行联合迭代估计。仿真结果表明基于MUSIC算法的Turbo码联合迭代解码的良好性能。     

串行级联连续相位调制系统的联合解调解码研究

本文结合连续相位调制的分解,对串行级联连续相位调制系统的联合迭代解调解码进行了研究。连续相位调制的分解包括一个连续相位编码器和一个无记忆调制器,它和外部卷积码通过交织器相连形成Turbo码的串行级联结构。应用SOVA算法,本文给出了串行级联连续相位调制系统的联合解调解码的迭代算法,并进行了仿真分析。     

CDMA 2000 1xEV-DO前向链路调制与编码技术

1xEV-DO是CDMA 2000针对数据业务的增强系统.为提高数据传输速率,1xEV-DO前向链路引入了8PSK和16QAM这样的高阶调制以及Turbo码.本文在简要介绍CDMA 2000 1xEV-DO系统前向链路的基础上,着重研究了相应的调制与编码技术.文中以16QAM为例推导了MAP,Log-MAP及Max-Log-MAP软解调算法,另外还说明了Turbo解码器如何针对软信息输入做必要的修改,最后通过在不同信道下1xEV-DO系统前向链路仿真分析了解调和解码算法的性能.     

AWGN信道下Turbo码解码算法的选择

在加性高斯白噪声（AWGN）信道下,采用最大后验概率(MAP)算法的Turbo码解码是误比特率最低的算法。为了降低运算量实现快速解码,Log-MAP算法、Max-Log-Map算法和线性Max-Log-Map算法分别对MAP算法进行了不同程度的简化。本文简单介绍了基于MAP算法的Turbo码解码原理,从纠正函数的角度出发归纳和比较了三种MAP类简化算法,通过纠正函数从理论上对算法性能以及对信噪比估计误差的敏感度进行了分析,对分析结果进行了仿真验证。综合解码性能和运算量,提出了Turbo码解码的算法选择方案,以及实用,简易的Turbo码解码参数设置建议。      

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

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

BCH-Turbo码的设计与仿真实现

本文针对Turbo码在低信噪比下迭代次数多、译码时延长问题,在分析了Turbo码的编译码原理和算法基础上,提出一种可以有效降低平均迭代次数、减少译码时延的基于BCH迭代停止准则的Turbo码迭代译码的设计方案.本方案采用BCH码作为Turbo迭代译码的停止准则,并对每一个分量译码器结果都进行判断,可提前停止迭代.通过Monte Carlo仿真表明在AWGN信道下,误码率有所降低,Turbo码译码的平均迭代次数与交叉熵准则相比有明显下降.本文还分析了BCH码编码效率和分组长度的选择对系统性能的影响.     

频选快衰落信道的Turbo均衡算法

针对频选快衰落信道,本文提出卡尔曼滤波信道跟踪、软输出判决反馈均衡及软输入软输出信道解码迭代处理的Turbo均衡算法以充分利用已获得的信息,实现信道估计、信道均衡与信道解码的迭代更新,并克服传统判决反馈均衡器误差传播的缺陷.仿真表明,本算法能有效地跟踪快衰落信道,经两次迭代就可获得较为满意的码间干扰消除效果.     

Turbo码概率-代数联合解码算法

Turbo码采用修正的BAHL et al.算法实现解码.这是一种基于软值的概率迭代解码算法.本文在保持Turbo码迭代软解码算法优点的基础上,充分利用Turbo码编码器结构这一确知条件,结合代数解码原理,提出了一种Turbo码概率-代数联合解码算法.该算法结合了概率解码和代数解码的优点,又有效避免了误差传播的发生,使Turbo码的纠错性能在原经典算法的基础上得到进一步的提高.该算法不仅为降低Turbo码的比特误码率和误差地板值提供了一种新的研究途径,而且因其更好的纠错性能而具有十分明显的实用价值.仿真实验结果显示,在比特误码率(BER)为10^-3~10^-4时,与经典Turbo码解码算法相比,采用该算法能获得0.1dB左右的编码增益.     

RS-Turbo级联码在DVB-T信道中的仿真分析

文中首先描述了OFDM在数字通信中的应用,接着介绍了Reed Solomon(RS)编码,重点研究了Turbo码及其解码算法,提出了一种应用Turbo码和Rs码的级联码结合OFDM调制的前向纠错方案,分析了该方案用于数字视频广播地面信道(DVB-T)的性能.通过在加性高斯白噪声(Addittve White Gaussian Noisc,AWGN)信道上的仿真,验证了该方案比目前DVB-T标准中的卷积码方案有更好的性能.仿真结果表明,应用Turbo码仅在解码迭代次数增加几次的情况下,系统性能有显著的提高.     

CPM调制的迭代检测技术

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

Symbol-by-symbol MAP demodulation of CPM and PSK signals onRayleigh flat-fading channels

Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified. It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the weights of all paths through the trellis which pass through that branch, and that this generic computational problem can be solved efficiently by an approach that uses a forward and backward recursion through the trellis. Simulation results are presented which show both the hard and soft decision performance of the MAP receiver to be robust, even in the presence of fade rates of up to 30% of the symbol rate. The application of the receiver concept to phase-shift keying (PSK) signals is also discussed, and then evaluated via simulation. The concept of joint demodulation and decoding using iterative processing techniques is introduced. It is shown that the MAP receiver is well suited for iterative processing applications due to its use of a priori symbol probabilities and its production of optimal soft decisions. Simulation results for the reception of quaternary PSK (QPSK) show that the bit error rate (BER) performance of the iterative MAP receiver can approach that of a receiver operating with perfect knowledge of the fading process     

A BEM-based detector for CPM signals transmitted over frequency-flat fading channels

In this paper, the expectation-maximization (EM) algorithm for maximum a posteriori (MAP) estimation of a random vector is applied to the problem of symbol detection for continuous phase modulation signals transmitted 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 provided by the proposed solution is very close to that of a MAP detector endowed with an ideal knowledge of the channel state both in uncoded and coded transmissions.     

Joint iterative channel estimation and decoding in flat correlatedRayleigh fading

This paper addresses the design and performance evaluation with respect to capacity of M-PSK turbo-coded systems operating in frequency-flat time-selective Rayleigh fading. The receiver jointly performs channel estimation and turbo decoding, allowing the two processes to benefit from each other. To this end, we introduce a suitable Markov model with a finite number of states, designed to approximate both the values and the statistical properties of the correlated flat fading channel phase, which poses a more severe challenge to PSK transmission than amplitude hiding. Then, the forward-backward algorithm determines both the maximum a posteriori probability (MAP) value for each symbol in the data sequence and the MAP channel phase in each iteration. Simulations show good performance in standard correlated Rayleigh fading channels. A sequence of progressively tighter upper bounds to the capacity of a simplified Markov-phase channel is derived, and performance of a turbo code with joint iterative channel estimation and decoding is demonstrated to approach these capacity bounds     

Joint source-channel coding using combined TCQ/CPM: iterative decoding

An iterative decoding approach to joint source and channel coding (JSCC) using combined trellis-coded quantization (TCQ) and continuous phase modulation (CPM) is proposed. The channel is assumed to be the additive white Gaussian noise channel. This iterative procedure exploits the structure of the TCQ encoder and the continuous phase modulator. The performance in terms of the signal-to-distortion ratio (SDR) is compared with that of a combined TCQ/trellis-coded modulation (TCM) system. It is shown that the combined TCQ/CPM systems are both power- and bandwidth-efficient, compared with the combined TCQ/TCM system. For source encoding rate R=2 b/sample, it is observed that the combined TCQ/CPM systems with iterative decoding working at symbol level converge faster than the systems working at bit level. The novelty of this work is the use of a soft decoder and an iterative decoding algorithm for TCQ-based JSCC systems. The combined TCQ/CPM with iterative decoding is considered for the first time.     

基于判决反馈的TurboDPSK

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

基于纠错算术码的信源信道自适应联合编解码系统

对信源信道自适应联合编码方法进行了研究,提出了一种新的基于纠错算术码的联合信源信道编解码系统。该系统在编码端利用算术码内嵌禁用符号实现信源信道一体式编码,即利用马尔科夫信源模型和根据信道状态信息自适应地调整禁用符号概率大小从而调整编码码率来实现信道自适应;在解码端,推导出了基于MAP的解码测度数学公式并基于此测度公式提出了一种改进的堆栈序列估计算法。与传统的信道自适应编码算法不同,该自适应编码算法只需调整一个参数:禁用符号,且理论上可获得连续可变的编码码率。实验结果表明,与经典的Grangetto联合编码系统以及分离编码系统相比,所提出的编码系统具有明显改善的性能增益。     

瑞利衰落信道下的Turbo均衡

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

Doubly Iterative Equalization of Continuous-Phase Modulation

In this paper, a doubly iterative receiver is proposed for joint turbo equalization, demodulation, and decoding of coded binary continuous-phase modulation (CPM) in multipath fading channels. The proposed receiver consists of three soft-input soft-output (SISO) blocks: a front-end soft-information-aided minimum mean square error (MMSE) equalizer followed by a CPM demodulator and a back-end channel decoder. The MMSE equalizer, combined with an a priori soft-interference canceler (SIC) and an a posteriori probability mapper, forms a SISO processor suitable for iterative processing that considers discrete-time CPM symbols which belong to a finite alphabet. The SISO CPM demodulator and the SISO channel decoder are both implemented by the a posteriori probability algorithm. The proposed doubly iterative receiver has a central demodulator coupled with both the front-end equalizer and the back-end channel decoder. A few back-end demodulation/decoding iterations are performed for each equalization iteration so as to improve the a priori information for the equalizer. As presented in the extrinsic information transfer (EXIT) chart analysis and simulation results for different multipath fading channels, this provides not only faster convergence to low bit error rates, but also lower computational complexity.     

MLSE and soft-output equalization for trellis-coded continuousphase modulation

This paper presents two equalizer structures for trellis-coded continuous phase modulation (TC-CPM) on multipath fading intersymbol interference (ISI) channels. An equivalent discrete-time (DT) model is developed by combining the tapped-delay-line (TDL) model of the frequency-selective channel and by oversampling at the receiver. The (noninterleaved) fractionally spaced maximum-likelihood sequence estimation (MLSE) equalizer performs continuous phase modulation (CPM) demodulation, trellis-coded modulation (TCM) decoding, and channel equalization by exploiting the finite state nature of the ISI-corrupted TC-CPM signal. Both simulation and analytical results show diversity-like improvement when performing joint MLSE decoding and equalization. For the interleaved soft-output equalizer, the soft symbol metric is delivered to the TCM decoder by using a forward and backward recursion algorithm. Three variants of the soft-output equalizer are examined. We conclude that the backward recursion is essential to partial response CPM schemes, and with moderate complexity, the soft-output equalizer can have a substantial advantage over a noninterleaved MLSE equalizer