![]() ![]() Representation Methods of DSP systems Example: y(n)=a*x(n)+b*x(n-1)+c*x(n-2) Since the capacitance of the multiplier is usually dominant, reduction of the number of multiplications is important (this is possible through strength reduction). ![]() ![]() Latency reduction Techniques => Increase in speed or power reduction through lower supply voltage operation.Achieve Required Speed, Area-Power Tradeoffs.3-Dimensional Optimization (Area, Speed, Power).Y ( n ) = a ⋅ x ( n ) + b ⋅ x ( n − 1) + c ⋅ x ( n − 2 ) end Usually highly real-time, design hardware and/or software to meet the application speed constraint samples in.Representations of DSP Algorithms (Sec.Need to design Families of Architectures for specified algorithm complexity and speed constraints.Applications dictate different speed constraints (e.g., voice, audio, cable modem, settop box, Gigabit ethernet, 3-D Graphics).Non-Terminating Programs Require Real-Time Operations.Parhi, VLSI Digital Signal Processing Systems: Design and Implementation, John Wiley, 1999 ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |