改进型遗传算法在加载天线设计中的运用

遗传算法是一种全新的优化搜索方法，可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处，介绍了一种改进型的遗传算法，并阐述了其在短波宽带集总加载天线优化设计中的运用。     

基于EDGE系统信道估计实现方案的研究

研究了基于ＥＤＧＥ系统接收机中信道估计的实现方案，并对算法的各项性能做出评估。首先论述了算法的采用及其理论依据。接着，说明了信道预估计的原理及方法。最后，针对ＭＡＴ－ＬＡＢ及 ＤＳＰ上的仿真结果，比较了各项系数对于系统性能改善所具有的影响和作用，对系统特性作了较为详细的分析总结。     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

相干源二维波达方向估计

本文分析了平面阵接收信号的协方差矩阵，发现它可分解为一个广义对称矩阵与一个非广义对称矩阵之和，利用信号协方差矩阵的这一结构特征，重点研究了相干源二维波达方向（DOA）估计．该方法通过构造一个差矩阵，求出其本特征值对应的任一特征向量，利用谱函数估计相干源二维DOA．简要分析了二维DOA估计的分维处理。     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.