基于规范高阶累积量的盲分离算法

本文给出信号的r阶规范累积量定义,证明了在信号瞬时线性混叠情况下r阶规范累积量绝对值不超过最大源信号的r阶规范累积量,因此可以通过最大化r阶规范累积量的绝对值实现盲分离.最大化r阶规范累积量的绝对值可以得到两种盲分离算法,一种高效快速算法———特征值分解盲分离算法,另外一种盲提取算法.本文为高阶累积量盲分离奠定了严格的理论基础.仿真结果验证了理论的正确性和算法的有效性.     

基于模拟退火算法的盲均衡器设计

盲均衡技术是不需要训练序列的自适应均衡技术.该项技术可以消除由于通信信道失真造成的码间干扰.本文的目的是对盲均衡技术作一介绍,包括对广泛应用的最大归一化累积量判据的介绍和讨论,并在此基础上提出了基于模拟退火技术的设计方法,最后,对这种盲均衡器骑行了仿真,并得出了相应的结论.     

一种新的双模式盲均衡算法研究

针对恒模算法(CMA)收敛速度较慢、收敛后均方误差较大的缺点,提出一种新的双模式盲均衡算法.在算法初期,利用能快速收敛的归一化恒模算法(NCMA)进行冷启动,在算法收敛后切换到判决引导(DD-LMS)算法,减少误码率.计算机仿真表明,提出的新算法有较快的收敛速度和较低的误码率.     

分数阶尺度函数的分解与重构算法

引入分数阶多分辨分析与分数阶尺度函数的概念.运用时频分析方法与分数阶小波变换,研究了分数阶正交小波的构造方法,得到分数阶正交小波存在的充要条件.给出分数阶尺度函数与小波的分解与重构算法,算法比经典的尺度函数与小波的分解与重构算法更具有一般性.     

一种新的Godard盲均衡算法研究

盲均衡技术能消除码间干扰,补偿信道特性,正确恢复发送序列,是无线通信系统中的关键技术.分析了G odard算法中迭代步长对盲均衡算法收敛性能的影响,利用模糊神经网络的控制功能,提出一种新的利用模糊神经网络控制步长的G odard盲均衡算法.计算机仿真验证了其有效性.     

分数阶光滑函数线性和二次插值公式余项估计

本文在局部分数阶导数定义的基础上给出了高阶局部分数阶导数定义,并据此得到了一般形式的分数阶Taylor公式.用该公式给出了分数阶光滑函数线性和二次插值公式余项的表达式,并进一步导出了分段线性插值的收敛阶估计.针对分数阶导数临界阶计算困难的问题,本文利用线性插值余项设计了一种外推算法,能够比较准确地求出函数在某点的局部分数阶导数的临界阶.最后通过编写算法的Mathematica程序,验证了理论分析的正确性,并用实例说明了算法的有效性.     

基于双分数阶变分光流模型的运动目标检测方法

变分光流法是常用的运动目标检测方法,应用场景中的光照变化会极大影响现存变分光流法的稳定性及准确率,提出基于分数阶的变分光流模型来提高光照变化鲁棒性.该模型将分数阶导数同时应用于经典变分光流模型的数据项及平滑项中;根据图像的数据特征,采用图像函数及光流向量函数的有限离散二重分数阶导数近似拟合求导结果计算光流向量,进而将光照变化的影响按比例分摊到了各周边像素点中,弱化了光流向量计算过程中光照变化对光流模型的影响.为避免同一像素点的二重分数阶导数覆盖了不同光流向量区域的问题,采用超像素分割来舍弃不在同一光流向量区域的像素点,从而保证了同一光流向量区域的整体性,从而进一步提高模型的光流估计准确率.在三大常用数据库及户外视频序列中进行实验,实验证明,在应用场景存在光照变化的前提下,基于双分数阶的变分光流模型优于其他算法;对比其他算法,文中算法的运算速度适中.     

计算Riemann-Liouville分数阶积分和导数的数值算法

研究计算Riemann-Liouville (RL)分数阶积分和导数的数值算法.首先,分析了RL分数阶积分和导数的定义式,由于定义式中包含一个积分瑕点,使RL分数阶积分和导数难于计算.然后,给出了一种去掉积分瑕点的方法,在此基础上设计出计算RL分数阶积分和导数的数值算法,并证明了此数值算法具有一阶精度.最后,给出了计算实例,计算结果说明提出的算法是有效的.     

带初始奇异性的多项时间分数阶扩散方程一类全离散数值方法的误差分析

本文研究了带有初始奇异性的多项时间分数阶扩散方程的一种全离散数值方法.首先,基于L1公式在渐变网格下离散多项Caputo时间分数阶导数,构造了多项时间分数阶扩散方程的时间半离散格式,证明了时间格式通过选取合适的网格参数r,时间方向的误差可以达到最优的收敛阶2-α_1,其中α_1(0 α_11)为多项时间分数阶导数阶数的最大值.然后,空间采用谱方法进行离散,得到了全离散格式,证明了全离散格式的无条件稳定性和收敛性.为了降低计算量和储存量,对多项时间分数阶扩散方程又构造了时间方向的快速算法,同时证明了该格式的收敛性.数值算例验证了算法的有效性,显示了快速算法的高效性.     

一类分数阶Langevin方程block-by-block算法的数值分析

分数阶Langevin方程有重要的科学意义和工程应用价值,基于经典block-by-block算法,求解了一类含有Caputo导数的分数阶Langevin方程的数值解.Block-by-block算法通过引入二次Lagrange基函数插值,构造出逐块收敛的非线性方程组,通过在每一块耦合求得分数阶Langevin方程的数值解.在0<α<1条件下,应用随机Taylor展开证明block-by-block算法是3+α阶收敛的,数值试验表明在不同α和时间步长h取值下,block-by-block算法具有稳定性和收敛性,克服了现有方法求解分数阶Langevin方程速度慢精度低的缺点,表明block-by-block算法求解分数阶Langevin方程是高效的.     

Kullback-Liebler测度在地震记录反演中的应用

在地震记录反演中,盲目反褶积是一个相当困难的问题.讨论这个问题现有各种方法,如累积矩法等.本文利用Likas等处理图像恢复的变分法来讨论地震记录反演中的盲目反褶积问题.利用Kullback-Liebler信息测度获得一个非常有用的统计函数(即变分函数),此函数的极值点就含有所要求的反射系数序列的信息,并且拟订出求此泛数极值点的一套算法.     

基于增强型模糊神经网络的盲均衡算法研究

提出一种利用增强型模糊神经网络进行盲均衡的新算法.增强型模糊神经网络具有很好的非线性逼近能力和映射能力,符合非线性通信技术处理的特点.给出增强型神经网络的结构和状态方程,提出代价函数,推导出均衡参数的迭代公式.仿真表明,本算法收敛后误码率减减小,收敛效果较好.     

Semi-stable distributions in free probability theory

Semi-stable distributions, in classical probability theory, are characterized as limiting distributions of subsequences of normalized partial sums of independent and identically distributed random variables. We establish the noncommutative counterpart of semi-stable distributions. We study the characterization of noncommutative semi-stability through free cumulant transform and develop the free semi-stability and domain of semi-stable attraction in free probability theory.     

Multivariate fractionally integrated CARMA processes

A multivariate analogue of the fractionally integrated continuous time autoregressive moving average (FICARMA) process defined by Brockwell [Representations of continuous-time ARMA processes, J. Appl. Probab. 41 (A) (2004) 375-382] is introduced. We show that the multivariate FICARMA process has two kernel representations: as an integral over the fractionally integrated CARMA kernel with respect to a Lévy process and as an integral over the original (not fractionally integrated) CARMA kernel with respect to the corresponding fractional Lévy process (FLP). In order to obtain the latter representation we extend FLPs to the multivariate setting. In particular we give a spectral representation of FLPs and consequently, derive a spectral representation for FICARMA processes. Moreover, various probabilistic properties of the multivariate FICARMA process are discussed. As an example we consider multivariate fractionally integrated Ornstein-Uhlenbeck processes.     

Fraction-order total variation blind image restoration based on L1-norm

A fraction-order total variation blind image restoration algorithm based on L1-norm was proposed for restoring the images blurred by unknown point spread function (PSF) during imaging. According to the form of total variation, this paper introduced an arithmetic operator of fraction-order total variation and generated a mathematical model of cost. Semi-quadratic regularization was used to solve the model iteratively so that the solution of this algorithm became easier. This paper also analyzed the convergence of this algorithm and then testified its feasibility in theory. The experimental results showed the proposed algorithm can increase the PSNR of the restored image by 1 dB in relation to the first order total variation blind restoration method and Bayesian blind restoration method. The details in real blurred image were also pretty well restored. The effectiveness of the proposed algorithm revealed that it was practical in the blind image restoration.     

A summability method for the arithmetic Fourier transform

The Arithmetic Fourier Transform (AFT) is an algorithm for the computation of Fourier coefficients, which is suitable for parallel processing and in which there are no multiplications by complex exponentials. This is accomplished by the use of the Möbius function and Möbius inversion. However, the algorithm does require the evaluation of the function at an array of irregularly spaced points. In the case that the function has been sampled at regularly spaced points, interpolation is used at the intermediate points of the array. Generally theAFT is most effective when used to calculate the Fourier cosine coefficients of an even function.In this paper a summability method is used to derive a modification of theAFT algorithm. The proof of the modification is quite independent of theAFT itself and involves a summation by primes. One advantage of the new algorithm is that with a suitable sampling scheme low order Fourier coefficients may be calculated without interpolation.