维特比译码的仿真与实现

维特比译码算法是一种最大似然序列检测的方法,首先分析仿真了在不同判决方式和回溯深度下的维特比译码的性能,得出结论:在无线高斯信道中,维特比译码采用3比特软判决及回溯深度为48的时候,系统能达到最佳的效果;利用上述结论使用Q1900芯片实现了维特比译码。     

DVB—S简介（六）

3.3.5 卷积码的Viterbi译码 如前所述,对于离散无记忆对称信道,L比特的二元码符序列的最大似然译码.就是将2~L个可能发送的码序列与接收的序列逐一比较,选取汉明距离最小的一个(或者说对数似然函数最大的码符)序列作为译码序列输出。显然译码器的计算量随着L     

用可变的软距离门限改进Chase2算法

本文计算了用Chase2算法不可捕获的错误图样的软重量的下限,由此证明了当接收序列到某个码字的软判决距离满足王新梅(1986)提出的广义门限时,该算法与最大似然译码有相同的译码结果。又进一步得出了随接收序列可信度变化的可变门限,可以用来加快软判决译码的速度而不损失译码性能。     

基于预译码的极化码最大似然简化连续消除译码算法

针对极化码译码串行输出造成较大译码时延的问题,该文提出一种基于预译码的最大似然简化连续消除译码算法。首先对译码树节点存储的似然值进行符号提取并分组处理,得到符号向量组;然后比较符号向量组与该节点的某些信息位的取值情况,发现向量组中储存的正负符号分布规律与该节点的中间信息位的取值具有一一对应的关系;在此基础上对组合码中间的1～2 bit进行预译码;最后结合最大似然译码方法估计组合码中的剩余信息位,从而得到最终的译码结果。仿真结果表明:在不影响误码性能的情况下,所提算法与已有的算法相比可有效降低译码时延。     

列表维特比译码算法在TD-SCDMA中的应用

卷积码在各通信系统中广泛使用,其最大似然(ML)译码算法为维特比译码算法(VA)。传统的维特比译码算法(CVA)仅产生一个最佳译码序列,在低信噪比(SNR)或者恶劣环境下,还是会出现较高概率的误判。为了提高译码性能,列表维特比算法(LVA)被提出,LVA可以同时产生L个候选最优幸存路径,对L个候选最优幸存路径分别进行校验比特验证,从而获得CVA更优的性能。在TD-SCDMA中大部分采用卷积编码的业务,文章将LVA应用到该系统中,并与CVA性能和实现复杂度上对比分析。从仿真结果可以看出,该LVA能提高1dB以上的性能增益。     

用可变的软距离门限改进Chase2算法

本文计算了用Ｃｈａｓｅ２算法不可捕获的错误图样的软重量的下降，由此证明了当接收序列到某个码字的软判决距离满足王新梅提出的广义门限时，该算法与最大似然译码有相同的译码结果。又进一步得随接收序列可信度变化的可变门限，可以用来加快软判决译码的速度而不损失译码性能。     

一种基于缩减伴随式集的QC-LDPC码级联译码算法

该文在研究缩减伴随式集译码(RLSD)算法和规则QC-LDPC码字结构的基础上,提出了一种新的针对中短QC-LDPC码的BP-RLSD级联译码算法。BP算法译码失败时的软输出对数信息,作为RLSD算法的输入。根据QC-LDPC码所具有的循环置换结构,给出一种根据伴随式的重量来确定候选错误模式搜索空间的算法,同时给出一种查表方法快速搜索出部分错误位置。结合接收序列的低可信度集合(LRIPs),可以实现最大似然(ML)码字的快速搜索。这些方法可以大幅减少计算时间。仿真显示该文提出的算法是有效的。与BP算法的级联译码,可以在计算复杂度和性能之间进行较好的折衷。     

基于迭代的同频混合信号单通道盲分离/译码算法

针对采用长约束信道编码的同频调制混合信号,提出了一种利用编码的单通道盲分离/译码迭代算法。该算法通过在盲分离过程中利用译码后反馈的符号软信息来改善分离效果,重点研究了软输入软输出盲分离、最大似然概率译码以及分离译码间的软信息交互。仿真结果表明,迭代盲分离算法相比不采用迭代的算法可获得更好的性能,对于采用(2,1,6)卷积码和随机交织的BPSK混合信号,前者进行2次迭代时可获得约2dB的信噪比增益。     

卷积码及维特比译码在卫星通信中的应用

在功率受限的卫星信道中,卷积码与BPSK(或QPSK)结合在一起被看作是可靠通信的一种有效的系统。该文讨论了卫星通信信道特性,介绍了卷积编码、BPSK信号和软判决,给出了卷积码最大似然译码——维特比译码算法。     

一种改进的极化码置信译码器

在极化码置信（ BP）译码的因子图中,当承载确定信息的节点的对数似然信息计算错误时,可以被检测到。此时,对于因子图中参与该似然信息计算的节点,引入一个修正参数,以修正该节点承载的信息的对数似然信息。修正参数可以由密度进化的高斯近似算法得到。给出了置信译码原理及相应的改进算法,最后给出了复杂度分析和性能仿真。数据结果表明,在牺牲很小的复杂度的条件下,相比原算法,修正算法能够获得0.2 dB左右的比特信噪比增益。     

光纤通信中序列估计与纠错译码的级联的研究

使用误码率仿真的方法,比较了基于Viterbi算法(VA)的最大似然序列估计(MLSE)电色散补偿技术和低密度奇偶校验(LDPC)纠错译码技术的VA+BF译码、VA+BP译码简单级联和VA+BP译码置信级联3种级联方法。仿真结果表明,本文提出的置信级联能够有效地判断出VA给出的序列估计值是否可信,并在此基础上进行LDPC译码需要的对数似然比(LLR)信息的初始化。与简单级联方式相比,置信级联的方法能够获得更好的LDPC软译码性能,而且随着光纤传输距离的增加和码间串扰(ISI)效应的恶化,置信级联比简单级联具有更高的性能增益。     

A dynamic programming algorithm for simultaneous phase estimation and data decoding on random-phase channels

The problem of simultaneously estimating phase and decoding data symbols from baseband data is posed. The phase sequence is assumed to be a random sequence on the circle, and the symbols are assumed to be equally likely symbols transmitted over a perfectly equalized channel. A dynamic programming algorithm (Viterbi algorithm) is derived for decoding a maximum {em a posteriori} (MAP) phase-symbol sequence on a finite dimensional phase-symbol trellis. A new and interesting principle of Optimality for simultaneously estimating phase and decoding phase-amplitude coded symbols leads to an efficient two-step decoding procedure for decoding phase-symbol sequences. Simulation results for binary,8-ary phase shift keyed (PSK), and 16-quadrature amplitude shift keyed (QASK) symbol sets transmitted over random walk and sinusoidal jitter channels are presented and compared with results one may obtain with a decision-directed algorithm or with the binary Viterbi algorithm introduced by Ungerboeck. When phase fluctuations are severe and when occasional large phase fluctuations exist, MAP phase-symbol sequence decoding on circles is superior to Ungerboeck's technique, which in turn is superior to decision-directed techniques.     

Simultaneous Phase Tracking and Detection in Data Transmission Over Noisy Dispersive Channels

A new technique, related to the Viterbi algorithm for simultaneous phase jitter tracking and data detection of signals transmitted over the dispersive channel with Gaussian noise is proposed. This technique produces a reliable phase estimate and avoids the poor receiver performance which occurs with Viterbi decoding in the presence of phase jitter due to the use of a phase estimate derived from unreliable preliminary decisions. The effectiveness of this approach is demonstrated through computer simulation of the voiceband channel. It was found that for the case of a typical meeting the combined requirements ofC2andD1conditioning and signaled at 14,400 bits/s, no errors were experienced in a computer simulation run of 2000 symbols compared to a previous run with a less sophisticated phase tracking algorithm which experienced 17 errors in 2000 symbols.     

Erased-Chase decoding for RS-coded MPSK signaling over a Rayleigh fading channel

In this paper, a novel dual-metric, the maximum and minimum Squared Euclidean Distance Increment （SEDI） Brought by changing the hard decision symbol, is introduced to measure the reliability of the received M-ary Phase Shift Keying （MPSK） symbols over a Rayleigh fading channel. Based on the dual-metric, a Chase-type soft decoding algorithm, which is called erased-Chase algorithm, is developed for Reed-Solomon （RS） coded MPSK schemes. The proposed algorithm treats the unreliable symbols with small maximum SEDI as erasures, and tests the non-erased unreliable symbols with small minimum SEDI as the Chase-2 algorithm does. By introducing optimality test into the decoding procedure, much more reduction in the decoding complexity can be achieved. Simulation results of the RS（63, 42, 22）-coded 8-PSK scheme over a Rayleigh fading channel show that the proposed algorithm provides a very efficient tradeoff between the decoding complexity and the error performance. Finally, an adaptive scheme for the number of erasures is introduced into the decoding algorithm.     

MB-OFDM UWB通信空时网格编码误码率分析

 本文研究多带正交频分复用瑞利衰落信道中,空时网格编码发射天线间空间相关性的分集性能.空时网格编码将单个输出的编码符号转换成多个编码符号,并通过多个发射天线传输,在接收端,Viterbi优化软判决算法用于译码.我们分析了MB-OFDM系统在quasi-static和interleaved两种信道中相关空间衰落对误码率的影响.在空间相关性较小时,分集阶数能得到保持;而在空间相关性较大时,interleaved信道能保持分集阶数,quasi-static信道的分集阶数将减小.空时编码总体上对空间相关性表现出鲁棒性.     

Signal editing: A new approach to upgrade concatenated coding communications

Based on the property that correction coding is more sensitive to the number of errors than the number of erased code symbols, results of an analytical investigation to improve the performance of concatenated coding communications are presented. We propose a new tactic, ‘signal editing’, to estimate and erase unreliable data prior to the final outer decoding process. We show that signal editing has a capability to detect and delete individual erroneous digits that has not been achieved by other methods. As a result, system performance can be markedly improved. Specific recommendations for using the procedure are suggested and discussed. We illustrate how signal editing is implemented in the case of a convolutional code with Viterbi decoding. A new concatenated (or hybrid) coding technique is constructed integrating the code with interleaving and signal editing. Performance improvement is evaluated and analysed. In this study, signal editing is derived from the information available in the Viterbi decoding process. Not limited to convolutional code with Viterbi decoding, signal editing can be applied to other linear codes without any restriction.     

新型LT码编译码方法及其在认知无线电中的应用

Luby变换(LT)码作为一种抗干扰编码技术,应用于认知无线电系统,可提高次用户数据传输的可靠性。编译码是影响LT码抗干扰性能的关键因素。为提高数据传输的可靠性和速度,该文提出一种适用于认知无线电系统的LT码联合泊松鲁棒孤子分布-叠层(CPRSD-H)编译码算法。编码过程中,编码器首先采用CPRSD进行编码产生编码分组和编码矩阵,随后通过编码矩阵中度数为1和度数为2对应的列向量携带双层信息:度数为1和度数为2的编码分组和与其相连接的输入分组的连接关系;部分原始数据信息。译码过程中,译码器首先通过第1层存储信息采用置信传播(BP)算法译码完成,随后一些未被成功译出的信息再通过第2层存储信息进行填补。仿真结果表明,将CPRSD-H编译码算法应用于认知无线电系统中,能够显著降低LT码的误比特率(BER),提高次用户有效吞吐量以及加快LT码编译码速度。     

小波编码图像联合信源信道解码算法的研究

为提高图像在噪声信道中传输的可靠性,该文提出了一种图像联合信源信道解码方案。信源图像首先经离散小波变换,压缩编码。编码数据经RCPC(率兼容删余卷积码)信道编码保护,通过噪声信道传输。在接收端的改进的APRI-SOVA (先验信息软输出维特比算法)在信道解码时,不仅利用了信道输出的软判决,而且进一步利用了信源解码器提供的当前解码的比特的可靠性信息。仿真结果显示,有效利用信源数据中遗留的相关性,能够实现图像解码质量的提高。     

Hybrid Iterative Decoding for Low-Density Parity-Check Codes Based on Finite Geometries

In this letter, a two-stage hybrid iterative decoding algorithm which combines two iterative decoding algorithms is proposed to reduce the computational complexity of finite geometry low-density parity-check (FG-LDPC) codes. We introduce a fast weighted bit-flipping (WBF) decoding algorithm for the first stage decoding. If the first stage decoding fails, the decoding is continued by the powerful belief propagation (BP) algorithm. The proposed hybrid decoding algorithm greatly reduces the computational complexity while maintains the same performance compared to that of using the BP algorithm only.