A New Two-Dimensional Parallel Block Adaptive Filter with Reduced Computational Complexity

Shigenori KINJO; Masafumi OSHIRO; Hiroshi OCHI

A New Two-Dimensional Parallel Block Adaptive Filter with Reduced Computational Complexity

Shigenori KINJO, Masafumi OSHIRO, Hiroshi OCHI

Full Text Views

0

Share
Cite this

Summary :

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 ADF's require a lot of computations. For example, the TDLMS requires 2N² multiplications per pixel. We propose a new 2-D adaptive filter using the FFTs. The proposed adaptive filter carries out the fast convolution using overlap-save method, and has parallel structure. Thus, we can reduce the computational complexity to O(log₂N) per pixel.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.6 pp.1008-1012

Publication Date: 1998/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from ITC-CSCC'97)

Category: Digital Signal Processing

Cite this

Copy

Shigenori KINJO, Masafumi OSHIRO, Hiroshi OCHI, "A New Two-Dimensional Parallel Block Adaptive Filter with Reduced Computational Complexity" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 6, pp. 1008-1012, June 1998, doi: .
Abstract: 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 ADF's require a lot of computations. For example, the TDLMS requires 2N² multiplications per pixel. We propose a new 2-D adaptive filter using the FFTs. The proposed adaptive filter carries out the fast convolution using overlap-save method, and has parallel structure. Thus, we can reduce the computational complexity to O(log₂N) per pixel.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e81-a_6_1008/_p

Copy

@ARTICLE{e81-a_6_1008,
author={Shigenori KINJO, Masafumi OSHIRO, Hiroshi OCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Two-Dimensional Parallel Block Adaptive Filter with Reduced Computational Complexity},
year={1998},
volume={E81-A},
number={6},
pages={1008-1012},
abstract={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 ADF's require a lot of computations. For example, the TDLMS requires 2N² multiplications per pixel. We propose a new 2-D adaptive filter using the FFTs. The proposed adaptive filter carries out the fast convolution using overlap-save method, and has parallel structure. Thus, we can reduce the computational complexity to O(log₂N) per pixel.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - A New Two-Dimensional Parallel Block Adaptive Filter with Reduced Computational Complexity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1008
EP - 1012
AU - Shigenori KINJO
AU - Masafumi OSHIRO
AU - Hiroshi OCHI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1998
AB - 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 ADF's require a lot of computations. For example, the TDLMS requires 2N² multiplications per pixel. We propose a new 2-D adaptive filter using the FFTs. The proposed adaptive filter carries out the fast convolution using overlap-save method, and has parallel structure. Thus, we can reduce the computational complexity to O(log₂N) per pixel.
ER -