The efficiency of computational procedures for recursive digital filters

RM M. Goodall, MG G. Goodall

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The paper contrasts a number of approaches for computing recursive digital filters, with a particular emphasis upon high sample rate designs such as are typical for real-time digital control applications. Firstly, a useful method is presented by which the precision of computation can be determined. This is then applied to first- and second-order filter examples. A discussion follows of suitable data types for a high level language approach, and computation times are determined as compared with the opposite extreme of a purely Assembly language approach. Two additional intermediate approaches are assessed: a totally high level approach but using a special purpose multiplication procedure, and a partially high level approach which employs an Assembly language multiplication routine. The comparison is broadened by giving computation times for the four approaches when implemented on three different types of processor system. Important conclusions regarding the choice between high and low level programming are drawn from the assessment of computation times.

LanguageEnglish
Pages587-596
Number of pages10
JournalMicroprocessors and Microsystems
Volume17
Issue number10
DOIs
Publication statusPublished - 1 Jun 1993
Externally publishedYes

Fingerprint

Digital filters
High level languages

Cite this

@article{6c6a9dbe858a4e829e42d19318e66dd1,
title = "The efficiency of computational procedures for recursive digital filters",
abstract = "The paper contrasts a number of approaches for computing recursive digital filters, with a particular emphasis upon high sample rate designs such as are typical for real-time digital control applications. Firstly, a useful method is presented by which the precision of computation can be determined. This is then applied to first- and second-order filter examples. A discussion follows of suitable data types for a high level language approach, and computation times are determined as compared with the opposite extreme of a purely Assembly language approach. Two additional intermediate approaches are assessed: a totally high level approach but using a special purpose multiplication procedure, and a partially high level approach which employs an Assembly language multiplication routine. The comparison is broadened by giving computation times for the four approaches when implemented on three different types of processor system. Important conclusions regarding the choice between high and low level programming are drawn from the assessment of computation times.",
keywords = "digital filters, high/low level programming, quantization",
author = "Goodall, {RM M.} and Goodall, {MG G.}",
year = "1993",
month = "6",
day = "1",
doi = "10.1016/S0141-9331(05)80003-1",
language = "English",
volume = "17",
pages = "587--596",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "10",

}

The efficiency of computational procedures for recursive digital filters. / Goodall, RM M.; Goodall, MG G.

In: Microprocessors and Microsystems, Vol. 17, No. 10, 01.06.1993, p. 587-596.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The efficiency of computational procedures for recursive digital filters

AU - Goodall, RM M.

AU - Goodall, MG G.

PY - 1993/6/1

Y1 - 1993/6/1

N2 - The paper contrasts a number of approaches for computing recursive digital filters, with a particular emphasis upon high sample rate designs such as are typical for real-time digital control applications. Firstly, a useful method is presented by which the precision of computation can be determined. This is then applied to first- and second-order filter examples. A discussion follows of suitable data types for a high level language approach, and computation times are determined as compared with the opposite extreme of a purely Assembly language approach. Two additional intermediate approaches are assessed: a totally high level approach but using a special purpose multiplication procedure, and a partially high level approach which employs an Assembly language multiplication routine. The comparison is broadened by giving computation times for the four approaches when implemented on three different types of processor system. Important conclusions regarding the choice between high and low level programming are drawn from the assessment of computation times.

AB - The paper contrasts a number of approaches for computing recursive digital filters, with a particular emphasis upon high sample rate designs such as are typical for real-time digital control applications. Firstly, a useful method is presented by which the precision of computation can be determined. This is then applied to first- and second-order filter examples. A discussion follows of suitable data types for a high level language approach, and computation times are determined as compared with the opposite extreme of a purely Assembly language approach. Two additional intermediate approaches are assessed: a totally high level approach but using a special purpose multiplication procedure, and a partially high level approach which employs an Assembly language multiplication routine. The comparison is broadened by giving computation times for the four approaches when implemented on three different types of processor system. Important conclusions regarding the choice between high and low level programming are drawn from the assessment of computation times.

KW - digital filters

KW - high/low level programming

KW - quantization

UR - http://www.scopus.com/inward/record.url?scp=0004886959&partnerID=8YFLogxK

U2 - 10.1016/S0141-9331(05)80003-1

DO - 10.1016/S0141-9331(05)80003-1

M3 - Article

VL - 17

SP - 587

EP - 596

JO - Microprocessors and Microsystems

T2 - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 10

ER -