GRAPH-THEORETIC STUDY OF PIPELINING IN DIGITAL FILTERS.

Tatsuo Higuchi, Masayuki Kawamata

Research output: Contribution to journalArticle

Abstract

To realize a digital filter by a microprocessor it is necessary to develop an algorithm to achieve high-speed processing. Various digraphs are defined on the basis of a graph-theoretic study of parallel and pipe-lining procesing are clarified, and a graph-theoretic study of parallel and pipe-lining processing is presented. A digraph G//T is defined and an order of calculations, and computation time for parallel processing of filters with arbitrary structures are obtained graph theoretically by obtaining a longest path algorithm for G//T. An algorithm is obtained to determine the structure so that the degree of the parallel execution of multiplications on the longest paths is maximized.

Original languageEnglish
Pages (from-to)62-70
Number of pages9
JournalSystems, computers, controls
Volume11
Issue number1
Publication statusPublished - 1980 Jan 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'GRAPH-THEORETIC STUDY OF PIPELINING IN DIGITAL FILTERS.'. Together they form a unique fingerprint.

Cite this