Kazuhito Ito, Keshab K. Parhi  Home/Search
Context Related
| umn.edu/groups/ddp/...jvlsisp_95_ito.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umn.edu/groups/ddp/small_pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Digital signal processing algorithms are repetitive in nature. These algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, there exists a fundamental lower bound on the iteration period referred to as the iteration bound. Determining the iteration bound for signal processing algorithms described by iterative data-flow graphs is an important problem. In this paper we review two existing algorithms... (Update)
Context of citations to this paper: More
...achieve the iteration lower bound. The technique to compute the iteration lower bound for a given processing algorithm can be found in [9] [12] Fig. 3(a) shows a schedule of some processing algorithm. The duration to execute every operation in the processing algorithm...
...be multi rate. In a multi rate system, each task can have a different rate whereas in a single rate system, each task has the same rate [65]. Since there are techniques to transform a multi rate cyclic system into an equivalent single rate one, e.g. see [65] we do not lose...
Cited by: More
Behavioral Level Guidance Using Property-Based Design.. - Lisa Marie Guerra (1996) (Correct)
The Hierarchical Timing Pair Model for Synchronous.. - Chandrachoodan.. (2000) (Correct)
Efficient Algorithms for Optimum Cycle Mean and Optimum.. - Dasdan, Irani, Gupta (1999) (Correct)
Similar documents (at the sentence level):
34.8%: Determining the Iteration Bounds of Single-Rate and Multi-Rate .. - Kazuhito Ito (1994) (Correct)
Active bibliography (related documents): More All
1.7: Determining the Minimum Iteration Period of an Algorithm - Ito (1995) (Correct)
0.5: An Overlapped Scheduling Method for an Iterative Processing.. - Kazuhito Ito (Correct)
0.4: Special-Case Techniques for the Efficient Computation of.. - Gerez, de Jong, al. (1995) (Correct)
Similar documents based on text: More All
0.4: ENEE 759E: Rate-optimal, iterative scheduling (Handout 20) - Shuvra Bhattacharyya Enee (Correct)
0.2: ILP Based Cost-Optimal DSP Synthesis with Module Selection.. - Ito, Lucke, Parhi (1999) (Correct)
0.1: Module Selection and Data Format Conversion for Cost-Optimal .. - Ito, Lucke, Parhi (1994) (Correct)
Related documents from co-citation: More All
7: Performance analysis and optimization of asynchronous circuits - Burns - 1991
6: Synchronizationand Linearity (context) - Baccelli, Cohen et al. - 1992
6: Finding minimum cost to time ratio cycles with small integral transit times (context) - Hartmann, Orlin - 1993
BibTeX entry: (Update)
Ito, K., and Parhi, K. K. Determining the minimum iteration period of an algorithm. J. VLSI Signal Processing 11, 3 (Dec. 1995), 229--44. http://citeseer.ist.psu.edu/ito95determining.html More
@misc{ ito95determining,
author = "K. Ito and K. Parhi",
title = "Determining the minimum iteration period of an algorithm",
text = "Ito, K., and Parhi, K. K. Determining the minimum iteration period of an
algorithm. J. VLSI Signal Processing 11, 3 (Dec. 1995), 229--44.",
year = "1995",
url = "citeseer.ist.psu.edu/ito95determining.html" }
Citations (may not include all citations):206 Rinehart and Winston (context) - Lawler, Optimization et al. - 1976
150 Static Scheduling of Synchronous Data Flow Program for Digit.. (context) - Lee, Messerschmitt - 1987
102 A Characterization of the Minimum Cycle Mean in a Digraph (context) - Karp - 1978
93 Static Rate-Optimal Scheduling of Iterative Data-Flow Progra.. (context) - Parhi, Messerschmitt - 1991
42 Algorithm Transformation Techniques for Concurrent Processor.. (context) - Parhi - 1989
15 A Scheduling Framework for Minimizing Memory Requirements of.. (context) - Bhattacharyya, Buck et al. - 1993
10 A Polynomial-Time Algorithm for the Computation of the Itera.. (context) - Gerez, de Groot et al. - 1992
9 Iteration Bounds of Single-Rate Data Flow Graphs for Concurr.. (context) - Chao, Wang - 1993
7 A Novel Framework for Multi-Rate Scheduling in DSP Applicati.. - Govindarajan, Gao - 1993
5 NJ: Prentice Hall (context) - Reingold, Nievergelt et al. - 1977
5 NJ: Prentice Hall (context) - Kung, Whitehouse et al. - 1985
5 Determining the Iteration Bounds of Single-Rate and Multi-Ra.. - Ito, Parhi - 1994
5 Pipelining of Lattice IIR Digital Filters (context) - Chung, Parhi - 1994
4 The Maximum Sampling Rate of Digital Filters under Speed Con.. (context) - Renfors, Neuvo - 1981
4 A Graph Theoretic Technique for the Generation of Systolic I.. (context) - Schwartz, Barnwell - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ee.umn.edu/groups/ddp/small_pub.html): More
A Low Latency Standard Basis GF(2^M) Multiplier - Jain, Parhi (Correct)
Efficient Power Based Galois Field Arithmetic Architectures - Jain, Parhi (Correct)
Register Minimization In Cost-Optimal Synthesis Of Dsp.. - Kazuhito Ito (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC