FFT ALGORITHM VER Search Results
FFT ALGORITHM VER Equivalents
Sorry, but there were no results for that search. Please update your search settings or try another search term.
FFT ALGORITHM VER Result Highlights (5)
| Part | ECAD Model | Manufacturer | Description | Download | Buy |
|---|---|---|---|---|---|
| 89891-802HLF | Amphenol Communications Solutions | REC VER THT 4pos | |||
| 89891-815HLF | Amphenol Communications Solutions | REC VER THT 30pos | |||
| 89891-825HLF | Amphenol Communications Solutions | REC VER THT 50pos | |||
| 89891-836HLF | Amphenol Communications Solutions | REC VER THT 72pos | |||
| 89891-846HLF | Amphenol Communications Solutions | REC VER THT 92pos |
Documents mentioning FFT ALGORITHM VER
| Document | Partial File Text | Tags | Type | |||
|---|---|---|---|---|---|---|
| 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 | ||||
| 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 | ||||
| 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 | ||||
| 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 | ||||
| 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 | ||||
| Fast Fourier Transform v7.0 DS260 June 24, 2009 | Fast Fourier Transform v7.0 DS260 June 24, 2009 Product Specification Introduction Overview The Xilinx® LogiCORE™ IP Fast Fourier Transform (FFT) implements the Cooley-Tukey FFT algorithm, a computationally efficient method for calculating the Discrete Fourier Transform (DFT). |
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 | ||||
| an1381 | AN1381 APPLICATION NOTE Implementing the Radix-4 FFT Algorithm Using the ST120 DSP By Marianne DELPHIN INTRODUCTION This application note for the ’Radix-4’ implementation of the Fast Fourier Transform algorithm on the ST120 DSP shows how this algorithm well exploits the high parallelism of the ’ST100’ superscalar |
Original | ||||
| an4255 | Freescale Semiconductor Application Note Document Number: AN4255 Rev. 0, 11/2011 FFT-Based Algorithm for Metering Applications by: Luděk Šlosarčík Rožnov Czech System Center Czech Republic The Fast Fourier Transform (FFT) is a mathematical technique for transforming a time-domain digital signal |
Original | ||||
| 1024-point | High-Performance 64-,256-,1024-point Complex FFT/IFFT V1.1 Nov 1, 2002 Product Specification Theory of Operation The fast Fourier transform (FFT) is a computationally efficient algorithm for computing a discrete Fourier transform (DFT). The DFT X ( k ), k = 0,… , N − 1 of a sequence |
Original | ||||
| ap1634 | Microcontrollers ApNote AP1634 þ additional file AP163402.EXE available Fast - Fourier - Transformation The Fast Fourier Transformation (FFT) is an algorithm frequently used in various applications, like telecommunication, signal and image processing. It transforms the |
Original | ||||
| radix-4 | Implementing the Radix-4 Decimation in Frequency (DIF) Fast Fourier Transform (FFT) Algorithm Using a TMS320C80 DSP APPLICATION REPORT: SPRA152 Author: Charles Wu SC Sales & Marketing – TI Taiwan Digital Signal Processing Solutions January 1998 IMPORTANT NOTICE |
Original | ||||
| siemens c166 | SIEMENS C166 Family ApNotes Software Example #4 Fast-FourierTransformation Fast-Fourier-Transformation The Fast Fourier Transformation (FFT) is an algorithm frequently used in various applications, like telecommunication, signal and image processing. It transforms the time domain into the frequency |
Original | ||||
| avr327 | AVR32718: AT32UC3 Series Software Framework DSPLib 32-bit 1. Introduction This application note describes the DSP Library from the AVR32® Software Framework. It details the main functions (prototype, algorithm and benchmark) of the DSP library: FFT, convolution, FIR and partial IIR using GCC compiler. |
Original | ||||
|
|
||||||
| ap-275 | AP-275 APPLICATION NOTE An FFT Algorithm For MCS -96 Products Including Supporting Routines and Examples IRA HORDEN ECO APPLICATIONS ENGINEER October 1988 Order Number 270189-002 Information in this document is provided in connection with Intel products Intel assumes no liability whatsoever including infringement of any patent or copyright for sale and use of Intel products except as provided in |
Original | ||||
| ap-808 | AP-808 Split-Radix Fast Fourier Transform Using Streaming SIMD Extensions Split-Radix Fast Fourier Transform Using Streaming SIMD Extensions Version 2.1 01/99 Order Number: 243642-002 02/04/99 AP-808 Split-Radix Fast Fourier Transform Using Streaming SIMD Extensions |
Original | ||||
| fft algorithm | Implementing FFT Algorithms on PSoC® System AN42877 Authors: Nicola Sgambelluri, Gaetano Valenza Associated Project: No Associated Part Family: CY8C29x66 Software Version: PSoC Designer 4.2+SP3 Associated Application Notes: None Application Note Abstract |
Original | ||||
| Accelerating Nios II Systems with the C2H | Accelerating Nios II Systems with the C2H Compiler Tutorial August 2008, Version 8.0 Tutorial Introduction The Nios® II C2H Compiler is a powerful tool that generates hardware accelerators for software functions. The C2H Compiler enhances design productivity by allowing you to use a compiler to accelerate software algorithms |
Original | ||||
| crest factor reduction | Crest Factor Reduction for OFDMA Systems Application Note 475 November 2007, ver. 1.0 Introduction Crest factor reduction (CFR) is a technique for reducing the peak-toaverage ratio (PAR) of an orthogonal frequency division multiplexing (OFDM) waveform. An OFDM signal is made up in the frequency |
Original | ||||
| Two-Dimensional FFTs 7 7 7.1 TWO-DIMENSIONAL FFTS | Two-Dimensional FFTs 7 7 7.1 TWO-DIMENSIONAL FFTS The two-dimensional discrete Fourier transform (2D DFT) is the discretetime equivalent of the two-dimensional continuous-time Fourier transform. Operating on x(n1,n2), a sampled version of a continuous-time |
Original | ||||
| ® fft Fast Fourier Transform October 1997, ver. 3 | ® fft Fast Fourier Transform October 1997, ver. 3 Data Sheet Features ■ General Description The fft MegaCore function implements a fast Fourier transform (FFT), which is used to separate a signal into its constituent frequencies. This |
Original | ||||
| ® fft Fast Fourier Transform April 1997, ver. 2 | ® fft Fast Fourier Transform April 1997, ver. 2 Data Sheet Features ■ General Description The fft MegaCore function implements a fast Fourier transform (FFT), which is used to separate a signal into its constituent frequencies. This |
Original | ||||
| ® fft Fast Fourier Transform February 1997, ver. | ® fft Fast Fourier Transform February 1997, ver. 1 Data Sheet Features ■ General Description The fft MegaCore function implements a fast Fourier transform (FFT), which is used to separate a signal into its constituent frequencies. This |
Original | ||||
| White Paper Automating DSP Simulation and | White Paper Automating DSP Simulation and Implementation of Military Sensor Systems Military sensor-driven systems normally use FPGAs to interface with the ADCs that digitize sensor inputs. Because ADCs operate at rates of up to 3 MSPS, they require very high-performance DSP circuitry. In most cases, this |
Original | ||||
| fourier transform | Fast Fourier Transform MegaCore Function Solution Brief 12 January 1997, ver. 1 Target Application: Features Digital Signal Processing Wireless Communications ■ Family: FLEX 10K ■ Vendor: ® 2610 Orchard Parkway San Jose, CA 95134-2020 Tel. (408) 894-7000 |
Original | ||||