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.
|Number of pages||9|
|Journal||Systems, computers, controls|
|Publication status||Published - 1980 Jan 1|
ASJC Scopus subject areas