基于因子图的同频数字混合信号单通道盲分离

本文针对复杂编码下同频数字调制混合信号单通道盲分离问题,构建了利用因子图设计盲分离算法的统一框架。通过将和积消息传递算法与ECM参数估计算法有机地结合,提出一种基于因子图的编码辅助同频混合信号单通道盲分离算法。确定了在最大似然准则下混合信号同步参数的估计式。利用广义分配率准则,为存在码间干扰的混合信号建立了合理的因子图模型,得到了符号序列的后验概率估计式。仿真结果表明,本文提出的算法不仅能够对卷积码混合信号取得较好的分离性能,还能有效实现对LDPC码等复杂编码混合信号的参数和序列的联合估计。     

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

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

单通道混合信号盲分离算法

介绍了单通道混合信号的概念及盲源分离的现状,对实时线性混叠盲分离方法展开研究,分类探讨基于变换域滤波、多参数联合估计、符号序列与信道参数联合估计以及多维映射的单通道混合信号盲分离方法,分析比较各类盲源分离方法的处理对象、前提条件和优缺点,并进行了总结.最后通过仿真实验分析了基于粒子滤波与编码辅助的单通道盲分离方法中粒子数目、编码方式、源信号幅度比和频差等对分离算法性能的影响.     

一种同频重叠信号自适应盲分离算法

针对同频重叠信号的单通道盲分离问题,提出了一种自校正频偏和调整幸存路径数目的盲分离算法。针对两路QPSK信号同频重叠的且存在频率漂移等单通道信号盲分离,推导了基于过采样的信道参数估计模型,利用纠错编码的方法降低误码率,利用指数加权递归最小二乘法(RLS)估计信道参数,并利用估计出的信道参数校正频率漂移等带来的频率偏差,通过在逐幸存路径(PSP)算法调整幸存路径数目解决信道参数收敛和计算复杂度之间的矛盾,提高了频率漂移等变化信道下的参数估计性能,并降低了计算量。仿真结果表明,该算法能够较好地实现频偏自校正,弥补频率漂移带来的影响,同时可以大幅度降低计算量。     

基于EMD和ICA的单通道语音盲源分离算法

针对单通道语音信号盲分离的问题,结合盲源分离和经验模式分解的优点．提出了一种基于经验模式分解的单通道语音信号源数估计和盲源分离方法。对语音混合信号进行经验模式分解,利用贝叶斯算法估计语音源数目,根据源信号数目重组多通道语音混合信号,并采用独立分量分析实现语音信号的盲分离。仿真实验表明,使用此法能有效地估计通道语音信号源数和分离盲源。     

Kalman滤波下的多信号单通道盲源分离

窄带物联网环境中,接收机收到的信号通常为多路混合信号,对单通道接收来说,利用常规盲源分离方法很难实现混合信号的分离和源信号提取。针对这一问题,本文提出了一种利用Kalman滤波算法进行信号估计,解决单通道盲源分离的方法。该方法利用信号间的时序结构,通过Kalman滤波算法对多信号混合中的源信号不断估计并迭代更新,最终得到分离信号。仿真实验结果表明,该方法能有效估计并分离出源信号。      

连续相位调制信号的单通道盲分离算法研究

频谱紧凑的恒包络数字调制技术是未来数字通信的发展方向之一,而对于这类调制信号的单通道盲分离研究目前还较为少见,有效地解决连续相位调制信号的单通道盲分离问题具有较大意义。本文基于最优贝叶斯估计准则,通过重要性函数来接近系统状态的真实后验概率分布,利用改进的粒子滤波算法将连续相位调制信号的单通道盲分离问题转变为码元序列和未知参数序贯估计问题,从而实现盲分离。该算法通过对接收信号的过采样以及数据的递归调用,利用了更多的接收波形信息,有效地抑制了噪声的影响,并能克服相位连续性给算法带来的码间串扰。仿真实验以应用广泛的GMSK调制信号为例。实验结果表明,该算法明显优于标准粒子滤波算法,具有较好的符号估计性能和参数收敛性能。      

应用判决反馈的混合信号单通道盲分离算法

该文提出了一种基于判决反馈思想的DF-PSP单通道盲分离算法。该算法结合判决反馈的思想,利用Viterbi序列检测器最可能的幸存序列得到的预判决来合成信道冲激响应尾部造成的符号串扰,来弥补现有PSP单通道盲分离算法对信道冲激响应进行截断处理而带来的性能损失。仿真结果表明,对于两路混合QPSK信号,该算法较截断PSP单通道盲分离算法在复杂度相当的条件下有更好的性能,在误码率为 时,信噪比改善可达到2dB左右,且在同等过采样条件下,该算法能获得更好的性能提升。      

单通道下基于盲源分离扩频通信抗干扰算法研究

提出了单通道下基于盲源分离的扩频通信抗干扰方法.所提方法利用扩频序列的周期性,把单通道下的欠定盲源分离问题转换成超定盲源分离问题.算法从整体域统计特性对于扰信号进行估计抵消,同时在抗干扰的过程中完成了解扩.从原理上讲,这种抗干扰方法比目前常用的单通道下基于局部域特性的抗干扰方法具有更好的性能.理论分析和仿真结果表明了算法的有效性.     

基于SIC的单通道同频混合信号低复杂度盲分离算法

针对非协作通信中单通道同频混合信号盲分离算法复杂度高的问题,本文在连续干扰抵消（Serial Interference Cancellation, SIC）算法基础上,构建了单通道同频混合信号的信道接收模型,提出了基于SIC的低复杂度盲分离算法。并对信道重构中的信道截断影响进行了处理,避免了分离性能的损失。仿真结果表明,QPSK调制方式下分离性能与已有算法性能相当,但复杂度降低了2/3,且算法对频偏误差不敏感。      

Joint coding-precoding with low-complexity turbo-decoding

We combine error-control coding with linear precoding (LP) for flat-fading channels, as well as for wireless orthogonal frequency-division multiplexing transmissions through frequency-selective fading channels. The performance is analyzed and compared with the corresponding error-control-coded system without precoding. By wedding LP with conventional error-control coding, the diversity order becomes equal to the error-control code's minimum Hamming distance times the precoder size. We also derive a low-complexity turbo-decoding algorithm for joint coded-precoded transmissions. We analyze the decoding complexity and compare it with an error-control-coded system without LP. Extensive simulations with convolutional and turbo codes for HiperLan/2 channels support the analysis and demonstrate superior performance of the proposed system.     

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

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

Implementing the Viterbi algorithm

The Viterbi algorithm, an application of dynamic programming, is widely used for estimation and detection problems in digital communications and signal processing. It is used to detect signals in communication channels with memory, and to decode sequential error-control codes that are used to enhance the performance of digital communication systems. The Viterbi algorithm is also used in speech and character recognition tasks where the speech signals or characters are modeled by hidden Markov models. The article explains the basics of the Viterbi algorithm as applied to systems in digital communication systems, and speech and character recognition. It also focuses on the operations and the practical memory requirements to implement the Viterbi algorithm in real-time     

一种基于缩减栅格算法的SVC联合信源/信道编码方法

 针对H.264/AVC可分级编码扩充标准(SVC),本文提出了一种联合信源/信道编码(JSCC)的视频传输方法.该方法采用一种新型的缩减栅格算法与拉格朗日优化技术对SVC数据与差错控制保护级别进行最优分配.本文提出的缩减栅格算法采用疏散式栅格结构,实行依层计算与缩减队列的策略,计算效率比同类高效算法提高了约20~50倍.大量仿真数据表明,采用本文高效算法的JSCC方法在各种信道条件下达到同类方法相同的优化性能.     

一种新的混合信道盲均衡算法

为同时提高盲均衡的稳态MSE性能和收敛速度,该文提出了一种混合信道盲均衡算法。该算法采用判决反馈均衡器结构,在判决可靠时采用DD-LMS(Directed Decision-Least Mean Square)误差项进行迭代,而判决不可靠时采用改进恒模算法(Modified Constant Modulus Algorithm,MCMA)误差项进行迭代,同时判决可靠区间根据直接判决误差进行自适应迭代。该文采用经过数字无线信道的64QAM信号进行了信道均衡仿真。仿真结果表明,相比MCMA算法,该文提出的混合盲均衡算法有效地提高了收敛速度,并具有良好的稳态MSE性能,在误比特率为10-6时,能提高SNR约2dB。     

On majority-logic decoding of finite geometry codes

In this paper, an improved decoding algorithm for codes that are constructed from finite geometries is introduced. The application of this decoding algorithm to Euclidean geometry (EG) and projective geometry (PG) codes is further discussed. It is shown that these codes can be orthogonalized in less than or equal to three steps. Thus, these codes are majority-logic decodable in no more than three steps. Our results greatly reduce the decoding complexity of EG and PG codes in most cases. They should make these codes very attractive for practical use in error-control systems.     

Turbo decoding as an instance of Pearl's “beliefpropagation” algorithm

We describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. (1993) and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pearl's (1982) belief propagation algorithm. We see that if Pearl's algorithm is applied to the “belief network” of a parallel concatenation of two or more codes, the turbo decoding algorithm immediately results. Unfortunately, however, this belief diagram has loops, and Pearl only proved that his algorithm works when there are no loops, so an explanation of the experimental performance of turbo decoding is still lacking. However, we also show that Pearl's algorithm can be used to routinely derive previously known iterative, but suboptimal, decoding algorithms for a number of other error-control systems, including Gallager's (1962) low-density parity-check codes, serially concatenated codes, and product codes. Thus, belief propagation provides a very attractive general methodology for devising low-complexity iterative decoding algorithms for hybrid coded systems     

Optimal construction of synchronizable coding for railway trackcircuit data transmission

A new application using synchronizable error-control coding for train detection and track-train data transmission with audio frequency railway track circuits is described, with algorithms for quasi-optimal code construction and performance assessment. A new coding format is presented for frequency-shift-keying-modulated track circuits with which a fixed-duration-message telegram is transmitted. Only two-track-circuit separation frequencies are required, and although there exists a maximum rate of transmission for a given track-circuit parameter set, the data transmission capability is in general limited only by the telegram length. The problem addressed is that of assigning codes within the message to satisfy target safety and reliability criteria. The proposed telegram-type code comprises a synchronization sequence followed by message data bits arranged as three blocks and terminated by error-control bits with a final parity check. Data encoding is by conventional Hamming codes. Several hundred messages are available for typical track-circuit parameter sets     

Simple technique for constructing 2-dimensional maximum-run-length-limited error-control codes

A simple technique for constructing 2-dimensional run-length-limited error-control codes which have potential for application in 2-dimensional bar codes is presented.<>     

周期域分析中非同步取样数据的同步化

针对周期信号分析中的频谱泄漏问题,本文就目前国际上的研究状况和趋势进行了简单地介绍,提出了重新定位取样序列的同步化方法,推导出了同步化取样序列坐标的定位公式.比较详细地讨论了线性、二阶和四阶同步化算法,并对它们的理论截断误差进行了分析.通过对不同谐波形式的仿真信号的同步化运算和误差分析,获得了线性同步化算法的理论和实际误差特性,以及二阶抛物同步化算法和四阶前插同步化算法的实际误差特性.误差分析的结果表明,这种非同步取样数据的同步化算法,具有良好的同步效果,不仅可应用于稳态周期信号,也适用于周期性非稳态过程信号的测量和分析.