抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 62-70 |
| ページ数 | 9 |
| ジャーナル | Systems, computers, controls |
| 巻 | 11 |
| 号 | 1 |
| 出版ステータス | Published - 1980 1月 1 |
| 外部発表 | はい |
ASJC Scopus subject areas
- 工学（全般）