Leaner Fourier transforms
New algorithm can separate signals into their individual frequencies using a minimal number of samples.
Explained: Matrices
Concepts familiar from grade-school algebra have broad ramifications in computer science.
Toward practical compressed sensing
Researchers show how the vagaries of real-world circuitry affect the performance of a promising new technique in signal processing and imaging.
The faster-than-fast Fourier transform
For a large range of practically useful cases, MIT researchers find a way to increase the speed of one of the most important algorithms in the information sciences.
Unraveling the Matrix
A new way of analyzing grids of numbers known as matrices could improve signal-processing applications and data-compression schemes.
Explained: The Discrete Fourier Transform
The theories of an early-19th-century French mathematician have emerged from obscurity to become part of the basic language of engineering.