Abstract
Iterative digital signal processing algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. In this paper we propose a novel method to determine the iteration bound, which is the fundamental lower bound of the iteration period of a processing algorithm, by using the minimum cycle mean algorithm to achieve a lower polynomial time complexity than existing methods. It is convenient to represent many multi-rate signal processing algorithms by multi-rate data-flow graphs. The iteration bound of a multi-rate data-flow graph (MRDFG) can be determined as the iteration bound of the single-rate data-flow graph (SRDFG) equivalent of the MRDFG. We present an approach to eliminate node redundancy in the equivalent SRDFG for faster determination of the iteration bound of an MRDFG.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings |
| Publisher | IEEE |
| Pages | 163-168 |
| Number of pages | 6 |
| State | Published - Dec 1 1994 |
| Event | Proceedings of the 1994 IEEE Asia-Pacific Conference on Circuits and Systems - Taipei, Taiwan Duration: Dec 5 1994 → Dec 8 1994 |
Other
| Other | Proceedings of the 1994 IEEE Asia-Pacific Conference on Circuits and Systems |
|---|---|
| City | Taipei, Taiwan |
| Period | 12/5/94 → 12/8/94 |