DSPRelated.com

Hidden Linear Algebra in DSP

Sami AldalahmehSami Aldalahmeh June 17, 20105 comments

Linear algebra is hiding in plain sight inside many DSP techniques, not just abstract theory. By treating linear systems as matrix operators y = A x you reveal Toeplitz structure in LTI systems, connect to covariance matrices, and gain geometric intuition via eigenvalues and eigenvectors. This matrix viewpoint complements convolution-based thinking and offers practical tools for filter and channel analysis.


Accelerating Matlab DSP Code on the GPU

Seth Seth March 25, 20102 comments

Seth Benton spent a few days testing Jacket to accelerate MATLAB on NVIDIA GPUs, and found it surprisingly easy to speed up DSP code. He ran 2D FFT and interp2 benchmarks on a MacBook Air with a GeForce 9400M, seeing impressive speedups for large images while hitting GPU memory and precision limits at high sizes. The post shares practical tips on casting to GPU types, minimizing CPU-GPU transfers, and when GPU acceleration is most useful.


Googling: a now-required skill

Seth Seth March 7, 2010

How many times has Google saved you? If you're a dsp programmer, I'll bet A LOT. These days, there are simply so many answers out there (and a bigillion more added daily), that for any given problem, the solution is out there. Or at least information to point you in the right direction.

I won't claim being an expert. There are other blogs for that. But I thought I'd share a few dsp-related insights that have helped me out immensely.

  • It's not all...


OpenCV for DSP/GPU, MSDN equivalent for CCS, and more

Shehrzad Shehrzad February 17, 20108 comments

Porting OpenCV to DSPs could be a real business opportunity, but it is far from trivial, writes Shehrzad Qureshi. He highlights major obstacles: the engineering scale, mixed open-source licenses, and hard-to-parallelize primitives like connected components. He also criticizes Code Composer Studio's help system compared with MSDN, notes an ATI Stream talk, and announces a CUDA walkthrough on FFT-based image filtering.


Computing an FFT of Complex-Valued Data Using a Real-Only FFT Algorithm

Rick LyonsRick Lyons February 9, 20103 comments

Rick Lyons shows a compact trick to get an N-point complex FFT using only real-input FFT routines by transforming the real and imaginary parts separately and recombining their outputs. The post presents a one-line recombination formula, Xc(m) = real[Xr(m)] - imag[Xi(m)] + j{imag[Xr(m)] + real[Xi(m)]}, and an algebraic derivation based on the two-real-in-one-complex FFT identity. Useful for systems that only provide real-only FFTs.


Random GPGPU Musings

Shehrzad Shehrzad January 20, 2010

Shehrzad Qureshi argues that general-purpose GPU computing is poised to reshape engineering workloads, and contrasts Nvidia's CUDA ecosystem with ATI's Stream and OpenCL. He points out that GPU architectures and programming models are similar across vendors, but Nvidia's head start in sample code and developer community gives CUDA a practical advantage. Read for a concise industry perspective on choosing a GPGPU platform.


GPGPU DSP

Shehrzad Shehrzad January 16, 20101 comment

Shehrzad Qureshi kicks off his DSP blog by championing GPGPU, focusing on Nvidia's CUDA and real-product experience. He argues that with CPU clock speeds stalled, large-scale parallelism on GPUs is the practical path forward for many signal-processing tasks. The post traces GPGPU history from shader 'hacks' to modern APIs and previews future posts comparing CUDA vs OpenCL, Intel's Larrabee, and Nvidia Fermi.


Some Thoughts on a German Mathematician

Rick LyonsRick Lyons January 11, 20106 comments

Rick Lyons revisits the remarkable career of Carl Friedrich Gauss, mixing memorable anecdotes with technical highlights. The post links Gauss’s work on the Gaussian curve, complex-plane representation, orbit prediction, and early telegraph experiments to ideas familiar to DSP engineers, and notes historical evidence that he developed trigonometric series before Fourier. It’s a short, engaging reminder of Gauss’s broad influence.


50,000th Member Announced!

Stephane BoucherStephane Boucher January 11, 2010

In my last post, I wrote that DSPRelated.com was about to reach the 50,000 members mark.  Well, I am very happy to announce that it happened during the holidays, and the lucky person is Charlie Tsai from Taiwan.  Charlie is an assistant professor in the Department of Electrical Engineering at the National Central University in Taiwan where he teaches the "Biomedical Signal Processing" class.  He is also the advisor of the


Unit Testing for Embedded Algorithms

Anthony RickeAnthony Ricke December 21, 2009

Unit testing is a best practice for embedded algorithm development, and Anthony Ricke shows how to apply it to DSP code so host and target behave identically. He demonstrates writing unit tests, stubbing Blackfin fixed-point functions in the workstation, and using test-driven development to safely port and optimize an average-calculation example. The SourceForge examples make the approach practical to adopt.


Improved Three Bin Exact Frequency Formula for a Pure Real Tone in a DFT

Cedron DawgCedron Dawg November 6, 2017

Cedron Dawg extends his two-bin exact frequency formulas to a three-bin DFT estimator for a pure real tone, and presents the derivation in computational order for practical use. The method splits complex bin values into real and imaginary parts, forms vectors A, B, and C, applies a sqrt(2) variance rescaling, and computes frequency via a projection-based closed form. Numerical tests compare the new formula to prior work and show improved accuracy when the tone lies between bins.


TI DSP Predictions

Jeff BrowerJeff Brower September 19, 20075 comments

Jeff Brower lays out two bold predictions for Texas Instruments that could reshape the DSP developer ecosystem. He argues TI will offer a supported real-time Linux on their C6x DSPs now that legal obstacles have eased, and that TI may acquire an FPGA company to own the board space around its chips. Read to weigh the technical and strategic impact.


Update to a Narrow Bandpass Filter in Octave or Matlab

Paul LovellPaul Lovell March 29, 2021

Paul Lovell presents an updated, compact Octave/Matlab implementation of a narrow bandpass FIR that runs about four times faster and uses float32 to cut processing cost. The design combines a single matrix IFIR stage with three moving-sum (RRS) stages per baseband, auto-calculates the IFIR expansion factor, and adds easier parameter setup plus WAV I/O and FFT plots. A TensorFlow Colab demo is also provided.


Project update-2 : Digital Filter Blocks in MyHDL and their integration in pyFDA

Sriyash CaculoSriyash Caculo July 9, 2018

This update shows a working integration between Pyfda and MyHDL using a compact API that passes fixed-point coefficients, stimulus data, and returns simulated filter responses. It walks through two usage styles, constructor-based and setter-method-based, and demonstrates a Pyfda workflow from specs to MyHDL simulation and plotting. Future plans include HDL code generation and API extension as filters grow.


Exact Near Instantaneous Frequency Formulas Best at Peaks (Part 2)

Cedron DawgCedron Dawg June 11, 20174 comments

Cedron Dawg derives a second family of exact time domain formulas for single-tone frequency estimation that trade a few extra calculations for improved noise robustness. Built from [1+cos]^k binomial weighting of neighbor-pair sums, the closed-form estimators are exact and are best evaluated at signal peaks for real tones, while complex tones do not share the zero-crossing limitation. Coefficients up to k=9 are provided.


Engineering the Statistics

Sami AldalahmehSami Aldalahmeh March 26, 20122 comments

Do you remember the probability course you took in undergrad? If you were like me, you would consider it one of those courses that you get out of confused. But maybe a time will come where you regret skipping class because of the lecturer's persisting attempts to scare you with mathematical involved nomenclature.As you might have guessed, I had this moment few months back where I had to go deep into statistical analysis. I learned things the hard way, or maybe it is the right way. I mean...


Why is Fourier transform broken

Sami AldalahmehSami Aldalahmeh October 4, 20112 comments

Many engineers know the Gibbs phenomenon without grasping its root cause. This post shows that the problem comes from using the incomplete metric space of continuous functions, C[a,b], for Fourier series, and explains how switching to Lp spaces resolves convergence in the mean but allows functions to differ on sets of measure zero. It also reminds readers that Fourier analysis gives no time localization, so be mindful of its limits.


Of Forests and Trees and DSP

Tim WescottTim Wescott February 10, 20082 comments

Too often DSP engineers fixate on algorithms and miss the rest of the product. Tim Wescott uses the humble Korg CA-20 chromatic tuner to show that a great algorithm alone does not make a usable device, you also need good data acquisition, adequate processing, sensible precision, a usable UI, and appropriate casing and cost. The post gives practical do's and don'ts for system-level DSP design.


Digging into an Audio Signal and the DSP Process Pipeline

Stephen MorrisStephen Morris March 9, 20206 comments
In this post, I'll look at the benefits of using multiple perspectives when handling signals.A Pre-existing Audio File

Let's say we have an audio file of interest. Let's load it into Audacity and zoom in a little (using View → Zoom → Zoom In, multiple times). The figure illustrates the audio signal: just a basic single-tone signal.

By continuing to zoom into the signal, we eventually get to the point of seeing individual samples as illustrated below. Notice that I've marked one...


DSP Papers, Articles, Theses, etc

Stephane BoucherStephane Boucher March 17, 20111 comment

Stephane Boucher invites the DSP community to help expand DSPRelated's Papers and Theses repository, which currently lists just over 100 documents. He asks contributors to find and submit recent DSP PDFs, ideally from the last ten years, and notes that each approved submission enters the submitter into a draw for Michael Parker's Digital Signal Processing 101; the draw is planned for early April.