Download:
|
by Rainer Schoenen
In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing
http://www.ert.rwth-aachen.de/Projekte/Tools/papers/cad_Zivojnovic96icassp.ps.gz
Add To MetaCart
Abstract:
In the paper retiming of DSP algorithms exhibiting multirate behavior is treated. Using the non-ordinary marked graph model and the reachability theory, we provide a new condition for valid retiming of multirate graphs. We show that for a graph with n nodes the reachability condition can be split into the reachability condition for the topologically-equivalent unit-rate graph (all rates set to one), and (n
Citations
|
954
|
Petri nets: Properties, analysis and applications
– Murata
- 1989
|
|
454
|
Software pipelining: An effective scheduling technique for VLIW machines
– Lam
- 1988
|
|
271
|
Static scheduling of synchronous data flow programs for digital signal processing
– Lee, Messerschmitt
- 1987
|
|
69
|
Properties of a model for parallel computations: determinacy, termination, queueing
– Karp, Miller
- 1966
|
|
55
|
Algorithm transformation techniques for concurrent processors
– Parhi
- 1989
|
|
28
|
Decidability questions for Petri nets
– Hack
- 1976
|
|
16
|
Digital Receiver Design using VHDL Generation from Data Flow Graphs
– Zepter, Groker, et al.
- 1995
|
|
15
|
A coupled hardware and software architecture for programmable digital signal processors
– Lee
- 1986
|
|
9
|
Circuit theoretic analysis and synthesis of marked graphs
– Murata
- 1977
|
|
8
|
Rabaey, "Scheduling of DSP programs onto multiprocessors for maximum throughput
– Hoang, M
- 1993
|
|
1
|
On weighted T-systems," Apllication and Theory of Petri Nets
– Teruel, Chrzatowsky-Wachtel, et al.
- 1992
|
|
1
|
The Art of Computer Programming - Vol
– Wiley
- 1987
|