This series is excerpted from “Digital Signal Processing: Instant Access.” Order this book today and receive an additional 20% discount. Click here www.elsevierdirect.com and be sure to type in 92836.

In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of $n$ elements over a finite field $\mathrm{GF}(p^m)$ with a ...

A key algorithm that quietly empowers and simplifies our electronics is the Fourier transform, which turns the graph of a signal varying in time into a graph that describes it in terms of its ...

Amid the chaos of revolutionary France, one man’s mathematical obsession gave way to a calculation that now underpins much of mathematics and physics. The calculation, called the Fourier transform, ...