登录
首页 » Others » 基于LMS 算法的多麦克风降噪

基于LMS 算法的多麦克风降噪

于 2020-11-28 发布
0 635
下载积分: 1 下载次数: 15

代码说明:

武汉理工大学 信息处理课设 基于LMS 算法的多麦克风降噪 给定主麦克风录制的受噪声污染的语音信号和参考麦克风录制的噪声,实现语音增强的目标,得到清晰的语音信号。2007控制科学与工程全国博士生学术论坛2007年8月其中日为语音信号与麦克风阵列所在平面的夹角,d为麦克风间距,c为声音传播速度,f为信号采样率。固定波束形成器通过延时求和单元产生参考语音信号y(n),y(n)与y(m)分别代表期望语音信号与噪声信号。y,(n)4x(m)=y(m)+y/(m(3)信号通过阻塞矩阵产生噪声参考信号用来估计波束形成输出信号中的噪声成分。选取B使其中任意行向量之和为零,即任意行向量线性无关。为了进一步降低噪声参考信号中的语音泄漏,参考文献“提出了用自适应阻塞矩阵替代固定阻塞矩阵的方法。ynly2nMM-[nJ]=BLun], u2n],umn自适应噪声抵消器ANC通过对输入噪声参考信号进行自适应滤波处理抵消了参考信号y,(m)中的噪声成分,得到增强的语音信号。em]=y[m-∑nnl3LMS自适应算法及改进31LMS自适应算法GSC架构中的自适应噪声抵消器ANC需要用增强的语音信号作为反馈对滤波器权值进行自适应更新。很多自适应算法基于LMS及其改进形式, Clark提出的块LMS算法使得滤波器的自适应逐块更新而非传统LMS滤波器逐点更新4, HOSHUYAMA、 Kellermann分别提出的基于范数约束自适应算法的权值更新,以及频域无约束实现。这些算法基本结构如图2所示y(n-1)(n-L+1)wo(ne(ny/(n)图2自适应横向滤波器结构图图2为图1中的M-1路L阶多通道自适应噪声对消器中某一路的展开形式,其抽头输入向量为[ym]yn-]yn-L+1],对应的抽头权向量为wmwn]w-]。LMS算法的梯度向量通过G2007控制科学与工程全国博士生学术论坛2007年8月计算抽头输入相关矩阵R和抽头输入与期望响应间互相关向量p得到VJ(n)=-2p+2Rv(m),将R和p的瞬态估计R(n)=y(m)y"(n),p(n)=y(n)y/(m)代入,得出梯度向量的瞬态估计:VJ(n)=-2y(n)y, (n+2y(n)y"(n)w(n)进而推出LMS算法权值更新公式为w(n+1)=w(n)+uy(n)Ly(n)-y"(n)w(n)32基于稳态噪声的自适应算法改进考查图2中具有L个抽头权值的LMS算法,抽头权值与抽头输入一一对应。在传统的逐点更新LMS算法中,每计算一个输出需要L次乘法,而更新一次抽头权值也需要L次乘法,故每次迭代需要2L次乘法。对于L个输出样值,所需要的乘法次数为2次。针对传统LMS算法复杂度高的缺点,Ca利用离散傅立叶变换在频域完成滤波器系数的自适应提出了快速块LMS箅法, Ann Spriet在此基础上通过改进LMS算法中的步长矩阵进一步降低了算法复杂度以上LMS算法改进均在图2的横向滤波器架构下进行,即抽头权值与抽头输入一一对应。考虑到稳态噪声的特点,本文提出了“一对多”的滤波器抽头权值更新算法,即L个输入样值共享一个滤波器权值。如此M路多麦克风语音增强系统中的ANC滤波器权值便由(M-1)×L维矩阵W[n=[w[η],n2[rl…wM-[r],其中H[n]=[won],w1[nw-r]退化为(M-1)×1维向量n]=[wryw2n],M-m]j。改进算法权值更新公式为w(n+D)=w(n)+uBu(nu"(n)[A-Bw(n)其中B为阻塞矩阵,A为固定波束形成器,为步长,U(n)为LxM维输入信号。与传统的“一对一”LMS滤波器相比,“一对多”结构在降低算法复杂度的同时,牺牲了前者具有的时间域严格对齐的特性。为降低这一缺点对系统降噪性能的影响,应在频域进行噪声对消,改进算法的多麦克风语音增强系统结构如图3所示。e(n)(n)B Yn图3改进的噪声消除算法结构图3中用虚线框表示可选滤波器权值w。由于实际应用中语音泄漏的存在,在参考语音信号中加入v能有效补偿由语音泄漏引起的语音崎变⑩。实际应用中由于阻塞矩阵输出不可避免的存在语音泄4642007控制科学与工程全国博士生学术论坛2007年8月漏,为了避免期望信号的消除,箅法中加入语音活动检测单元89,当前帧为噪声时更新滤波器系数,当前帧为语音信号时,滤波器系数不变33算法复杂度比较表1列出了本文算法与其他几种噪声消除算法之间算法复杂度的比较。我们采用实数乘法运算次数作为衡量算法复杂度的标准,每个N点傅立叶变换或其反变换需要Mlog2N次实数乘法运算。传统逐点LMS算法在时间域逐点更新滤波器权值。快速块LMS算法与多通道 Wiener算法通过FFT快速循环卷积特性实现LMS中的线性卷积运算,从而降低算法复杂度。本文算法在此基础上通过改进滤波器抽头权值更新算法进一步降低运算复杂度。由表1可见,当麦克风数目M4,L=32时,本文算法与多通道 Wiener滤波算法相比,R(3M+2)FT+8ML+2M63M+2)+4M2+6M_172(M+2)FFT+2ML6(M+2)+M40°文算法运算量降低了4倍左右。表1算法复杂度比较算法名称算法复杂度传统逐点LMS算法2ML快速块LMS算法(41(3M+2)FFT+16ML多通道 Wiener滤波算法53M+2)FFT+8M2+12M本文提出的算法(M+2)FF+2M…图4a)麦克风采集到的原始信号b)采用快速块LMS算法处理后的信号[4]c)采用多通道 Wiener滤波算法[10处理后的信号d采用本文算法处理后的信号4实验结果与分析实验采用线性排列的4个间距为4厘米的麦克风组成的语音采集系统,采样率为44KHZ,说话人位于阵列的正前方,噪声为稳态噪声,其与麦克风阵列法线所夹角度为50度。图4比较了麦克风采集到的信号、采用本文算法处理后的语音信号以及采用其他主流语音增强算法处理后的语音信号的时域波形。由4652007控制科学与工程全国博士生学术论坛2007年8月图4可见采用本文算法处理的语音信号背景噪声有明显降低。为进一步分析各种语音增强算法消噪能力,分别按照公式9计算各算法输出信号的信噪比,其中k代表帧序列号,N代表噪声,Y代表输出语音信号,L为帧长。∑(Y(k,2)2-|N(k,)SNRou(E)=10 log,o∑1MV6)图5釆用各箅法输出信号信噪比与输入信号信噪比之差来衡量噪声降低程度。由图5看出,在本文算法基础上在参考通道中加入可选滤波器权值能够进一步消除背景噪声,提高输出信噪比。苯文鲜法(使用权值w)木文好法未使用权值y块LMS算法Frame Number图5信噪比增强对比5结论本文在稳态噪声的前提下,提出了一种基于广义旁瓣消除器架构具有低算法复杂度的噪声消除算法,该算法通过改进LMS滤波器权值更新算法来达到降低算法复杂度的目的。实验结果证明,在稳态噪声环境下,该方法降噪性能优于传统LMS算法,同时有效降低了传统算法的算法复杂度。在现实生活中一些存在稳态噪声的场合,如发动机舱、厂房等该算法具有很强的实用价值。参考文献[U]LJ. Griffiths and C. W. Jim []. "An altemative approach to linearly constrained adaptive beamforming, IEEE Trans. AntennasProcess., voL. AP-30, no. I, pp 27-34, Jan. 1982.[2]0. Hoshuyama, A Sugiyama, and A Hirano [J]. "A robust adaptive beamformer for microphone arrays with a blocking matrixusing constrained adaptive filters, "IEEE Trans. Signal Process. vol 47, pp. 2677-2683, Oct. 1999[3]W. Herbordt and W Kellermann [J]. " Frequency-domain integration of acoustic echo cancellation and a generalized sidelobecanceller with improved robustness, "Eur. Trans. Telecommun., voL. 13, no 2, pp 123-132, Mar. -Apr. 2002.[4]Clark. G.A., S K Mitra, and S.R. Parker [J]. Block implementation of adaptive digital filters, "IEEE Trans. Circuits Syst,voL. CAS-28,PP584-592.1981.[5]Ann Spriet, Jan Wouters, Simon Doclo, Marc Moonen, "Frequency-Domain Criterion for the Speech Distortion WeightedMultichannel Wiener Filter for Robust Noise Reduction", Ap: //ftp. esat kuleuven. ac, be/pub/SISTA/doclo/reports/04-240 pdf[6JH. Buchner, J. Benesty, W. Kellermann J]. Generalized multichannel frequencydomain adaptive filtering: efficient realizationand application to hands free speech communication", Signal Processing 85(3), PP 549-570. 2005[7]W.Herbordt and W. Kellermann [A]. " Efficient Frequency-domain realization of robust generalized sidelobe cancellers", IEEE4662007控制科学与工程全国博士生学术论坛2007年8月Fourth workshop, multimedia signal Processing, PP. 377-382 2001[8]S. Van Gerven, F. Xie [J. "A Comparative Study of Speech Detection Methods", Proc. EUROSPEECH, VoL 3, Rhodos, Greecepp.1095-1098.1997[9]J Sohn, N.S.Kim, W Sung [] A Statistical Model-Based Voice Activity Detection", IEEE Signal Processing Lett. 6(1)1-31999[10]A Spriet, M. Moonen, J Wouters[]. Robustness Analysis of Multi-channel wiener Filtering and generalized sidelobeCancellation for Multi-microphone Noise Reduction in Hearing Aid Applications", IEEE Trans. Speech and Audio Processing, 13(4)PP.487-503.2005[IlJFerrara, E R r [] Fast implementation of LMS adaptive filters", IEEE Trans. Acoust. Speech Signal Process,voL.ASSP-28pp474-475.1980[12]S. Doclo and M. Moonen[J]. " Multi-microphone noise reduction using recursive GSVD-based optimal filtering with ANCpostprocessing stage, "IEEE Trans. Speech Audio Process., vol. 13, no. 1,Pp 53-69, Jan. 2005[13]Philipos C Loizou [J]. "Speech Enhancement Based on Perceptually Motivated Bayesian Estimators of the MagnitudeSpectrum" IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL 13, NO 5, Pp.857-869, 2005种新的基于稳态噪声的噪声消除算法旧WANFANG DATA文献链接作者:董鹏宇,朱子元,林涛作者单位:同济大学超大规模集成电路研究所,上海20009本文链接http://d.g.wanfangdata.comcn/confereNce6584700.aspx

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Introduction.to.Stochastic.Processes.with.R
    An introduction to stochastic processes through the use of RIntroduction to Stochastic Processes with R is an accessible and well-balanced presentation of the theory of stochastic processes, with an emphasis on real-world applications of probability theory in the natural and social sciences. The uINTRODUCTIONTO STOCHASTICPROCESSES WITH RINTRODUCTIONTO STOCHASTICPROCESSES WITH RROBERT P DOBROWWILEYCopyright o 2016 by John Wiley Sons, Inc. All rights reservedPublished by John Wiley Sons, Inc, Hoboken, New JerseyPublished simultaneously in CanadaNo part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form orby any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except aspermitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the priorwritten permission of the Publisher, or authorization through payment of the appropriate per-copy fee tothe Copyright Clearance Center, Inc, 222 Rosewood Drive, Danvers, MA,(978)750-8400, fax978)750-4470,oronthewebatwww.copyright.comRequeststothePublisherforpermissionshouldbe addressed to the Permissions Department, John Wiley sons, Inc, lll River Street, Hoboken, NJ07030,(201)748-6011,fax(201)748-6008,oronlineathttp://www.wiley.com/go/permissionsLimit of liability/ Disclaimer of warranty While the publisher and author have used their best efforts inpreparing this book, they make no representations or warranties with respect to the accuracy orcompleteness of the contents of this book and specifically disclaim any implied warranties ofmerchantability or fitness for a particular purpose. No warranty may be created or extended by salesrepresentatives or written sales materials. The advice and strategies contained herein may not be suitablefor your situation. You should consult with a professional where appropriate. Neither the publisher norauthor shall be liable for any loss of profit or any other commercial damages, including but not limited tospecial, incidental, consequential, or other damagesFor general information on our other products and services or for technical support, please contact ourCustomer Care Department within the United States at(800)762-2974, outside the United States at(317)572-3993 or fax(317)572-4002Wiley also publishes its books in a variety of electronic formats. Some content that appears in print maynot be available in electronic formats. For more information about Wiley products, visit our web site atwww.wiley.comLibrary of Congress Cataloging-in-Publication Data:Dobrow. Robert p. authorIntroduction to stochastic processes with r/ Robert P. Dobrowpages cmIncludes bibliographical references and indexISBN978-1-118-74065-1( cloth)1. Stochastic processes. 2. R( Computer program language)I. TitleQC20.7.S8D6320165192′302855133-dc232015032706Set in 10/12pt, Times-Roman by SPi Global, Chennai, IndiaPrinted in the united states of america1098765432112016To my familyCONTENTSPrefaceAcknowledgmentsList of Symbols and Notationabout the companion Website1 Introduction and review1.1 Deterministic and stochastic models. 11. 2 What is a Stochastic Process? 61. 3 Monte Carlo Simulation. 91.4 Conditional Probability, 101. 5 Conditional Expectation, 18Exercises. 342 Markov Chains: First Steps402.1 Introduction. 402.2 Markov Chain Cornucopia, 422.3 Basic Computations, 522. 4 Long-Term behavior-the Numerical evidence, 592.5 Simulation. 652.6 Mathematical Induction*. 68Exercises. 70CONTENTS3 Markov Chains for the long term763.1 Limiting Distrib763.2 Stationary Distribution, 803.3 Can you find the way to state a? 943.4 Irreducible markov Chains. 1033.5 Periodicity, 1063.6 Ergodic Markov Chains, 1093.7 Time Reversibility, 1143.8 Absorbing Chains, 1199 Regeneration and the strong markov property 1333.10 Proofs of limit Theorems*, 135Exercises. 1444 Branching processes1584.1 Introduction. 1584.2 Mean Generation Size. 1604.3 Probability Generating Functions, 1644.4 Extinction is Forever. 168Exercises. 1755 Markov Chain Monte Carlo1815.1 Introduction. 1815.2 Metropolis-Hastings Algorithm, 1875.3 Gibbs Sampler, 1975.4 Perfect Sampling*, 20.55.5 Rate of Convergence: the Eigenvalue Connection*, 2105.6 Card Shuffing and Total Variation Distance. 212Exercises. 2196 Poisson process2236.1 Introduction. 2236.2 Arrival. Interarrival Times. 2276.3 Infinitesimal Probabilities. 2346.4 Thinning, Superposition, 2386.5 Uniform Distribution. 2436.6 Spatial Poisson Process, 2496.7 Nonhomogeneous Poisson Process. 2536.8 Parting Paradox, 255Exercises. 2587 Continuous- Time markov Chains2657.1 Introduction. 265
    2020-12-10下载
    积分:1
  • 数字信号处理仿真:滤波器 采样定理 卷积演示
    MATLAB 卷积 滤波器 采样定理(是动态演示的哦)
    2020-11-29下载
    积分:1
  • 计算机视觉 ——上海交通大学 ppt
    上海交通大学计算机视觉实验室有关计算机视觉方面的ppt。代表了国内的最新水平
    2021-05-06下载
    积分:1
  • MIMO-OFDM系统基于导频信道估计算法仿真
    论文介绍MIMO-OFDM系统中几种基于导频的信道估计方法。首先研究了单天线OFDM系统的信道估计算法。一方面重点关注三种估计准则的原理,仿真表明LMMSE准则具有最佳的性能;另一方面介绍了几种插值的方法用来恢复非导频处的信道信息。然后研究了发射分集OFDM系统的信道估计,重点分析了三种导频的设计方案。仿真表明,使用最佳训练序列可以达到最优的性能,同时占用的资源少,但是复杂度很高。关键词:无线移动通信;正交频分复用;多输入多输出;信道估计;最小均方误差;最佳训练序
    2020-11-29下载
    积分:1
  • NASA PCoE实验室锂电池数据集
    NASA PCoE实验室锂电池数据集:BatteryAgingARC_25_26_27_28_P1。数据集主要用来做剩余寿命预测。
    2020-11-27下载
    积分:1
  • 单相逆变器重复控制和双环控制技术研究.pdf
    单相逆变器重复控制和双环控制技术研究.pdf
    2020-12-08下载
    积分:1
  • 傅里叶变换
    本程序是基于matlab编写的快速傅里叶变换的代码,程序可完美运行,仅供完成课堂作业参考,有需要改进的地方请指出。傅里叶变换(FT, Fourier Transform)的作用是将一个信号由时域变换到频域。其实就是把数据由横坐标时间、纵坐标采样值的波形图格式,转换为横坐标频率、纵坐标振幅(或相位)的频谱格式。变换后可以很明显地看出一些原先不易察觉的特征。
    2019-03-27下载
    积分:1
  • C6678 evm 官方光盘中的重要资料
    【实例简介】主要包含如下内容,移除了光盘中的软件安装包 1.TMDXEVM6657L_HW_Docs Contains the hardware documentation for TMDSEVM6657LS. 2.TMDXEVM6670L_HW_Docs Contains the hardware documentation for TMDXEVM6670L. 3.TMDXEVM6678L_HW_Docs Contains the hardware documentation for TMDXEVM6678L. 4.TMDSEVM6657LS_Quick_Setup_Guide.pdf Contains the quick setup guide for TMDSEVM6657LS. 5.TMDSEVM6670L_EVM_Quick_Start_Guide.pdf Contains the quick setup guide for TMDXEVM6670L. 6.TMDSEVM6678L_EVM_Quick_Start_Guide.pdf Contains the quick setup guide for TMDXEVM6678L.
    2021-10-30 00:31:52下载
    积分:1
  • 简单图像显著性特征提取matlab代码
    简单图像显著性特征提取matlab代码,代码仅有几行,很容易实现,效果比较明显。
    2020-12-06下载
    积分:1
  • 樊昌信《通信原理》研究生考试考点精讲
    【实例简介】樊昌信《通信原理》研究生考试考点精讲,2020年全国研究生招生考试海文考研专业课辅导教材(南京邮电大学)
    2021-08-11 00:31:04下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载