FFT COD Search Results
FFT COD Result Highlights (4)
| Part | ECAD Model | Manufacturer | Description | Download | Buy |
|---|---|---|---|---|---|
| TMS320C5535AZAY05 | Texas Instruments | Low power C55x fixed point DSP- up to 100MHz, USB, LCD interface, FFT HWA, SAR ADC 144-NFBGA -10 to 70 |
|
||
| TMS320C5535AZAY10 | Texas Instruments | Low power C55x fixed point DSP- up to 100MHz, USB, LCD interface, FFT HWA, SAR ADC 144-NFBGA -10 to 70 |
|
||
| TMS320C5535AZAYA05 | Texas Instruments | Low power C55x fixed point DSP- up to 100MHz, USB, LCD interface, FFT HWA, SAR ADC 144-NFBGA -40 to 85 |
|
||
| TMS320C5535AZAYA10 | Texas Instruments | Low power C55x fixed point DSP- up to 100MHz, USB, LCD interface, FFT HWA, SAR ADC 144-NFBGA -40 to 85 |
|
Documents mentioning FFT COD
| Document | Partial File Text | Tags | Type | |||
|---|---|---|---|---|---|---|
| an542 | Implementing FFT AN542 Implementation of Fast Fourier Transforms The FFT is implemented with Decimation In Frequency. Thus the input data before calling the FFT routine ("R2FFT") should be in normal order and the transformed data is in scrambled order. The original data is |
Original | ||||
| l64281 | LSI LOGIC L64281 FFT Video Shift Register (FFTSR) General Description The L64281 is a high-speed FFT (Fast Fourier Transform) video shift register. It is used to per form data formatting in real-time FFT systems using the L64280 FFTP (Fast Fourier Transform |
OCR Scan | ||||
| ug-fft-11 | FFT MegaCore Function User Guide FFT MegaCore Function User Guide 101 Innovation Drive San Jose, CA 95134 www.altera.com UG-FFT-11.1 Subscribe © 2011 Altera Corporation. All rights reserved. ALTERA, ARRIA, CYCLONE, HARDCOPY, MAX, MEGACORE, NIOS, QUARTUS and STRATIX words and logos |
Original | ||||
| FFT MegaCore Function March 2001 User Guide | FFT MegaCore Function March 2001 User Guide Version 1.02 101 Innovation Drive San Jose, CA 95134 (408) 544-7000 http://www.altera.com A-UG-FFT-1.02 FFT MegaCore Function User Guide Altera, ACEX, APEX, APEX 20K, FLEX, FLEX 10KE, MAX+PLUS II, MegaCore, MegaWizard, OpenCore, and Quartus are |
Original | ||||
| CHAPTER FFT Convolution 18 This chapter presents | CHAPTER FFT Convolution 18 This chapter presents two important DSP techniques, the overlap-add method, and FFT convolution. The overlap-add method is used to break long signals into smaller segments for easier processing. FFT convolution uses the overlap-add method together with the Fast Fourier |
Original | ||||
| cs2461 | CS2461 TM 64-Point Block Based FFT/IFFT Virtual Components for the Converging World The CS2461 is an online programmable, block-based architecture 64-point FFT/IFFT core. This highly integrated application specific core computes the FFT/IFFT based on radix-4 algorithm in three computation passes. The |
Original | ||||
| cs2460 | CS2460 TM 64-Point Pipelined FFT/IFFT Virtual Components for the Converging World The CS2460 is an online programmable, pipelined architecture 64-Point FFT/IFFT core. This highly integrated application specific core computes the FFT/IFFT based on a radix-4 decimation in frequency (DIF) algorithm. It |
Original | ||||
| l64280 | LSI LOGIC L64280 Complex FFT Processor (FFTP) Description The L64280 FFTP (Fast Fourier Transform Processor) is a floating-point complex FFT pro cessor and is designed for primary use with the L64281 FFTSR (Fast Fourier Transform Video Shift Register) in real-time FFT systems. It can |
OCR Scan | ||||
| CS2420 TM 2048/4096/8192 Point FFT/IFFT Virtual | CS2420 TM 2048/4096/8192 Point FFT/IFFT Virtual Components for the Converging World The CS2420 is an online programmable 2048 - 8192-point FFT/IFFT core. It is based on the radix-4 algorithm and performs 2048-point to 8192-point FFT/IFFT computation in three computation passes. A block diagram of the |
Original | ||||
| radix-2 | One-Dimensional FFTs 6 6.4 OPTIMIZED RADIX-2 DIT FFT Because the FFT is often just the first step in the processing of a signal, the execution speed is important. The faster the FFT executes, the more time the processor can devote to the remainder of the signal processing task. |
Original | ||||
| cs2411 | CS2411 1024 Point Block Based FFT/IFFT Preliminary Datasheet TM Virtual Components for the Converging World The CS2411 is an online programmable, block-based architecture 1024-point FFT/IFFT core. It is based on a radix4 / radix-16 algorithm that performs FFT/IFFT computation in four computation passes. This highly integrated |
Original | ||||
| ifft | CS2410 TM 8-1024 Point FFT/IFFT Virtual Components for the Converging World The CS2410 is an online programmable 8 - 1024-point FFT/IFFT core. It is based on the radix-4 algorithm and performs 8-point to 1024-point FFT/IFFT computation in multiple computation passes. A block diagram of the |
Original | ||||
| an10943 | AN10943 Decoding DTMF tones using M3 DSP library FFT function Rev. 1 — 17 June 2010 Application note Document information Info Content Keywords M3, LPC1300, LPC1700, DSP, DFT, FFT, DTMF Abstract This application note and associated source code example demonstrates |
Original | ||||
| Maxim > App Notes > A/D and D/A | Maxim > App Notes > A/D and D/A CONVERSION/SAMPLING CIRCUITS BASESTATIONS / WIRELESS INFRASTRUCTURE HIGH-SPEED SIGNAL PROCESSING Keywords: fast fourier transform, FFT, analog-to-digital converter, ADC, coherent sampling, SNR, THD, SINAD, SFDR, single-tone FFT |
Original | ||||
|
|
||||||
| FFT MegaCore Function Release Notes October 2005, | FFT MegaCore Function Release Notes October 2005, MegaCore Version 2.2.0 These release notes for the FFT MegaCore® function version 2.2.0 contain the following information: ■ System Requirements System Requirements New Features & Enhancements |
Original | ||||
| LogiCORE IP Fast Fourier Transform v8.0 DS808 | LogiCORE IP Fast Fourier Transform v8.0 DS808 July 25, 2012 Product Specification Introduction LogiCORE IP Facts The Xilinx LogiCORE™ IP Fast Fourier Transform (FFT) implements the Cooley-Tukey FFT algorithm, a computationally efficient method for calculating the |
Original | ||||
| an142 | AN142 FFT R O U T I N E S F O R T H E C8051F12 X F A M I L Y Relevant Devices This application note applies to the following devices: C8051F124, C8051F125, C8051F126, and C8051F127. multiplications, while the corresponding FFT requires only 192. Using this and other optimizations, an FFT can be calculated in a relatively short |
Original | ||||
| mc92307 | Freescale Semiconductor, Inc. Current information @www.mot.com.sps/ADC MOTOROLA SEMICONDUCTOR TECHNICAL DATA MC92307 Advance Information 2K - Samples FFT-Processor RESB SYMSYNC CLK DOUT[11:0] The MC92307 is a pipelined Fast Fourier Transformation (FFT) processor with a |
Original | ||||
| Am29540 Am29540 Programmable FFT Address | Am29540 Am29540 Programmable FFT Address Sequencer DISTINCTIVE CHARACTERISTICS • Decimation in frequency (DIF) o r decim ation in time (DIT) FFT algorithm s supported 40-pin DIP package, 5 vo lt single supply Generates data and coefficient addresses |
OCR Scan | ||||
| tmc2310 | TMC2310 TMC2310 FFT Processor 16/19-Bit, 20 MHz Description Features The TMC2310 is an advanced integrated circuit which can execute complex Fast Fourier Transforms (FFT), ♦ Stand alone execution of forward or inverse complex Fast Fourier Transforms, adaptive and |
OCR Scan | ||||
| am29540 | Am29540 Am29540 Programmable FFT Address Sequencer DISTINCTIVE CHARACTERISTICS • Decimation in frequency (DIF) or decimation in time (DIT) FFT algorithms supported 40-pin DIP package, 5 volt single supply Generates data and coefficient addresses |
OCR Scan | ||||
| spra554a | Application Report SPRA554A Implementation of the Double-Precision Complex FFT for the TMS320C54x DSP Mike Hannah Aaron Kofi Aboagye TI MSDS Emerging Markets and Technologies Group TI C5000 DSP Software Applications Group Abstract A double-precision complex fast Fourier transform (FFT) C-callable code library has been |
Original | ||||