Abstract
This chapter discusses various representations of DSP algorithms. We study how mathematical equations describing the algorithm functionality are translated into compact graphical models. These models enable efficient implementation of the algorithm in hardware while also enabling architectural transformations through matrix manipulations. Common examples of graphical representations are flow graphs and block diagrams.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, John Wiley & Sons Inc., 1999.
Nanda R (2008) DSP Architecture Optimization in Matlab/Simulink Environment. M.S, Thesis, University of California, Los Angeles
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this chapter
Cite this chapter
Marković, D., Brodersen, R.W., Nanda, R. (2012). Data-Flow Graph Model. In: DSP Architecture Design Essentials. Electrical Engineering Essentials. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9660-2_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9660-2_9
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-9659-6
Online ISBN: 978-1-4419-9660-2
eBook Packages: EngineeringEngineering (R0)