FFT BASIC Search Results

FFT BASIC Result Highlights (5)

Part	Manufacturer	Description	Download
10159164-001	Amphenol Communications Solutions	The FCI Basics crimping hand tool is professionally designed for applications in the prototyping phase or small production quantities. The hand tool is designed for Amphenols WireLock® 1.80mm Crimp-to-Wire product. Click on the Product Drawing to see all information related to the product.	PDF
10156148-001	Amphenol Communications Solutions	The FCI Basics crimping hand tool is professionally designed for applications in the prototyping phase or small production quantities. The hand tool is designed for Amphenols Cross-Mate™ Crimp-to-Wire product. Click on the Product Drawing to see all information related to the product.	PDF
10161239-101	Amphenol Communications Solutions	The FCI Basics crimping hand tool is professionally designed for applications in the prototyping phase or small production quantities. The hand tool is designed for Amphenols Minitek Board-In 2.00/2.50mm Crimp-to-Wire product. Click on the Product Drawing to see all information related to the product.	PDF
10161577-001	Amphenol Communications Solutions	The FCI Basics crimping hand tool is professionally designed for applications in the prototyping phase or small production quantities.The hand tool is designed for Amphenols Minitek® 2.00mm Crimp-to-Wire product.Click on the Product Drawing to see all information related to the product.	PDF
10161117-001	Amphenol Communications Solutions	The FCI Basics crimping hand tool is professionally designed for applications in the prototyping phase or small production quantities.The hand tool is designed for Amphenols Minitek Microspace™ Crimp-to-Wire product.Click on the Product Drawing to see all information related to the product.	PDF

FFT BASIC Datasheets Context Search

Catalog Datasheet	Type	Document Tags	PDF
verilog for 8 point fft Abstract: vhdl for 8 point fft xlinx virtex 16 point FFT radix-4 VHDL 64-point mrd 148 system generator fft XCV300 z transform in control theory Contextual Info: 64-Point Complex FFT/IFFT V1.0.3 December 17, 1999 Product Specification R Functional Description Features The vFFT64 fast Fourier transform FFT Core computes a 64-point complex forward FFT or inverse FFT (IFFT). The input data is a vector of 64 complex values represented as	Original	64-Point vFFT64 16-bit 16-bits verilog for 8 point fft vhdl for 8 point fft xlinx virtex 16 point FFT radix-4 VHDL mrd 148 system generator fft XCV300 z transform in control theory	PDF
FFT-256 Abstract: DFT radix FFT256 16 point DFT butterfly graph 64 point radix 4 FFT IMX6 NM6403 W256 Contextual Info: Parallel Execution of FFT Algorithms on NeuroMatrix  Architecture Vitaly Kashkarov, Sergey Mushkaev RC MODULE, Moscow This article studies the possibility of parallel computing applied to FFT. It examines an approach to FFT radix 16 implementation and makes a comparative analysis of the discussing approach with a standard method of FFT	Original	NM6403 40MHz) ru/products/nm/nm6403 FFT-256 DFT radix FFT256 16 point DFT butterfly graph 64 point radix 4 FFT IMX6 W256	PDF
diF fft algorithm VHDL Contextual Info: 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		PDF
vhdl for 8 point fft Abstract: 4 bit microprocessor using vhdl 8 bit microprocessor using vhdl ALL DATA SHEET 8 bit data bus using vhdl circuit diagram of voice recognition Circuit Implementation Using Multiplexers fft algorithm VOICE RECOGNITION ALGORITHM EPF10K100 Contextual Info: 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		PDF
diF fft algorithm VHDL Contextual Info: 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		PDF
c code for convolution Abstract: Spectrum Signal Processing Contextual Info: 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		PDF
W814 Abstract: W820 W830 adsp 21xx fft calculation w849 w842 16 point DIF FFT using radix 4 fft W808 32 point fast Fourier transform using floating point DFT radix Contextual Info: FAST FOURIER TRANSFORMS SECTION 5 FAST FOURIER TRANSFORMS • The Discrete Fourier Transform ■ The Fast Fourier Transform ■ FFT Hardware Implementation and Benchmarks ■ DSP Requirements for Real Time FFT Applications ■ Spectral Leakage and Windowing	Original	ADSP-2100 ADSP-21000 W814 W820 W830 adsp 21xx fft calculation w849 w842 16 point DIF FFT using radix 4 fft W808 32 point fast Fourier transform using floating point DFT radix	PDF
adc matlab code Abstract: AN3292 fft basic Excel vba MAX1121 MAX1122 MAX1123 MAX1206 MAX1207 MAX1208 Contextual Info: 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	MAX1420: MAX1421: MAX1422: MAX1425: MAX1426: MAX1444: MAX1446: MAX1448: MAX1449: AN3292, adc matlab code AN3292 fft basic Excel vba MAX1121 MAX1122 MAX1123 MAX1206 MAX1207 MAX1208	PDF
3B DAV Abstract: DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A Contextual Info: PDSP16515A PDSP16515A Stand Alone FFT Processor Advance Information DS3922 ● ● ● ● ● ● ● Completely self contained FFT Processor Pin and functionally compatible with the PDSP16510A Expanded width internal RAM supports up to 1024 complex points	Original	PDSP16515A DS3922 PDSP16510A 45MHz PDSP16330 PDSP16256 PDSP16350 3B DAV DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A	PDF
xc6slx150t Abstract: STR Y 6763 64 point FFT radix-4 VHDL documentation 16 point FFT radix-4 VHDL documentation verilog code for radix-4 complex fast fourier transform radix-2 DIT FFT vhdl program fft matlab code using 8 point DIT butterfly str 1096 XC6VLX75T vhdl code for simple radix-2 Contextual Info: 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	DS808 xc6slx150t STR Y 6763 64 point FFT radix-4 VHDL documentation 16 point FFT radix-4 VHDL documentation verilog code for radix-4 complex fast fourier transform radix-2 DIT FFT vhdl program fft matlab code using 8 point DIT butterfly str 1096 XC6VLX75T vhdl code for simple radix-2	PDF
3B DAV Abstract: DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A Contextual Info: PDSP16515A PDSP16515A Stand Alone FFT Processor Advance Information DS3922 ● ● ● ● ● ● ● Completely self contained FFT Processor Pin and functionally compatible with the PDSP16510A Expanded width internal RAM supports up to 1024 complex points	Original	PDSP16515A DS3922 PDSP16510A 45MHz PDSP16330 PDSP16256 PDSP16350 3B DAV DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A	PDF
Contextual Info: PDSP16515A PDSP16515A Stand Alone FFT Processor Advance Information DS3922 ● ● ● ● ● ● ● Completely self contained FFT Processor Pin and functionally compatible with the PDSP16510A Expanded width internal RAM supports up to 1024 complex points	Original	PDSP16515A PDSP16515A DS3922 PDSP16510A 45MHz PDSP16330 PDSP16256	PDF
0xFd39 Abstract: 0X1680 0xB480 c8051F120 UART0 sample program C8051F124 C8051F125 C8051F126 C8051F127 0X185 0xb100 Contextual Info: 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	AN142 C8051F12 C8051F124, C8051F125, C8051F126, C8051F127. 0xFd39 0X1680 0xB480 c8051F120 UART0 sample program C8051F124 C8051F125 C8051F126 C8051F127 0X185 0xb100	PDF
NON UNIFORM Quantization Abstract: 8002 AUDIO amplifier harris decimator 8 point fft audio spectrum analyzer Contextual Info: Application Note Introduction to FFT Analysis This application note is an introduction to the basic principles of digital signal processing and gives some insight into how this technology is utilized within the IFR 2309 100 MHz to 2.4 GHz FFT Analyzer Introduction	Original		PDF

TMC2310 Contextual Info: 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	TMC2310 TMC2310 16/19-Bit, 1024-point 2310G5V 2310G5V1 2310H7C 2310L4V 2310L4V1	PDF
str 5653 Abstract: STR - Z 2757 STR M 6545 16 point FFT radix-4 VHDL documentation radix-2 DIT FFT vhdl program STR G 5653 STR F 5653 xc6slx150t RTL 8376 matlab code for radix-4 fft Contextual Info: 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	DS260 str 5653 STR - Z 2757 STR M 6545 16 point FFT radix-4 VHDL documentation radix-2 DIT FFT vhdl program STR G 5653 STR F 5653 xc6slx150t RTL 8376 matlab code for radix-4 fft	PDF
fast fourier transform Abstract: 3B DAV DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A Contextual Info: PDSP16515A PDSP16515A Stand Alone FFT Processor Advance Information DS3922 ● ● ● ● ● ● ● Completely self contained FFT Processor Pin and functionally compatible with the PDSP16510A Expanded width internal RAM supports up to 1024 complex points	Original	PDSP16515A DS3922 PDSP16510A 45MHz PDSP16330 PDSP16256 PDSP16350 fast fourier transform 3B DAV DS3922 PDSP16256 PDSP16330 PDSP16350 PDSP16510A PDSP16515A	PDF
vhdl code for radix-4 fft Abstract: vhdl code for 16 point radix 2 FFT vhdl code for FFT 32 point TMS320C6416 DSP Starter Kit DSK vhdl code for radix 2-2 parallel FFT 16 point verilog code for FFT 32 point verilog code 16 bit processor fft vhdl source code for fft verilog code for 64 point fft Altera fft megacore Contextual Info: FFT Co-Processor Reference Design Application Note 363 October 2004 ver. 1.0 Introduction f The Fast Fourier Transform FFT co-processor reference design demonstrates the use of an Altera FPGA as a high-performance digital signal processing (DSP) co-processor to the Texas Instruments	Original	TMS320C6000 TMS320C6416 TMS320C6416 EP2S60F1020C4 vhdl code for radix-4 fft vhdl code for 16 point radix 2 FFT vhdl code for FFT 32 point TMS320C6416 DSP Starter Kit DSK vhdl code for radix 2-2 parallel FFT 16 point verilog code for FFT 32 point verilog code 16 bit processor fft vhdl source code for fft verilog code for 64 point fft Altera fft megacore	PDF
LPC1300 Abstract: Decoding DTMF tones using M3 DSP library FFT function RDB1768 LPC1768 AN10943 NXP LPC1768 multi tone buzzers VFD-S LPC1700 cortex m3 256-Point Contextual Info: 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	AN10943 LPC1300, LPC1700, LPC1300 Decoding DTMF tones using M3 DSP library FFT function RDB1768 LPC1768 AN10943 NXP LPC1768 multi tone buzzers VFD-S LPC1700 cortex m3 256-Point	PDF
bruel Abstract: bruel kjaer a2150 AT-DSP2200 Contextual Info: Application Note 041 The Fundamentals of FFT-Based Signal Analysis and Measurement in LabVIEW and LabWindows Audrey F. Harvey and Michael Cerna Introduction The Fast Fourier Transform FFT and the power spectrum in LabVIEW and LabWindows® are powerful tools for	Original		PDF
8002 AUDIO amplifier Abstract: HIS 0169 8002 amplifier X band attenuator high power waveguide isolators 60Ghz WG25 60GHz mixer adret Contextual Info: Application Note Using the 2309 FFT Analyzer for mm-wave attenuation measurements by J Howes, A P Gregory National Physical Laboratory, UK This application note describes the benefits of using a 2309 FFT analyzer in a precision attenuation measurement system at millimetric wave frequencies,	Original		PDF
Contextual Info: TMC2310 FFT Processor 16/19-Bit, 20MHz The TMC2310 is an advanced integrated circuit which is capable of executing complex Fast Fourier Transforms FFT , forward or inverse, of up to 1024 points, with or without data windowing. The device operates with either	OCR Scan	TMC2310 16/19-Bt, TMC2310 20MHz, 100ns, 1024-point MIL-STD-883, 20MHz 2310G5V1 TMC2310H7C	PDF
vhdl code for FFT 256 point Abstract: 2 point fft butterfly verilog code fft butterfly verilog code verilog code for twiddle factor radix 2 butterfly verilog code for FFT 32 point vhdl code for 16 point radix 2 FFT vhdl code for FFT 32 point 8 point fft code in vhdl verilog code for 64 point fft dit fft algorithm verilog Contextual Info: CoreFFT Fast Fourier Transform Product Summary Synthesis and Simulation Support Intended Use • Fast Fourier Transform FFT Function for Actel FPGAs • Forward and Inverse 32-, 64-, 128-, 256-, 512-, 1,024-, and 2,048-Point Complex FFT • Decimation–In-Time (DIT) Radix-2 Implementation	Original	048-Point 16-Bit vhdl code for FFT 256 point 2 point fft butterfly verilog code fft butterfly verilog code verilog code for twiddle factor radix 2 butterfly verilog code for FFT 32 point vhdl code for 16 point radix 2 FFT vhdl code for FFT 32 point 8 point fft code in vhdl verilog code for 64 point fft dit fft algorithm verilog	PDF
16 point DFT butterfly graph Abstract: AN4255 128-point radix-2 fft FFT Application note freescale w84k Rev04 MK30X256 DRM121 16 point Fast Fourier Transform radix-2 disadvantages of the energy meter Contextual Info: 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	AN4255 16 point DFT butterfly graph 128-point radix-2 fft FFT Application note freescale w84k Rev04 MK30X256 DRM121 16 point Fast Fourier Transform radix-2 disadvantages of the energy meter	PDF

FFT BASIC Search Results

FFT BASIC Result Highlights (5)

FFT BASIC Datasheets Context Search

verilog for 8 point fft

FFT-256

diF fft algorithm VHDL

vhdl for 8 point fft

diF fft algorithm VHDL

c code for convolution

W814

adc matlab code

3B DAV

xc6slx150t

3B DAV

0xFd39

NON UNIFORM Quantization

TMC2310

str 5653

fast fourier transform

vhdl code for radix-4 fft

LPC1300

bruel

8002 AUDIO amplifier

vhdl code for FFT 256 point

16 point DFT butterfly graph