EDN

How to build ultra-fast floating-point FFTs in FPGAs

Engineers targeting DSP to FPGAs have traditionally used fixed-point arithmetic, mainly because of the high cost associated with implementing floating-point arithmetic. That cost comes in the form of ...
New Electronics

Compression breakthrough ‘faster than FFT’ claim MIT researchers

Researchers from MIT have developed a new algorithm designed to improve on the fast Fourier transform (FFT) in a large number of cases. The discovery paves the way for smartphones to wirelessly ...
Design-Reuse

Array Processors Enable Flexibility in FFT Designs

Although it has found many uses in signal processing, the Fast Fourier Transform (FFT) has taken on even more importance as a fundamental part of the algorithms used for communications protocols based ...
Design-Reuse

FPGAs: Embedded Apps : FPGA-based FFT engine handles four times more input data

Rodger Hosking, Vice President, Richard Kuenzler, Engineer, Pentek Inc., Upper Saddle River, N.J. For years, field-programmable gate array (FPGA) technology has been a major cornerstone of board-level ...
EDN

Spectral analysis and modulation, part 1: The DFT and FFT

This series is excerpted from “Digital Signal Processingand Applications, 2nd Edition.” Order this book today at www.newnespress.comor by calling 1-800-545-2522 and receive a 20% discount! Use ...
technologynetworks

Algorithm Innovation Solves 50-year Puzzle in Signal Processing

professor of electrical and computer engineering at Iowa State University - says the FFT algorithm and its inverse (known as the IFFT) are at the ...
Science Daily

Engineers solve 50-year-old puzzle in signal processing

Engineers have solved a 50-year-old puzzle in signal processing. They've formulated the 'inverse chirp z-transform,' an algorithm related to one that's running on your cell phone right now. It took ...