Some algorithms of variable step size LMS adaptive filtering are studied．The VS—LMS algorithm is improved． Another new non-linear function between肛and e(／ t)is established．The theoretic analysis and computer simulation results show that this algorithm converges more quickly than the origina1．Furthermore，better antinoise property is exhibited under Low—SNR environment than the original one．
标签： algorithms LMS algorithm filtering
上传时间： 2014-01-23
上传用户：yxgi5
1-D optimal step size using golden section
标签： optimal section golden using
上传时间： 2014-12-19
上传用户：lnnn30
By using a MATLAB program, design a Delta Modulation (DM) system with one step-size and a modified DM system with two step-sizes.
标签： Modulation step-size modified program
上传时间： 2017-08-15
上传用户：LIKE
利用TPM2定时器产生一通道语音信号输出，语音数据为PCM格式:PCM的概念脉冲编码调制(Pulse Code Modulation，PCM)是概念上最简单、理论上最完善的编码系统，是最早研制成功、使用最为广泛的编码系统，但也是数据量最大的编码系统。PCM的编码原理比较直观和简单，它的原理框图如图1-1所示。在这个编码框图中，它的输入是模拟声音信号，它的输出是PCM样本。图中的“防失真滤波器”是一个低通滤波器，用来滤除声音频带以外的信号；“波形编码器”可暂时理解为“采样器”，“量化器”可理解为“量化阶大小(step-size)”生成器或者称为“量化间隔”生成器。
上传时间： 2013-11-21
上传用户：DXM35
By building a nonlinear function relationship between an d the error signal，this paper presents a no— vel variable step size LMS(Least Mean Square)adaptive filtering algorithm．
标签： relationship nonlinear building function
上传时间： 2015-10-22
上传用户：hzy5825468
％BIQPBOX Bisection reflective line search for sqpbox ％ [nx,nsig,alpha] = BIQPBOX(s,c,strg,x,y,sigma,l,u,... ％ oval,po,normg,DS,mtxmpy,data,H) ％ returns the new feasible point nx, the corresponding sign vector nsig, ％ and the step size of the unreflected step, alpha. ％ Copyright (c) 1990-98 by The MathWorks, Inc. ％ $Revision: 1.2 $ $Date:
标签： BIQPBOX reflective Bisection search
上传时间： 2013-12-17
上传用户：sk5201314
In this example we solve the following single ODE Program Name: RKG-1.FOR (Runge-Kutta-Gill algorithm, fixed step size)
标签： Runge-Kutta-Gill following example Program
上传时间： 2014-01-16
上传用户：maizezhen
void Knight(int i , int j) { // printf("％d ％dn",i,j) if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size ) { return } step++ board[i][j]=step if (step == Size*Size) { showboard() system("PAUSE") return } //DFS Knight(i-2,j-1) //left Knight(i-2,j+1) Knight(i+2,j-1) //right Knight(i+2,j+1) Knight(i-1,j-2) //up Knight(i+1,j-2) Knight(i+1,j+2) //down Knight(i-1,j+2) // board[i][j]=0 step-- }
上传时间： 2014-01-17
上传用户：cxl274287265
INTRODUCTION In the past, adding speech recording and playback capability to a product meant using a digital signal processor or a specialized audio chip. Now, using a simplified Adaptive Differential Pulse Code Modulation(ADPCM) algorithm, these audio capabilities can be added to any PICmicro device. This application note will cover the ADPCM compression and decompression algorithms, performance comparison of all PICmicro devices, and an application using a PIC16C72 micro-controller.DEFINITION OF TERMS step size -value of the step used for quantization of ana-log signals and inverse quantization of a number of steps.quantization -the digital form of an analog input signal is represented by a finite number of steps.adaptive quantization -the step size of a quantizer is dramatically changed with time in order to adapt to a changing input signal.inverse quantizer -a finite number of steps is converted into a digital representation of an analog signal.
上传时间： 2022-06-20
上传用户：
The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.
标签： iterations performs Bailey number
上传时间： 2014-01-05
上传用户：libenshu01
