CONVERGENCE OF CASCADE ALGORITHMS AND SMOOTHNESS OF REFINABLE DISTRIBUTIONS

In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).     

Asymptotics of estimates in constrained nonlinear regression with long-range dependent innovations

The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L ₂-estimates) and the least absolute deviation estimates (L ₁-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies of the above estimators.     

Grouped Approach for the Design of H.264/AVC Motion Estimation Architectures

This letter presents a novel approach for organizing computational resources into groups within H.264/AVC motion estimation architectures, leading to reductions of up to 75% in the equivalent gate count with respect to state‐of‐the‐art designs.     

A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature

We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

基于遗传算法的优化排样

介绍了遗传算法以及二维不规则图形的计算机优化排样，研究了二维不规则图形排样中如何建立遗传算法的目标函数，如何实现交叉、变异运算等优化过程，找到了运用遗传算法实现二维不规则图形优化排样的方法。通过计算机编制了运用遗传算法进行二维不规则图形优化排样的运算程序，并对部分样形进行了优化排样，结果比较满意。     

基于DTW算法的语音识别系统实现

动态时间归整(DTW)算法的实现简单有效,在孤立词语音识别系统中得到了广泛的应用.介绍了将DTW算法移植到TMS320VC5402上实现孤立词语音识别的原理、系统硬件组成和软件设计.研究结果表明,系统能满足实时性能要求,识别效果良好.     

光纤荧光传感器衰减寿命的加权对数拟合法

荧光寿命的检测是荧光光学传感器的核心内容，国际上尝试了多种方法来拟合这种理论上为单指数衰减信号的荧光衰减曲线。这些方法包括非线性函数标准拟合方法。即Levenburg-Marquardt方法，以及Prony方法、FFT方法，对数拟合法等等。为了克服在实际应用中发生的信号退化，需要在测量信号衰减寿命的同时测量信号的初始强度。文章介绍了一种加权的对数拟合法，经计算机仿真及实际数据测试均可以得到和Levenburg-Marquardt方法非常接近的结果，且拟合时间大大缩短，测量稳定性大大提高。仿真测试及具体实验测试结果显示了这种方法的有效性。该方法不仅与Levenburg-Marquardt方法的偏差曲线非常相似，而且实验测得的荧光寿命与Levenburg-Marquardt方法偏差在0．2％以内。     

多码CDMA系统中联合并行干扰抵消与迭代信道估计方法

本文针对多码CDMA系统提出了一种联合并行干扰抵消与迭代信道估计方法。该方法首先通过导频符号对信道进行估计，然后使用RAKE接收机后的软信息对信道参数进行修正，最后通过并行干扰抵消(PIC)去除多码干扰(MCI)。仿真结果表明，经过多次迭代后，该方法可显著地降低多码CDMA系统的误比特率平台。本文同时还给出了信道估计质量、码道数和PIC次数对多码CDMA系统性能的影响。     

基于滑窗结构的软输出维特比算法的实现

文章在对软输出维特比算法(SOVA)进行推导的基础上，分析了软信息的提取过程。同时从硬件实现的角度考虑，提出了一种基于滑动窗1：3结构的SOVA算法实现方案，该算法大大降低了算法实现复杂度和译码延迟，同时通过调整滑窗参数，可以取得与非滑窗SOVA算法几乎相同的性能。