软判决多步法相关攻击在PN码快速捕获中的应用

针对非协作接收的扩频通信系统,低信噪比情况下长周期且生成多项式抽头数较多的扩频码的快速捕获问题一直是研究的重点和难点。本文借鉴密码学中密钥攻击基本思想,提出一种基于软判决多步法快速相关攻击的长周期扩频码快速捕获新算法。通过将PN序列看成线性分组码,将序列相位捕获看成线性分组码的解码,采用软判决方法进行分步串行译码,充分利用序列本身的软信息,实现低信噪比情况下长周期扩频序列的快速捕获。理论分析和仿真结果表明本文算法与多项式抽头个数无关,具有较好的捕获性能,能够在低信噪比下稳定工作;与硬判决相关攻击方法相比,本文算法大约有3.5dB以上的性能提升。      

MPSK调制系统中的自适应信道估计

本文研究了在MPSK调制方式下,不发送训练序列的商接判决自适应信道估计问题。为提高信道估计性能,提出采用软判决鉴相估值来调整加权最小均方(WLMS)和加权递归最小二乘(WRLS)自适应算法中的权值来进行信道估计,并研究了改进的软判决WRLS算法。结果表明,软判决加权LMS算法比一般LMS性能有很大提高,改进的软判决WRLS算法估计性能优于WRLS算法。     

基于可信度累积的伪随机序列多项式估计算法

针对高阶误码条件下伪随机序列多项式估计算法效率不高、容错性能差等问题进行研究,提出一种基于可信度累积的多项式估计算法。该算法结合了基于二元序列迭代的BM算法和改进型Chase算法,利用序列软信息,在BM算法外部构建序列及多项式可信度集合,通过可信度累积实现估计。然后,利用本原多项式的二元域性质,通过缩小累积多项式规模,提高估计精度。仿真结果表明,该算法性能不受制于多项式抽头个数,在误码率为18%的条件下能够完成17阶m序列多项式估计。     

瑞利衰落多径信道最大似然序列估计和判决反馈均衡器误差率性能比较

本文研究了高数据率对流层散射信道的判决反馈均衡(DFE)和利用维特比(Viterbi)算法(VA)的最大似然序列估计(MLSE)。信道模型用具有零均值多高斯抽头加权系数的D个分集横截滤波器表示。抽头加权的方差从典型对流层散射线路的延迟功率谱特性中选取。抽头增益变化的速率比符号速率缓慢得多,并且假设判决算法是利用抽头增益的理想估值。性能结果包括理论的下界和在数字计算机上得到的Monte Carlo模拟数据。结果表明对于典型的对流层散射线路,采用实际判决或正确判决进行反馈的VA和DFE在性能上是接近的。     

基于正反向联合TCF的序列多项式估计算法

针对高误码条件下序列高阶多项式估计算法容错性能差、计算复杂度高等问题进行研究,提出一种基于正反向联合TCF(三阶相关函数)的序列多项式估计算法。引入多项式线性相关对,分析研究TCF估计模型。针对模型缺点,将TCF估计问题转化为序列捕获问题,采用循环相关方式求解正反向联合TCF峰值位置。运用概率分析方法,分析研究正反向TCF峰值求解中各参数关系,为算法应用提供依据。仿真结果表明,该算法在误码率37%的条件下能够较好地完成17阶m序列多项式估计,且性能不受制于多项式抽头个数,计算复杂度和容错性能均优于TCF算法。     

OFDM系统中一种新的迭代信道估计算法

本文提出了OFDM系统中一种新的基于软信息迭代处理的信道估计算法。该算法将面向判决最小二乘估计算法和盲估计算法相结合,在估计器中构造了一种新的置信度量函数,根据解码和软映射重构的反馈信号置信度大小在两种估计算法中自适应选择,这样估计的信道频响可以有效提高软信息迭代接收性能,大大降低信道估计训练开销。仿真结果表明,本文提出的算法能有效跟踪信道时变,限制传统面向判决估计的错误传播,达到好的系统性能。     

基于改进Walsh-Hadamard变换的(n,1,m)卷积码盲识别

针对高误码率情况下(n,1,m)卷积码的盲识别问题,该文提出一种新的基于改进Walsh-Hadamard变换(Walsh-Hadamard Transform, WHT)的方法。首先将原问题等效为多路1/2码率卷积码的盲识别问题,并建立关于其生成多项式系数的线性方程组。然后分析了现有基于WHT的方法直接求解该方程组所存在的不足,重新建立更稳健的判决门限,同时通过缩小解的取值范围降低计算量,进而在求得正确解向量的同时完成对码长的识别。最后,将多路等效1/2码率卷积码的生成多项式按一定条件组合,得到(n,1,m)卷积码的生成多项式矩阵。仿真结果验证了所提方法的有效性,且性能优于传统方法。     

多站无源跟踪边缘化卡尔曼滤波算法

多站无源跟踪量测方程非线性强,对跟踪算法的稳定性及精度提出了更高的要求。为实现稳定高精度跟踪,提出了新的基于边缘化卡尔曼滤波（MKF）的多机无源跟踪算法。该算法将非线性的量测方程表示为p阶Hermite多项式的加权和,将加权矩阵的先验分布建模为高斯过程,求得其后验分布后对其进行积分来消除加权矩阵的影响,最终可得对状态及其协方差矩阵估计的闭式解。以只测角跟踪为例对所提算法性能进行验证,仿真结果表明,相对于扩展卡尔曼滤波（EKF）算法、不敏卡尔曼滤波（UKF）算法及容积卡尔曼滤波（CKF）算法,所提算法具有更好的跟踪性能。      

并行多信道判决引导CDL盲均衡算法

针对传统算法抽头系数较长和难以处理深衰落信道的问题,提出适用于通用数据链信号的并行多信道判决引导盲均衡算法。新算法借助判决反馈结构中前馈、反馈滤波器的独立优化特性,将加权后的判决值代入下一次的迭代过程,有利于消除拖尾效应;综合运用采样率高的分数间隔结构与稳态误差小的判决引导算法,对接收信号采用并行处理的方式,大大缩短了抽头系数长度。实验结果表明,针对CDL信号,新算法能够有效提升收敛速度、降低误码率。      

基于TOEPLITZ重构的压缩感知嵌套阵列DOA估计

针对传统稀疏阵列波达方向（DOA）估计算法在小快拍数、低信噪比和多信源数等条件下的估计精度不高的问题,提出了一种基于TOEPLITZ重构的压缩感知嵌套阵列DOA估计方法。首先利用TOEPLITZ重构方法将虚拟阵列的输出信号向量构建成满秩协方差矩阵,然后利用信号在空间域的稀疏性,将阵列协方差矩阵进行稀疏表示,通过噪声子空间和信号子空间的正交关系构建权值向量,对稀疏向量进行加权约束,最后通过求解最优化方程获取入射信源的DOA估计。仿真结果表明,本文方法比传统稀疏阵列DOA估计算法在低信噪比、小快拍数和多信源数下具有更好的DOA估计性能。     

Parameters estimation and detection of MIMO-LFM signals using MWHT

This article proposed an improved Wigner–Hough Transform (WHT) for multicarrier LFM signals of MIMO radars (MIMO-LFM). First, the signal model of the intercepted MIMO-LFM signals and the localisation of conventional WHT for this signal model are analysed. Therefore, we present the new WHT with multiple matching components, which is called as multicomponent WHT (MWHT). Then the detection and parameters estimation performance of MWHT are deduced, and analytical results indicate that MWHT is superior to conventional WHT for MIMO-LFM. In order to reduce the computation cost, a coarse estimation method is introduced. Finally, the numerical simulations demonstrate the validity of MWHT, as well as analytical results.     

Fast computation of discrete Hartley transform via Walsh?Hadamard transform

A new fast algorithm is proposed to compute the discrete Hartley transform (DHT) via the Walsh?Hadamard transform (WHT). The processing is carried out on an interframe basis in (N × N) data blocks, where N is an integer power of two. The WHT coefficients are obtained directly, and then used to obtain the DHT coefficients. This is achieved by a transform matrix, the H-transform matrix, which is ortho-normal and has a block-diagonal structure. A complete derivation of the block-diagonal structure for the H-transform matrix is given.     

DMBT系统中利用FWT快速实现信道估计

根据PN码的结构特性,针对DMB-T系统多载波模式,本文提出了一种新的理论上与滑窗相关法等价的信道估计方法,利用FWT(快速沃尔什变换)实现快速多径捕获.通过干扰抵消进一步消除了径间干扰.该方法具有很强的抗多径效应和抗强窄带干扰的能力,将运算复杂度从传统滑动互相关法的N~2降低到(N+1)log_2(N+1).     

WHT-Based Detection and Parameter Estimation of a Single LFM Interference Signal in Spread Spectrum Systems

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｉｎｔｅｒｆｅｒｅｎｃｅｒｅｊｅｃｔｉｏｎｔｅｃｈｎｉｑｕｅｓｈａｖｅｗｉｄｅｌｙｂｅｅｎｓｔｕｄｉｅｄｂｙｍａｎｙｓｃｈｏｌａｒｓ[1～5] .Ｏｎｅｍｅｔｈｏｄｆｏｒｉｎｔｅｒｆｅｒｅｎｃｅｅｘｃｉｓｉｏｎｉｓｅｓｔｉｍａｔｉｎｇｔｈｅｐａｒａｍｅｔｅｒｓｏｆｔｈｅｉｎｔｅｒｆｅｒｅｎｃｅａｎｄｓｕｂｓｅｑｕｅｎｔｌｙｓｕｐ ｐｒｅｓｓｉｎｇｉｔ[2 ] .Ｔｈｅｒｅａｒｅｍａｎｙｔｙｐｅｓｏｆｉｎｔｅｒｆｅｒｅｎｃｅｓｉｎｓｐｒｅａｄｓｐｅｃｔｒｕｍｓｙｓｔｅｍｓ,ａｎ…     

相控阵雷达反演口径分布中的误差分析

为了预估相控阵雷达各部件的非理想性对反演天线口径幅相分布的影响,分析了相控阵天线移相器插损和移相误差,接收机噪声,接收机非线性和测相误差,Ａ／Ｄ变换位数等对时序Ｗａｌｓｈ－Ｈａｄａｍａｒｄ相位权重反演天线口径幅相分布的影响。     

BER Performance of Walsh–Hadamard Like Kronecker Product Codes in a DS-CDMA and Cognitive Underlay System

Walsh–Hadamard transform, a discrete unitary transform is widely used in many applications such as signature codes in the current wireless standards IS-95 CDMA, WCDMA, CDMA2000 and image transform applications. It is simple to implement this transform since they can be generated by a single Kronecker product recursion formula. In this paper, a new set of binary code families similar to Walsh codes are obtained based on the concept of code concatenation and permutation. It is shown that these codes can be generated by reconfiguring the Walsh–Hadamard code generator. Hence it can be utilized in reconfigurable radios such as underlay cognitive radio (UCR). Theoretical results showing the BER performance due to MAI between primary users and secondary users in an UCR is also obtained. Simulation results showing the BER performance of these codes in a direct sequence spread spectrum system and UCR system with quadrature multiplexing operating in the individual decoding mode under AWGN plus flat fading Rayleigh channel conditions is also obtained.     

WHT-based composite motion compensated NTSC interframe directcoding

The motion compensated interframe differential pulse code modulation (DPCM) and discrete cosine transform (DCT) hybrid (MC DCT) coding was nominated as a standard scheme for component TV signals by ISO and ITU-R. However, in cases where an NTSC composite TV signal is used such as the United States and Japan, applying the MC DCT scheme with its luminance/chrominance separating and composing process causes unavoidable quality degradation. The reason for this additional process required for MC DCT is that a composite TV signal presents a “color subcarrier phase shift problem” in which the color subcarrier phase varies between a coding block and reference block according to the motion vector. In this paper, we propose a Walsh Hadamard transform (WHT)-based composite motion compensated NTSC interframe direct coding scheme. In this scheme, phase shifts of a color subcarrier and modulated chrominance components between a coding block and reference block can be effectively compensated by a simple process of coefficient permutation and polarity changes of several pairs of WHT coefficients to which 100% of the subcarrier energy and most of the modulated chrominance component's energy are packed. In the motion compensated DCT scheme, however, the energy of the color subcarrier and modulated chrominance components are spread over too many coefficients and a pair-based coefficient handling rule is not given to solve this problem. This paper demonstrates that the proposed scheme provides higher coding performance for a composite NTSC signal than does the motion compensated DCT scheme with its luminance/chrominance separating and composing process     

Fast computation of the discrete Walsh and Hadamard transforms

The discrete Walsh and Hadamard transforms are often used in image processing tasks such as image coding, pattern recognition, and sequency filtering. A new discrete Walsh transform (DWT) algorithm is derived in which a modified form of the DWT relation is decomposed into smaller-sized transforms using vectorized quantities. A new sequency-ordered discrete Hadamard transform (DHAT) algorithm is also presented. The proposed approach results in more regular algorithms requiring no independent data swapping and fewer array-index updating and bit-reversal operations. An analysis of the computational complexity and the execution time performance are provided. The results are compared with those of the existing algorithms