Sign in
Search blogs
Articles by category
Our Bloggers
See Also
Tips and Tricks - DSP Blog
Would you like to be notified by email when a new blog entry gets published on DSPRelated.com?
RSS Feed | 
Hidden Linear Algebra in DSP
Linear algebra (LA) is usually thought of as a blunt theoretical subject. However, LA is found hidden in many DSP algorithms used widely in practice. An obvious clue in finding LA in DSP is the linea...
posted by Sami Al Dalahmah on Jun 17 2010 under Basics | Academia / Research | Tips and Tricks Comments (4) |
A Stable Goertzel Algorithm
This blog presents a guaranteed-stable Goertzel algorithm. To appreciate what the phrase "guaranteed-stable" means, let's review a few characteristics of the traditional Goertzel algorithm. Goertze... 
posted by Rick Lyons on Jun 7 2010 under Tips and Tricks Comments (2) |
Computing an FFT of Complex-Valued Data Using a Real-Only FFT Algorithm
Someone recently asked me if I knew of a way to compute a fast Fourier transform (FFT) of complex-valued input samples using an FFT algorithm that accepts only real-valued input data. Knowing of no ...
posted by Rick Lyons on Feb 9 2010 under Tips and Tricks Comments (3) |
Unit Testing for Embedded Algorithms
Happy Holidays! For my premier article, I am writing about my favorite technique to use when designing and developing software- unit testing. Unit testing is a best practice when designing software... 
posted by Anthony Ricke on Dec 20 2009 under Basics | Tips and Tricks Comments (0) |
Using Mason's Rule to Analyze DSP Networks
There have been times when I wanted to determine the z-domain transfer function of some discrete network, but my algebra skills failed me. Some time ago I learned Mason's Rule, which helped me sol...
posted by Rick Lyons on Aug 31 2009 under Tips and Tricks Comments (3) |
The Nature of Circles
What do you mean? When calculating the mean of a list of numbers, the obvious approach is to sum them and divide by how many there are. Suppose I give you a list of two numbers: 0 359 What i... 
posted by Peter Kootsookos on Feb 21 2009 under Academia / Research | Tips and Tricks Comments (3) |
Simultaneously Computing a Forward FFT and an Inverse FFT Using a Single FFT
Most of us are familiar with the processes of using a single N-point complex FFT to: (1) perform a 2N-point FFT on real data, and (2) perform two independent N-point FFTs on real data [1–5]. I...
posted by Rick Lyons on Jan 13 2009 under Tips and Tricks Comments (5) |
Multiplierless Exponential Averaging
This blog discusses an interesting approach to exponential averaging. To begin my story, a traditional exponential averager (also called a "leaky integrator"), shown in Figure 1(a), is commonly used...
posted by Rick Lyons on Dec 5 2008 under Tips and Tricks Comments (2) |
Computing the Group Delay of a Filter
I just learned a new method (new to me at least) for computing the group delay of digital filters. In the event this process turns out to be interesting to my readers, this blog describes the method...
posted by Rick Lyons on Nov 19 2008 under Tips and Tricks Comments (7) |
Computing Large DFTs Using Small FFTs
It is possible to compute N-point discrete Fourier transforms (DFTs) using radix-2 fast Fourier transforms (FFTs) whose sizes are less than N. For example, let's say the largest size FFT software ro...
posted by Rick Lyons on Jun 23 2008 under Tips and Tricks Comments (12) |