Journal ArticleDOI
Analysis of linear digital networks
R.E. Crochiere,Alan V. Oppenheim +1 more
- Vol. 63, Iss: 4, pp 581-595
Reads0
Chats0
TLDR
A framework is presented for the analysis, representation, and evaluation of digital filter structures Based on the notation of linear signal-flow graphs and their equivalent matrix representation, a set of general linear digital network properties are reviewed, including precedence relations computability, Tellegen's theorem, interreciprocity, and network transposition.Abstract:
A framework is presented for the analysis, representation, and evaluation of digital filter structures. Based on the notation of linear signal-flow graphs and their equivalent matrix representation, a set of general linear digital network properties are reviewed, including precedence relations computability, Tellegen's theorem, interreciprocity, and network transposition. These properties are then utilized in developing time and frequency domain analysis techniques and sensitivity analysis techniques. These techniques, in turn, are applied to the comparison of several basic digital filter structures.read more
Citations
More filters
Journal ArticleDOI
Synchronous data flow
TL;DR: A preliminary SDF software system for automatically generating assembly language code for DSP microcomputers is described, and two new efficiency techniques are introduced, static buffering and an extension to SDF to efficiently implement conditionals.
Journal ArticleDOI
Wave digital filters: Theory and practice
TL;DR: Wave digital filters (WDFs) as discussed by the authors are modeled after classical filters, preferably in lattice or ladder configurations or generalizations thereof, and have very good properties concerning coefficient accuracy requirements, dynamic range, and especially all aspects of stability under finite-arithmetic conditions.
Journal ArticleDOI
Interpolation and decimation of digital signals—A tutorial review
R. Crochiere,Lawrence R. Rabiner +1 more
TL;DR: This paper presents a tutorial overview of multirate digital signal processing as applied to systems for decimation and interpolation and discusses a theoretical model for such systems (based on the sampling theorem), and shows how various structures can be derived to provide efficient implementations of these systems.
Proceedings ArticleDOI
A fast Fourier transform compiler
TL;DR: The internals of this special-purpose compiler, called genfft, are described in some detail, and it is argued that a specialized compiler is a valuable tool.
Journal ArticleDOI
Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding
Abstract: Rate-optimal compile-time multiprocessor scheduling of iterative dataflow programs suitable for real-time signal processing applications is discussed. It is shown that recursions or loops in the programs lead to an inherent lower bound on the achievable iteration period, referred to as the iteration bound. A multiprocessor schedule is rate-optimal if the iteration period equals the iteration bound. Systematic unfolding of iterative dataflow programs is proposed, and properties of unfolded dataflow programs are studied. Unfolding increases the number of tasks in a program, unravels the hidden concurrently in iterative dataflow programs, and can reduce the iteration period. A special class of iterative dataflow programs, referred to as perfect-rate programs, is introduced. Each loop in these programs has a single register. Perfect-rate programs can always be scheduled rate optimally (requiring no retiming or unfolding transformation). It is also shown that unfolding any program by an optimum unfolding factor transforms any arbitrary program to an equivalent perfect-rate program, which can then be scheduled rate optimally. This optimum unfolding factor for any arbitrary program is the least common multiple of the number of registers (or delays) in all loops and is independent of the node execution times. An upper bound on the number of processors for rate-optimal scheduling is given. >
References
More filters
Book
Synthesis of feedback systems
TL;DR: Synthesis of feedback systems, Synthesis of Feedback Systems, this article, synthesis of feedback system, feedback system synthesis, feedback synthesis, synthesizing feedback systems, مرکز فناوری اطلاعات و اسلاز رسانی
Journal ArticleDOI
Feedback Theory-Some Properties of Signal Flow Graphs
TL;DR: A study of the topological properties of such graphs leads to techniques which have proven useful, both for the discussion of the general theory of feedback and for the solution of practical analysis problems.
Journal ArticleDOI
Feedback Theory-Further Properties of Signal Flow Graphs
TL;DR: A way to enhance writing gain at a glance as discussed by the authors is to use the phrase "pray not frustrative" as a way to describe the goal of a sentence in a paragraph.
Journal ArticleDOI
The Generalized Adjoint Network and Network Sensitivities
TL;DR: In this paper, the authors derived a related adjoint network representation and sensitivity coefficients for networks containing a very broad class of elements: those that admit a parametric representation, and a brief discussion is given as to how these results may be exploited in a general automated network design scheme.
Related Papers (5)
The maximum sampling rate of digital filters under hardware speed constraints
Markku Renfors,Yrjö Neuvo +1 more