By Topic

A new two-dimensional parallel block adaptive filter with reduced computational complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Kinjo ; Dept. of Electr. & Electron. Eng., Ryukyus Univ., Okinawa, Japan ; M. Oshiro ; H. Ochi

Two-dimensional (2-D) adaptive digital filters (ADFs) for 2-D signal processing have become a fascinating area of the adaptive signal processing. However, conventional 2-D FIR ADFs require a lot of computations. For example, the TDLMS requires 2N2 multiplications per pixel. We propose a new 2-D adaptive filter using FFTs. The proposed adaptive filter carries out fast convolution using the overlap-save method, and has a parallel structure. Thus, we can reduce the computational complexity to O(log2N) per pixel

Published in:

Acoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on  (Volume:3 )

Date of Conference:

21-24 Apr 1997