军用目标识别系统的研究与应用

介绍了目标识别系统的组成和工作原理,阐述了其关键技术和主要技术途径,通过收集目标各种角度下的图像,建立了军用目标图像模板库和目标识别系统,并进行了试验验证,目标识别结果证明了该技术方案的正确性和可行性。建立的目标识别系统能较好地弥补现役红外系统的缺陷,适应各种复杂的气候条件,提高我国舰船对军事目标的识别能力,满足舰船对光电设备应具有的目标识别能力的迫切需求。     

激光成像雷达数字信号预处理技术

研究了激光成像雷达的信号预处理技术 ,采用分区存储方法实现实时成像显示技术 ,系统采用距离选通技术 ,减少了数据处理量 ,应用处理器芯片ADSP2 10 6 0 ,提高了系统信息处理能力     

Spectral efficiency improvement with SISO and SIMO in M‐QAM over millimeter‐wave links

This paper proposes a spectral efficiency improvement technique for millimeter wave (mmWave) links. The proposed technique provides an efficient utilization of the mmWave link capacity. This technique is applied in three cases the single‐input single‐output (SISO), single‐input multiple‐output (SIMO) with the maximal ratio combining and with the equal gain combining. The M‐ary quadrature amplitude modulation scheme is used in our work. The power series expansion is used for deriving closed‐form expressions for bit error rate (BER) performances in all studied cases. The BER closed‐form expressions are confirmed by the numerical solution of the integral equations. The simulation results show that a high spectral efficiency can be accomplished by the proposed technique. As well as the derived expressions closely match with the numerical solution of integration expressions at different values of modulations order the Rician factor. For instance, the spectral efficiency gain achievement is 8 at signal‐to‐noise ratio (SNR) equals 34 dB in the case of SISO system whereas in the case of SIMO system, the same gain is achieved at SNR equals 24 dB. As well as the BER performance is enhanced from 1.188 × 10^?4, 7.112 × 10^?4, 4.164 × 10^?3, and 3.286 × 10^?2 to 8.717 × 10^?16, 1.119 × 10^?12, 1.308 × 10^?9, and 4.905 × 10^?6 for M = 4, 16, 64, and 256, respectively, at SNR equals 30 dB.     

基于双平行MZM调制器的矢量毫米波信号传输性能分析北大核心CSCD

提出了一种基于双平行马赫-曾德尔调制器(dual parallel Mach-Zehnder modulators,DP-MZM)的单边带矢量毫米波信号产生和传输方案,在MATLAB和VPI联合仿真环境下分析了90 GHz波段不同调制格式信号的产生和传输性能。仿真中,DP-MZM工作在光载波抑制(optical carrier suppression,OCS)模式时,小信号驱动的两个子调制器输出的单边带信号相互叠加后,无需使用滤波器,可以实现完全抑制中心载波的效果。结果表明:经过该系统传输后,各调制信号的误码率(bit error rate,BER)均可达到硬判决前向纠错(hard judgment forward error currection,HD-FEC)阈值。概率整形后正交幅度调制信号的误码性能明显优于均匀正交幅度调制信号,其中,7 bit/symbol概率整形256阶正交幅度调制(probability shaping 256 quadrature amlitude modulation,PS-256QAM)信号经过系统传输后功率增益最为明显,经过50 km光纤传输后,提升了2.94 dB的功率增益。与目前存在的载波抑制毫米波产生方案相比,该系统结构相对简单,可调节度高,信号传输增益明显,因此具有一定的应用价值。     

Numerical integration using sparse grids

We present new and review existing algorithms for the numerical integration of multivariate functions defined over d-dimensional cubes using several variants of the sparse grid method first introduced by Smolyak [49]. In this approach, multivariate quadrature formulas are constructed using combinations of tensor products of suitable one-dimensional formulas. The computing cost is almost independent of the dimension of the problem if the function under consideration has bounded mixed derivatives. We suggest the usage of extended Gauss (Patterson) quadrature formulas as the one‐dimensional basis of the construction and show their superiority in comparison to previously used sparse grid approaches based on the trapezoidal, Clenshaw–Curtis and Gauss rules in several numerical experiments and applications. For the computation of path integrals further improvements can be obtained by combining generalized Smolyak quadrature with the Brownian bridge construction. This revised version was published online in August 2006 with corrections to the Cover Date.     

A sequentially optimal algorithm for numerical integration

For the class of functions of one variable, satisfying the Lipschitz condition with a fixed constant, an optimal passive algorithm for numerical integration (an optimal quadrature formula) has been found by Nikol'skii. In this paper, a sequentially optimal algorithm is constructed; i.e., the algorithm on each step makes use in an optimal way of all relevant information which was accumulated on previous steps. Using the algorithm, it is necessary to solve an integer program at each step. An effective algorithm for solving these problems is given.The author is indebted to Professor S. E. Dreyfus, Department of Industrial Engineering and Operations Research, University of California, Berkeley, California, for his helpful attention to this paper.     

Computation of Orientational Averages in Solid-State NMR by Gaussian Spherical Quadrature

We investigate Gaussian spherical quadrature as a method for calculating orientational averages in solid-state NMR. For the case of magic-angle-spinning sideband amplitudes of isolated spins-1/2, we demonstrate the superiority of Gaussian spherical quadrature over other orientational averaging methods. Depending on the shift anisotropy parameters and the desired accuracy, the computation speed is enhanced by a large factor (between two and many hundreds). In addition, a method for improving any present sampling scheme is devised. Such schemes are called SHREWD (Spherical Harmonic Reduction or Elimination by a Weighted Distribution). The role of orientational symmetry in solid-state NMR is explored. We also discuss the limitations of the Gaussian spherical quadrature methods.     

高斯-厄米特粒子滤波器

针对非线性、非高斯系统状态的在线估计问题,本文提出一种新的基于序贯重要性抽样的粒子滤波算法.在滤波算法中,我们用一簇高斯-厄米特滤波器(GHF)来产生重要性概率密度函数.此概率密度在系统状态的转移概率的基础上融入最新的观测数据,因此更接近于系统状态的后验概率.理论分析与实验结果表明:在观测模型具有高精度的场合或似然函数位于系统状态转移概率的尾部时,用GHF产生重要性概率密度函数的粒子滤波即高斯-厄米特粒子滤波(GHPF)的性能要明显地优于标准的粒子滤波、扩展的卡尔曼滤波、GHF.     

An application of Diophantine approximation to the construction of rank-1 lattice quadrature rules

Lattice quadrature rules were introduced by Frolov (1977), Sloan (1985) and Sloan and Kachoyan (1987). They are quasi-Monte Carlo rules for the approximation of integrals over the unit cube in and are generalizations of `number-theoretic' rules introduced by Korobov (1959) and Hlawka (1962)---themselves generalizations, in a sense, of rectangle rules for approximating one-dimensional integrals, and trapezoidal rules for periodic integrands. Error bounds for rank-1 rules are known for a variety of classes of integrands. For periodic integrands with unit period in each variable, these bounds are conveniently characterized by the figure of merit , which was originally introduced in the context of number-theoretic rules. The problem of finding good rules of order (that is, having nodes) then becomes that of finding rules with large values of . This paper presents a new approach, based on the theory of simultaneous Diophantine approximation, which uses a generalized continued fraction algorithm to construct rank-1 rules of high order.

     

A new form of trigonometric orthogonality and Gaussian-type quadrature

Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(x_i), i = 1(1)2n+1, gives a trigonometric sum of the n^th order, S_2n+1(x = a₀ + ∑_jⁿ = 1^(a_jcos jx + b_jsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S_2r+1(x) is one that satisfies

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{2r+1}}\text{(x)S}{}_{\mathrm{2r\prime +1}}\text{(x)dx=0, r′<r}$

and two other arbitrarily imposable conditions needed to make S_2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S_2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S_4r?1(x). We have

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{4r?1(x)}}\text{dx=∑}{}_{\mathrm{j=1}}{}^{\mathrm{2r}}\text{A}{}_{\mathrm{j}}\text{S}{}_{\mathrm{4r?1}}\text{(x}{}_{\mathrm{j}}\text{)}$

where the nodes x_j, j = 1(1)2r, are the zeros of the orthogonal S_2r+1(x). It is proven that A_j > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S_2r+1(x), x_jandA_j, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy.