Abstract
In this paper an adaptive broadband beamformer is presented which is based on a partitioned frequency-domain least-mean-square algorithm (PFDLMS). This block algorithm is known for its efficient computation and fast convergence even when the input signals are correlated. In applications where long filters are required but only a small processing delay is allowed, a frequency domain adaptive beamformer without partitioning demands a large FFT length despite the small block size. The FFT length can be shortened significantly by filter partitioning, without increasing the number of FFT operations. The weaker requirement on the FFT size makes the algorithm attractive for acoustical applications.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
