改善相控阵天线工作带宽的技术途径研究

从空间色散和时间色散两方面讨论了常规相控阵天线的窄带特性。从时域阵列理论出发，着重研究了改善相控阵天线工作带宽的技术途径，分析了这些技术措施对天线辐射特性可能造成的影响，供后续工作参考。     

一种新的天綫阵方向图綜合方法

由于互耦的影响,天线阵中各单元的电流分布各不相同,因此,传统的综合方法不能得到满意的方向图;而矩量法综合阵方向图时对大阵需要极大的计算量,限制了它的适用范围。本文提出了一种综合偶极子天线阵方向图的方法,并用它得到了几个低副瓣方向图。由于较好地处理了互耦的影响,这种方法极大地节省了计算时间和存贮单元,并使激励源型式具有很大的灵活性。本文的方法特别适用于大阵的方向图综合。     

MUSIC算法在高速并行处理机上的实现

利用FPGA的特点,提出了一种实现MUSIC算法的新的高速并行硬件解决方案。给出了对MUSIC算法进行预处理的结果,为硬件实现加速提供可能;导出了MUSIC算法适合于FPGA实现的并行分解方法;介绍了用FPGA来实现谱峰搜索的新方法。结果表明,该设计方法处理速度理想,能够满足实时性要求。     

Small orthogonal main effect plans with four factors

In this paper we study orthogonal main effect plans with four factors, A table of such designs, where each factor has at most 10 levels, and there are at most 40 runs, is generated. We determine the spectrum of the degrees of freedom of pure error for these designs.     

基于行列合成的实值二维Root-MUSIC算法

在低仰角及多径环境下,常规二维波达方向估计的高分辨方法需要特征值分解或者多维搜索,运算量巨大,文中提出了一种基于行列合成处理和实值二维Root-MUSIC测角的双迭代方法.该方法由某个初始二维角度出发,首先进行行列合成,将面阵接收的数据矩阵合成为行列矢量,然后用实值Root-MUSIC分别估计俯仰角和方位角,最后由更新的二维角度重构加权向量,对阵列数据进行行列合成并重新估计二维角度,其迭代直至得到的二维角度满足给定的精度.该方法操作简单、收敛速度快,由于引入了实值域处理,在对多径信号解相关的同时进一步降低了运算量.计算机仿真结果证实了该方法估计低仰角信号的二维波达方向的正确有效性.     

MEMS加速度传感器的引信数据采集系统设计

论述了侵彻引信系统的数据采集系统设计与实现。该系统采用MEMS阵列式加速度传感器获取冲击过程中的加速度值,将可测量加速度范围提高105g以上。利用FPGA芯片实现八路并行数据采集,通过对输入数据的有效选择和64阶数字FIR滤波处理,实现了高速冲击加速度的高精度测量;同时减小了引信数据采集系统的体积,提高了系统的可靠性,便于维护与升级。     

圆阵中相干信号的高分辨阵列测向技术

在分析均匀线阵中相干信号高分辨测向原理的基础上,提出了一种适合于圆阵的相干信号高分辨阵列测向技术,理论分析和计算机模拟都证明了该技术的正确性和可行性。     

Pseudo-Youden designs balanced for intersection

If the row-column intersections of a row-column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.     

Construction of optimal supersaturated design with large number of levels

Inspired by the ideas of column and row juxtaposition in Liu and Lin (2009) and level transformation in Yamada and Lin (1999), this paper presents a new method for constructing optimal supersaturated designs (SSDs). This method provides a convenient way to construct mixed-level designs with relatively large numbers of levels, avoiding the blind search and numerous calculations by computers. The goodness of the resulting SSDs is judged by the χ² (Yamada and Lin, 1999 and Yamada and Matsui, 2002) and J₂ (Xu, 2002) criteria. Some nice properties of the new designs are also provided.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.