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．
標(biāo)簽： algorithms LMS algorithm filtering
上傳時(shí)間： 2014-01-23
上傳用戶(hù)：yxgi5
1-D optimal step size using golden section
標(biāo)簽： optimal section golden using
上傳時(shí)間： 2014-12-19
上傳用戶(hù)：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.
標(biāo)簽： Modulation step-size modified program
上傳時(shí)間： 2017-08-15
上傳用戶(hù)：LIKE
利用TPM2定時(shí)器產(chǎn)生一通道語(yǔ)音信號(hào)輸出，語(yǔ)音數(shù)據(jù)為PCM格式:PCM的概念脈沖編碼調(diào)制(Pulse Code Modulation，PCM)是概念上最簡(jiǎn)單、理論上最完善的編碼系統(tǒng)，是最早研制成功、使用最為廣泛的編碼系統(tǒng)，但也是數(shù)據(jù)量最大的編碼系統(tǒng)。PCM的編碼原理比較直觀和簡(jiǎn)單，它的原理框圖如圖1-1所示。在這個(gè)編碼框圖中，它的輸入是模擬聲音信號(hào)，它的輸出是PCM樣本。圖中的“防失真濾波器”是一個(gè)低通濾波器，用來(lái)濾除聲音頻帶以外的信號(hào)；“波形編碼器”可暫時(shí)理解為“采樣器”，“量化器”可理解為“量化階大小(step-size)”生成器或者稱(chēng)為“量化間隔”生成器。
標(biāo)簽： TPM2 PCM 定時(shí)器 語(yǔ)音信號(hào)
上傳時(shí)間： 2013-11-21
上傳用戶(hù)：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．
標(biāo)簽： relationship nonlinear building function
上傳時(shí)間： 2015-10-22
上傳用戶(hù)：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:
標(biāo)簽： BIQPBOX reflective Bisection search
上傳時(shí)間： 2013-12-17
上傳用戶(hù)：sk5201314
In this example we solve the following single ODE Program Name: RKG-1.FOR (Runge-Kutta-Gill algorithm, fixed step size)
標(biāo)簽： Runge-Kutta-Gill following example Program
上傳時(shí)間： 2014-01-16
上傳用戶(hù)：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-- }
標(biāo)簽： int Knight printf board
上傳時(shí)間： 2014-01-17
上傳用戶(hù)：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.
上傳時(shí)間： 2022-06-20
上傳用戶(hù)：
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.
標(biāo)簽： iterations performs Bailey number
上傳時(shí)間： 2014-01-05
上傳用戶(hù)：libenshu01
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<button id="uyiow"></button>