DFT 16 POINT Search Results
DFT 16 POINT Result Highlights (5)
| Part | ECAD Model | Manufacturer | Description | Download | Buy |
|---|---|---|---|---|---|
| TCR3DF18 | Toshiba Electronic Devices & Storage Corporation | LDO Regulator, Fixed Output, 1.8 V, 300 mA, SOT-25 (SMV) | Datasheet | ||
| TCR3RM28A | Toshiba Electronic Devices & Storage Corporation | LDO Regulator, Fixed Output, 2.8 V, 300 mA, DFN4C/DFN4F | Datasheet | ||
| TCR2LF18 | Toshiba Electronic Devices & Storage Corporation | LDO Regulator, Fixed Output, 1.8 V, 200 mA, SOT-25 (SMV) | Datasheet | ||
| TCR5BM12A | Toshiba Electronic Devices & Storage Corporation | LDO Regulator, Fixed Output, 1.2 V, 500 mA, DFN5B | Datasheet | ||
| TCR8BM12A | Toshiba Electronic Devices & Storage Corporation | LDO Regulator, Fixed Output, 1.2 V, 800 mA, DFN5B | Datasheet |
Documents mentioning DFT 16 POINT
| Document | Partial File Text | Tags | Type | |||
|---|---|---|---|---|---|---|
| tc514260d | TOSHIBA MOS DIGITAL INTEGRATED CIRCUIT TC514260D J/DFT-60/70 PRELIMINARY 262,144 WORD X 16 BIT DYNAMIC RAM Description The TC514260DJ/DFT is the new generation dynamic RAM organized 262,144 word by 16 bit. The TC514260DJ/DFT utilizes Toshiba’s CMOS silicon gate process technology as well as advanced circuit techniques to provide wide operating margins, both |
OCR Scan | ||||
| tc514265dj | TOSHIBA TC514265DJ/DFT-50/60/70 PRELIMINARY 262,144 WORD X 16 BIT EDO (HYPER PAGE) DYNAMIC RAM Description TheTC514265DJ/DFT is an EDO (hyper page) dynamic RAM organized as 262,144 words by 16 bits. TheTC514265DJ/ DFT utilizes Toshiba's CMOS silicon gate process technology as well as advanced circuit techniques to provide wide oper |
OCR Scan | ||||
| DFT Cores (Real Data In, Complex Data Out) | DFT Cores (Real Data In, Complex Data Out) September 10, 1997 Product Specification – PRELIMINARY General Description R The 16-bit Discrete Fourier Transform (DFT) Cores are functionally complete elements. The designs present a simplified interface and require no external memory. The |
Original | ||||
| tc514260dj | TOSHIBA TC514260DJ/DFT60/70 P R E LIM IN A R Y 262,144 WORD X 16 BIT DYNAMIC RAM D escription The TC514260DJ/DFT is the new generation dynamic RAM organized 262,144 word by 16 bit. The TC514260DJ/DFT uti lizes Toshiba's CMOS silicon gate process technology as well as advanced circuit techniques to provide wide operating |
OCR Scan | ||||
| AB35 AB35 Implementing Large and Non-Standard | AB35 AB35 Implementing Large and Non-Standard Transforms Application Brief AB35 - 1.0 February 1994 BACKGROUND The PDSP16510 is a stand-alone FFT Processor which performs 16, 64, 256, or 1024 point FFT's with input sampling rates of up to 40MHz - typically an order of magnitude faster than programmable DSP parts. A single device can window and transform |
Original | ||||
| 16-point | High-Performance 16-Point Complex FFT/IFFT V1.0.3 Dec17 1999 Product Specification Xilinx, Inc. 2100 Logic Drive San Jose, CA 95124 Phone: +1 408-559-7778 FAX: +1 408-559-7114 Email: coregen@xilinx.com URL: http://www.xilinx.com/ipcenter 1 Features • |
Original | ||||
| 16-point | High-Performance 16-Point Complex FFT/IFFT V2.0 July 5 2000 Product Specification Xilinx, Inc. 2100 Logic Drive San Jose, CA 95124 Phone: +1 408-559-7778 FAX: +1 408-559-7114 Email: coregen@xilinx.com URL: http://www.xilinx.com/ipcenter 1 Features • |
Original | ||||
| pdsp16510 | AB35 AB35 Implementing Large and Non-Standard Transforms Application Brief AB35 - 1.0 February 1994 BACKGROUND The PDSP16510 is a stand-alone FFT Processor which performs 16, 64, 256, or 1024 point FFT's with input sampling rates of up to 40MHz - typically an order of magnitude faster than programmable DSP parts. A single device can window and transform |
Original | ||||
| 16-point | High-Performance 16-Point Complex FFT/IFFT V1.0.5 July 5 2000 Product Specification Xilinx, Inc. 2100 Logic Drive San Jose, CA 95124 Phone: +1 408-559-7778 FAX: +1 408-559-7114 Email: coregen@xilinx.com URL: http://www.xilinx.com/ipcenter 1 Features • |
Original | ||||
| pdsp16510 | AB35 AB35 Implementing Large and Non-Standard Transforms Application Brief AB35 ISSUE 1.0 February 1994 BACKGROUND The PDSP16510 is a stand-alone FFT Processor which performs 16, 64, 256, or 1024 point FFT's with input sampling rates of up to 40MHz - typically an order of magnitude faster than programmable DSP parts. A single device can window and transform |
Original | ||||
| pdsp16510 | AB35 AB35 Implementing Large and Non-Standard Transforms Application Brief AB35 - 1.0 February 1994 BACKGROUND The PDSP16510 is a stand-alone FFT Processor which performs 16, 64, 256, or 1024 point FFT's with input sampling rates of up to 40MHz - typically an order of magnitude faster than programmable DSP parts. A single device can window and transform |
Original | ||||
| 16-Point Complex FFT/IFFT V1.0.3 December 17, | 16-Point Complex FFT/IFFT V1.0.3 December 17, 1999 Product Specification R Xilinx Inc. 2100 Logic Drive San Jose, CA 95124 Phone: +1 408-559-7778 Fax: +1 408-559-7114 URL: www.xilinx.com/support/techsup/appinfo www.xilinx.com/ipcenter Features • |
Original | ||||
| 1024-point | High-Performance 1024-Point Complex FFT April 8, 1999 Application Note This document is (c) Xilinx, Inc. 1999. No part of this file may be modified, transmitted to any third party (other than as intended by Xilinx) or used without a Xilinx programmable or hardwire device without Xilinx's prior written permission. |
Original | ||||
| 16-point | High-Performance 16-Point Complex FFT April 8, 1999 Application Note •This document is (c) Xilinx, Inc. 1999. No part of this file may be modified, transmitted to any third party (other than as intended by Xilinx) or used without a Xilinx programmable or hardwire device without Xilinx's prior written permission. |
Original | ||||
|
|
||||||
| ad5933 | Preliminary Technical Data 1 MSPS 12-Bit Impedance Converter, Network Analyzer AD5933 point. The magnitude of the impedance and relative phase of the impedance at each frequency point along the sweep is easily calculated using the following equations: FEATURES |
Original | ||||
| ad5933 | Preliminary Technical Data 1 MSPS 12-Bit Impedance Converter, Network Analyzer AD5933 point. The magnitude of the impedance and relative phase of the impedance at each frequency point along the sweep is easily calculated using the following equations: FEATURES |
Original | ||||
| ad5934 | Preliminary Technical Data 250 kSPS 12-Bit Impedance Converter, Network Analyzer AD5934 impedance at each frequency point along the sweep is easily calculated using the following equations: FEATURES 100 kHz max excitation output Impedance range 0.1 kΩ to 10 MΩ, 12-bit resolution |
Original | ||||
| an2768 | Freescale Semiconductor Application Note AN2768 Rev. 0, 7/2004 Implementation of a 128-Point FFT on the MRC6011 Device by Zhao Li, Hirokazu Higa, and Ed Martinez The Fast Fourier Transform (FFT) is an efficient way to compute the Discrete-time Fourier Transform (DFT) by exploiting symmetry and |
Original | ||||
| tms320 | Application Report SPRA291 - August 2001 Implementing Fast Fourier Transform Algorithms of Real-Valued Sequences With the TMS320 DSP Platform Robert Matusiak Digital Signal Processing Solutions ABSTRACT The Fast Fourier Transform (FFT) is an efficient computation of the Discrete Fourier |
Original | ||||
| tms320 | Implementing Fast Fourier Transform Algorithms of Real-Valued Sequences with the TMS320 DSP Family APPLICATION REPORT: SPRA291 Robert Matusiak Member, Group Technical Staff Digital Signal Processing Solutions December 1997 IMPORTANT NOTICE Texas Instruments (TI) reserves the right to make changes to its products or to discontinue any |
Original | ||||
| tms320 | Implementing Fast Fourier Transform Algorithms of Real-Valued Sequences with the TMS320 DSP Family APPLICATION REPORT: SPRA291 Robert Matusiak Member, Group Technical Staff Digital Signal Processing Solutions December 1997 IMPORTANT NOTICE Texas Instruments (TI) reserves the right to make changes to its products or to discontinue any |
Original | ||||
| CHAPTER 12 The Fast Fourier Transform There are | CHAPTER 12 The Fast Fourier Transform There are several ways to calculate the Discrete Fourier Transform (DFT), such as solving simultaneous linear equations or the correlation method described in Chapter 8. The Fast Fourier Transform (FFT) is another method for calculating the DFT. While it produces the same |
Original | ||||