Skip to search formSkip to main contentSkip to account menu
Synchronous data flow
TLDR
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.
View on IEEE
Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
TLDR
This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors, and a class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single ormultiple processors.
View on IEEE
Simulation of Multipath Impulse Response for Indoor Wireless Optical Channels
TLDR
A recursive method for evaluating the impulse response of an indoor free-space optical channel with Lambertian reflectors, which enables accurate analysis of the effects of multipath dispersion on high-speed indoor optical communication systems.
View via Publisher
Ptolemy: A Framework for Simulating and Prototyping Heterogenous Systems
View via Publisher
Software Ecosystem: Understanding an Indispensable Technology and Industry
TLDR
In Software Ecosystem, Messerschmitt and Szyperski address the overlapping and related perspectives of technologists and nontechnologists.
Manipulation and Compositing of MC-DCT Compressed Video
TLDR
This work proposes algorithms to manipulate compressed video in the compressed domain using the discrete cosine transform with or without motion compensation (MC), and derives a complete set of algorithms for all aforementioned manipulation functions in the transform domain.
View via Publisher
Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding
TLDR
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, and 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.
View via Publisher
Digital communication (2. ed.)
Digital communication (3. ed.)
Parts that add up to a whole : a framework for the analysis of tables
TLDR
This paper shows how dataflow properties can be analyzed at compile-time to make buffering more efficient in a synchronous dataflow (SDF) program.
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License