The University of Southampton
University of Southampton Institutional Repository

New resource saving differential coefficient coding algorithm for recursive FIR filter design

New resource saving differential coefficient coding algorithm for recursive FIR filter design
New resource saving differential coefficient coding algorithm for recursive FIR filter design
Differential coefficient coding converts a non-recursive FIR filter into a recursive filter with the aim of reducing both maximum and average coefficient magnitudes. This paper describes a new efficient resource saving differential coefficient coding algorithm for linear phase FIR filters. The savings are obtained by not restricting the recursive section coefficients to variations of the binomial distribution as with previous approaches suitable only for narrow-band filters. Instead, an optimisation is carried out to minimise the variance of the encoded coefficients affording maximum hardware reduction for both narrow and wide-band filtering functions. Implementation of recursive FIR filters produced by the algorithm requires use of parallel filter decomposition and feedthrough accumulator structures which are both described in deatil. When compared with previous approaches, resource savings of over 40% are demonstrated.
478-81
Living, J
9be8483d-f7b0-4bfd-8bcc-8c9b16829e91
Al-Hashimi, B.M.
0b29c671-a6d2-459c-af68-c4614dce3b5d
Living, J
9be8483d-f7b0-4bfd-8bcc-8c9b16829e91
Al-Hashimi, B.M.
0b29c671-a6d2-459c-af68-c4614dce3b5d

Living, J and Al-Hashimi, B.M. (1999) New resource saving differential coefficient coding algorithm for recursive FIR filter design At IEEE International Symposium on Circuits and Systems, USA. , pp. 478-81.

Record type: Conference or Workshop Item (Other)

Abstract

Differential coefficient coding converts a non-recursive FIR filter into a recursive filter with the aim of reducing both maximum and average coefficient magnitudes. This paper describes a new efficient resource saving differential coefficient coding algorithm for linear phase FIR filters. The savings are obtained by not restricting the recursive section coefficients to variations of the binomial distribution as with previous approaches suitable only for narrow-band filters. Instead, an optimisation is carried out to minimise the variance of the encoded coefficients affording maximum hardware reduction for both narrow and wide-band filtering functions. Implementation of recursive FIR filters produced by the algorithm requires use of parallel filter decomposition and feedthrough accumulator structures which are both described in deatil. When compared with previous approaches, resource savings of over 40% are demonstrated.

Full text not available from this repository.

More information

Published date: May 1999
Additional Information: Address: USA
Venue - Dates: IEEE International Symposium on Circuits and Systems, USA, 1999-05-01
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 251497
URI: http://eprints.soton.ac.uk/id/eprint/251497
PURE UUID: 123130f0-d188-492b-b23e-c8fa2ad77665

Catalogue record

Date deposited: 13 Apr 2000
Last modified: 18 Jul 2017 10:09

Export record

Contributors

Author: J Living
Author: B.M. Al-Hashimi

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×