线性分组码限距离译码器的性能分析

为了提高自动重传请求(ARQ)系统的通过率,在混合ARQ系统中,使用限距离译码器改善系统的性能。在限距离译码时,线性分组码纠正重量t的错误图样。纯纠错译码器和纯检错译码器都是限距离译码器的特例。本文首先介绍了Krautchouk多项式的几个重要性质,然后,用线性分组码及其对偶码的重量分布,分别导出了两种形式的错误译码概率的简化计算公式。由于生成函数方法的使用,成功地得到了重复码、汉明码和扩展汉明码的错误译码概率的解析公式,最后,讨论了Golay码和某些本原BCH码错误译码概率的计算方法。     

用重要性抽样方法估计分组码同时纠错和检错时的性能

研究用重要性抽样仿真方法估计线性分组码同时纠错和检错时的不可检错误概率。从理论上得到了最佳偏置转移概率和仿真效率的表达式。对 (1 5,7) BCH码和 (2 3,12 ) Golay码的仿真表明,重要性抽样是一种非常有效的仿真方法。     

纠错码与神经网络

从两个方面推广了Bruck和Blaum的工作。一方面,证明了在软判决译码的情况下,线性分组码的最大似然译码等价于一个神经网络收敛于它能量函数的全局极大状态。另一方面,对GF(p)上的线性分组码,构造了一个联想记忆神经网络,使得每一个线性分组码的码字都对应于神经网络的一个全局稳定状态。     

分组码在有记忆删除信道上的性能计算

 本文首先描述了一种有记忆删除信道模型,然后提出了分组码在该信道上的性能的迭代算法。最后以Golay(23,12,7)码为例给出了多种信道参数之下的性能曲线。     

基于有限域上乘法群与均衡不完全区组的准循环LDPC码构造

构造低编码复杂度的准循环LDPC码是其在高速数据传输系统中有效应用的关键技术之一。本文通过引入有限域上乘法群,提出了一种新的基于均衡不完全区组(BIBD)的准循环LDPC码的构造算法。算法将基于BIBD的传统构造算法中的加法群替换为乘法群,简化了相应元素位置向量的计算;同时通过校验矩阵扩展(dis-persion)构造出能够抵抗长突发删除错误的好码。仿真结果表明,本算法构造的准循环LDPC码的围长至少为6,能够采用反馈移位寄存器实现线性复杂度的编码;利用和积译码算法进行迭代译码,AWGN与BEC信道下译码性能与随机构造的LDPC码相当。     

一种纠检错能力很强的线性分组码

本文提出一种可用于数字通信中差错控制的(12,4)线性分组码。描述了其构造及特点;讨论了它的解码规则,并针对单纯的检错应用,介绍了一种高效的实现算法.最后,定量分析了其误码情况,还与具有同一冗余度的简单三重码作了比较;结果表明,新码的错误率要低得多.     

AWGN和衰落信道下具有改进型Code-matched交织器的Turbo码

提出了一种改进型的Code-Matched交织器,它能减少低重量码的数量,从而提高mbo码的性能。这种改进型的Code-Matched交织器可以适用于多种不同生成矩阵产生的mbo码,而且不会影响Turbo码在中高信噪比处的性能。同时,在Rayleigh信道下,这种交织器能降低错误平台。     

新生目标强度未知的双门限粒子PHD滤波器

传统粒子概率假设密度(PHD)滤波器假定新生目标强度已知,当新生目标在整个观测区域随机出现时不再适用。为解决新生目标强度未知时的多目标跟踪问题,提出了一种基于量测信息的双门限粒子PHD(PHD-DT)滤波器。首先基于似然函数设定门限对存活目标量测进行粗提取,利用上一时刻的目标估计值构建圆形波门进行精细提取,并对门限设定方法进行分析,然后根据提取结果对目标PHD进行分解,得到存活目标和新生目标的PHD预测及更新表达式,最后给出了滤波器的实现方法并同基于量测驱动的PHD(PHD-M)滤波器和Logic+联合概率数据互联(JPDA)方法进行了仿真对比。仿真结果表明,在新生目标强度未知时,PHD-DT可有效避免Logic+JPDA在杂波背景下因航迹起始错误带来的估计误差,并较好地解决了PHD-M的目标数目过估问题,多目标估计性能更优,且杂波越强性能优势越明显。     

局部概率传播译码的非系统低密度卷积码

低密度卷积码(LDCC)是低密度码(LDPC)经由其产生矩阵的侧滑变换成为带状产生矩阵而得到的,具有LDPC和卷积码的误码性能好等一些共同特征。LDCC码的和积算法译码方法可以进一步改进为局部概率传播译码方法。采用流水线结构的局部概率传播译码方法用于LDCC码得到了接近和积算法的译码性能,而且译码延迟比LDPC大为降低,译码器更为简单,便于实时工作。     

利用奇异酉几何构作新的带仲裁的认证码

利用有限域上奇异酉几何构作了一个新的带仲裁的认证码．并计算了这个码的参数。当编码规则按等概率分布选取时，计算出了各种攻击成功的概率。     

Cochannel Interference in Partially Coherent Communication

Effects of cochannel interference and synchronization error of the carrier phase on the probability of error in binary communications are considered. Several bounds on the probability of error are proposed. The bounds are easy to compute and do not require complete statistical characterization of the errors. They turn out to be simple linear combinations of error probabilities with no cochannel interferences and no phase errors. Several illustrative examples are given which show that the bounds can be tight.     

Bounds on Probability of Error in Decision Feedback Equalizers

Evaluation of the probability of error in decision feedback equalizers is difficult due to the presence of a hard limiter in the feedback path. This paper derives the upper and lower bounds on the probability of a single error and multiple error patterns. The bounds are fairly tight. The bounds can also be used to select proper tap gains of the equalizer.     

Bounds on the Probability of Error in Digitial Communications

A class of upper bounds and lower bounds on the probability of error in digital communications are derived. Several degrading factors like intersymbol interference, cochannel interference, inaccurate carrier synchronization, and incoherent detection can be considered in obtaining the bounds. Several examples are given and it is shown that many situations not considered so far can be put into the conceptual framework developed here.     

Time-frequency hop codes based upon extended quadratic congruences

Time-frequency hop codes are developed that can be used for coherent multiuser echolocation and asynchronous spread spectrum communication systems. They represent a compromise between Costas codes, which have nearly ideal autoambiguity but not so good cross-ambiguity properties, and linear congruential codes, which have nearly ideal cross-ambiguity but unattractive autoambiguity properties. Extended quadratic congruential code words are shown to have reasonably good autoambiguity and cross-ambiguity properties across the whole class of code sets considered. A uniform upper bound is placed on the entire cross-ambiguity function surface, and bounds are placed on the position and amplitude of spurious peaks in the autoambiguity function. These bounds depend on the time/bandwidth product and code length exclusively and lead naturally to a discussion of the design tradeoffs for these two parameters. Examples of typical autoambiguity and cross-ambiguity functions are given to illustrate the performance of the new codes     

A Note on Bounds for Target Tracking with pd>1

Recently several new results for Cramer-Rao lower bounds (CRLBs) in dynamical systems have been developed. Several different approaches and approximations have been presented. For the general case of target tracking with a detection probability smaller than one and possibly in the presence of false measurements, two main approaches have been presented. The first approach is the information reduction factor (IRF) approach. The second approach is the enumeration (ENUM) approach, also referred to as the conditioning approach. It has been found that the ENUM approach leads to a strictly larger covariance matrix than the IRF approach, however, still providing a lower bound on the attainable error covariance. Thus, the ENUM approach provides a strictly tighter bound on the attainable performance. It has been conjectured that these bounds converge to one another in the limit or equivalently after an initial transition stage. We demonstrate, using some recent results from the modified Riccati equation (MRE) and by means of counter examples, that this conjecture does not hold true in general. We also demonstrate that the conjecture does hold true in the special case of deterministic target motion, or equivalently in the absence of process noise. Furthermore, we show that the detection probability has an influence on the limiting behaviors of the bounds. Moreover, we show that the MRE approximation provides a very good and computationally efficient approximation of the ENUM bound. The various results are illustrated by means of representative examples.     

Comments on "on Probability of Error in Decision Feedback Equalizer"

The above-mentioned paper [1] derives bounds on the error probability of a decision feedback equalizer (DFE) which are claimed to be significantly tighter than the earlier upper bound of [2]. Unfortunately, [1] makes an unsupportable assumption which reddars the conclusions incorrect. We show that valid bounds can be obtained by the methods of [1], but that for the numerical example of [2] , the resulting upper bound is never tighter than, and sometimes significantly weaker than, that derived in [2]. Similarly, a lower bound derived by the method of [1] is shown for the same numerical example to be very close to the error-free past lower bound previously known.     

结构系统失效概率的近似分析

提出用一阶简单边界的上、下界来估计结构系统失效概率的近似公式。它考虑了结构系统失效模式之间的相关性但仅包含失效模式的一阶概率。算例表明,通常最大误差在5％以内,精度高而计算简便。