Efficient implementation of the Volterra filter

Author

Reed, M.J. ; Hawksford, M.O.J.

Author_Institution

Dept. of Electron. Syst. Eng., Essex Univ., Colchester, UK

Volume

147

Issue

2

fYear

2000

fDate

4/1/2000 12:00:00 AM

Firstpage

109

Lastpage

114

Abstract

An efficient implementation of the Volterra filter is presented which uses a frequency domain representation to reduce the number of computations. The multidimensional convolution of the Volterra filter is transformed to the frequency domain giving a transformed input matrix which is sparse and obtained directly from a one-dimensional Fourier transform, in addition to the sparse nature of the transformed input matrix, symmetries in both the Volterra filter and the frequency domain representation are exploited to increase the efficiency of the algorithm. The computational saving is demonstrated by comparing it with the direct implementation of the time domain representation and another technique which uses a frequency domain representation but does not utilise symmetry

Keywords

Fourier transforms; Volterra series; computational complexity; convolution; filtering theory; frequency-domain synthesis; multidimensional signal processing; nonlinear filters; sparse matrices; Volterra filter; computational complexity reduction; efficient implementation; frequency domain representation; multidimensional convolution; one-dimensional Fourier transform; sparse matrix; transformed input matrix;

fLanguage

English

Journal_Title

Vision, Image and Signal Processing, IEE Proceedings -

Publisher

iet

ISSN

1350-245X

Type

jour

DOI

10.1049/ip-vis:20000183

Filename

848572