LDPC码低复杂度译码算法研究

在描述置信传播（BP）译码算法基础上，研究和分析了两种降低复杂度的译码算法。Min-Sum算法主要讨论了简化校验节点的消息更新运算，并应用密度进化方法对此算法进行极限性能分析，求出最佳修正参数α以改进译码性能。强制收敛技术致力于减少BP和MSA算法译码过程中“激活”节点的数目，从而降低译码复杂度。AWGN信道仿真结果表明，两种算法在降低译码复杂度的同时，译码性能没有明显降低。     

一种易实现的非相参捷变频雷达射频预测器

常见非相参捷变频雷达利用随机重频调制旋转磁控管,发射随机射频。本文证明了重频为常数,磁控管调谐曲线为谐波函数时,可用维纳—霍甫方程(Weiner-Hopf)求得预测器为二阶契比雪夫恒等式。此时,预测器为无偏估计,估计误差之均方差为零。当随机重频调制磁控管时,其射频序列可用自回归模型(AR)来近似。本文以瑞典产9LV雷达为例,讨论随机重频频谱、磁控管调谐曲线之高次谐波及磁控管电机转速变化对预测误差的影响。计算结果表明,预测器用四到六阶数字滤波器制作,其预测误差之均方根差不大于千分之一。     

区域运输规划模型系统

提出一种区域运输规划模型系统,以求从定量的角度,预测一个区域内的货物运输量,继而确定这些运输量对该区域内存在的多种运输方式的偏好结构,最后仿真这些运量在相应的各种运输网络上的分布情况,同时仿真模型还对运输网线路经过新建或扩建后所形成的新的运量分布进行模拟。根据运量分布情况,就可提出初步的规划建设方案。     

结构自适应序贯正则极端学习机时间序列预测及其应用

为提高初始小样本情况下时间序列在线预测的精度,提出了一种结构自适应序贯正则极端学习机(SA-SRELM)。该方法在在线序贯学习阶段,针对不同训练样本规模选择不同的递推方式对输出权值进行更新;同时,在训练样本达到一定规模后,为提高预测模型对系统的动态适应性,在加入新样本的同时对旧样本进行剔除,完成预测模型的训练。利用3种混沌时间序列预测实例对所提方法的有效性进行了验证。最后,将所提方法用于航空发动机排气温度预测中,结果表明该方法相对正则极端学习机(RELM)和序贯正则极端学习机(SRELM)方法具有更好的泛化性能,预测精度分别是二者的约6倍和2倍。     

自适应天线抗干扰性能研究

分析了适用于雷达抗干扰的一些自适应天线波束形成算法,将子空间正交投影算法应用于雷达抗干扰,针对子空间分解过程中特征向量不能完全正交的问题,采用约束化子空间分解算法,来保证子空间特征向量的正交性.最后通过仿真证明:子空间跟踪算法相对于传统的一些自适应算法具有更强的抗干扰性能.     

星载SAR在轨成像实时处理算法研究

星载合成孔径雷达(SAR)分辨率和幅宽的不断提高,其产生的原始数据率越来越大,采用在轨实时成像处理形成图像,在图像域再进行传统的图像数据处理和传输,有助于降低星-地数据传输速率,为了提高星载SAR在轨成像处理的实时性,文章分析了星上特殊条件对星载SAR处理算法实时性所提出的约束,对RD、波束域、CS等经典的星载SAR成像处理算法的运算量进行了比较,以CS算法为例,研究了相位补偿因子对CS成像处理算法的实时性影响,提出了一种补偿因子区域不变的CS成像算法,它极大地减少了成像处理算法的运算量,并通过仿真实验结果验证了该算法的有效性。     

机翼边界层的横流稳定性分析和转捩预测

通过求解经典O-S方程(LST)、扩展的O-S方程(EOS)和线性抛物化稳定性方程(LPSE),对展向无限长、后掠角25°、迎角0°、来流Mach数0.8、单位Reynolds数6.79×106/m的机翼边界层进行了稳定性分析,结合eN方法进行了转捩预测。研究发现无限长后掠机翼在(x,ω)平面上的中性曲线没有下支,在(x,β)平面上的中性曲线呈反拇指的形状,横流不稳定性在机翼前缘占主导作用。当外界扰动进入边界层后,幅值将被直接放大,对于频率相同的扰动,首先是展向波数β大的增长起来,演化到一定位置开始衰减,然后是展向波数β小的逐渐增长起来,并且增长的指数N逐步超过波数大的扰动。转捩在机翼前缘完成,引起转捩的扰动波的展向波长约为2mm。     

A strategic flight conflict avoidance approach based on a memetic algorithm

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.     

A salient edges detection algorithm of multi-sensor images and its rapid calculation based on PFCM kernel clustering

Multi-sensor image matching based on salient edges has broad prospect in applications, but it is difficult to extract salient edges of real multi-sensor images with noises fast and accurately by using common algorithms. According to the analysis of the features of salient edges, a novel salient edges detection algorithm and its rapid calculation are proposed based on possibility fuzzy C-means （PFCM） kernel clustering using two-dimensional vectors composed of the values of gray and texture. PFCM clustering can overcome the shortcomings that fuzzy C-means （FCM） cluster- ing is sensitive to noises and possibility C-means （PCM） clustering tends to find identical clusters. On this basis, a method is proposed to improve real-time performance by compressing data sets based on the idea of data reduction in the field of mathematical analysis. In addition, the idea that kernel-space is linearly separable is used to enhance robustness further. Experimental results show that this method extracts salient edges for real multi-sensor images with noises more accurately than the algorithm based on force fields and the FCM algorithm; and the proposed method is on average about 56 times faster than the PFCM algorithm in real time and has better robustness.