atmel 426
Abstract: AT40K AT40KAL AT94K
Contextual Info: IP Core Generator: Constant Features • Accessible from the Macro Generator Dialog and HDLPlanner – Included in IDS for FPGA Devices and System Designer™ for AT94K FPSLIC™ Devices • Variable Width of Output Vectors • Constant Value • Binary, Octal, Decimal or Hexadecimal Radix Value
|
Original
|
AT94K
2429B
1/02/xM
atmel 426
AT40K
AT40KAL
|
PDF
|
16 point DIF FFT using radix 4 fft
Abstract: fft algorithm cosin 64 point FFT radix-4 BUTTERFLY DSP spra152 16 point DIF FFT using radix 2 fft TMS320C80 radix-4 ALU flow chart
Contextual Info: 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
|
TMS320C80
SPRA152
16 point DIF FFT using radix 4 fft
fft algorithm
cosin
64 point FFT radix-4
BUTTERFLY DSP
spra152
16 point DIF FFT using radix 2 fft
radix-4
ALU flow chart
|
PDF
|
radix-2 dit fft flow chart
Abstract: 16 point DIF FFT using radix 4 fft 16 point DIF FFT using radix 2 fft 8 point fft radix-2 DIT FFT C code radix-2 Butterfly two butterflies ADSP-2100
Contextual Info: 6 One-Dimensional FFTs 6.2.3 Radix-2 Decimation-In-Frequency FFT Algorithm In the DIT FFT, each decimation consists of two steps. First, a DFT equation is expressed as the sum of two DFTs, one of even samples and one of odd samples. This equation is then divided into two equations, one
|
Original
|
10-bit
radix-2 dit fft flow chart
16 point DIF FFT using radix 4 fft
16 point DIF FFT using radix 2 fft
8 point fft
radix-2 DIT FFT C code
radix-2
Butterfly
two butterflies
ADSP-2100
|
PDF
|
TV Tuner sharp
Abstract: sharp tv tuner ESS TECHNOLOGY Tv tuner external Diagram Sampling Mixer sharp tuner sharp tuner tv silicon tuner DVBT sharp tv diagram dvb-c
Contextual Info: CONFIDENTIAL ADVANCE INFORMATION RadiX Multistandard CMOS TV Tuner Product Brief Analog Reinvented ESS’s RadiX tuner is the industry’s lowest power and most highly integrated CMOS based multistandard silicon TV tuner enabling the lowest bill of materials. With built-in SAW filters, the RadiX
|
Original
|
|
PDF
|
TMS320C6xx
Abstract: floating point adder SPRA297 64 point FFT radix-4 AHBH S3L 54 TMS320 CO2H 32 point fast Fourier transform using floating point ABLL
Contextual Info: TMS320C62xx Extended Precision Radix-4 Fast Fourier Transform Implemented on the TMS320C62xx APPLICATION REPORT: SPRA297 Robert Matusiak Digital Signal Processing Solutions November 1998 IMPORTANT NOTICE Texas Instruments TI reserves the right to make changes to its products or to discontinue any
|
Original
|
TMS320C62xx
SPRA297
--B15
TMS320C6xx
floating point adder
SPRA297
64 point FFT radix-4
AHBH
S3L 54
TMS320
CO2H
32 point fast Fourier transform using floating point
ABLL
|
PDF
|
butterfly atmel
Abstract: pipeline fft AT40K AT40K-FFT fft processor FLOATING POINT Co Processor
Contextual Info: Features • • • • • • • • • • Decimation in frequency radix-2 FFT algorithm. 256-point transform. 12-bit fixed point arithmetic. Fixed scaling to avoid numeric overflow. Requires no external memory, i.e. uses on chip RAM and ROM. External access to on-chip RAM for data IO.
|
Original
|
256-point
12-bit
AT40K30
AT40K
08/98/15M
butterfly atmel
pipeline fft
AT40K-FFT
fft processor
FLOATING POINT Co Processor
|
PDF
|
TL SK 100B
Abstract: ORD 1114 PA-L19
Contextual Info: 10 A l p h a I ns t r uc t i on S u m m a r y This section contains a sum m ary of all Alpha architecture instructions. All values are in hexadecimal radix. Table 51 describes the contents of the Format and Opcode columns that are in Table 52. T a b l e 51
|
OCR Scan
|
11-bit
16-bit
26-bit
TL SK 100B
ORD 1114
PA-L19
|
PDF
|
ORD 1114
Abstract: 7817A
Contextual Info: 10 Alpha Instruction Summary This section contains a summary of all Alpha architecture instructions. All values are in hexadecim al radix Table 15 describes the contents of the Format and Opcode columns that are in Table 16. Table 15 Instruction Format and Opcode Notation
|
OCR Scan
|
11-bit
16-bit
26-bit
ORD 1114
7817A
|
PDF
|
OPC07
Abstract: opcoa 1702D SVC 561 10 OPC02 BIC 1222 1702b SVC 561 -10 OB2223
Contextual Info: 10 Alpha Instruction Summary This section contains a summary of all Alpha architecture instructions. All values are in hexadecimal radix. Table 15 describes the contents of the Format and Opcode col umns that are in Table 16. Table 15 Instruction Format and Opcode Notation
|
OCR Scan
|
11-bit
16-bit
26-bit
OPC07
opcoa
1702D
SVC 561 10
OPC02
BIC 1222
1702b
SVC 561 -10
OB2223
|
PDF
|
32P4110
Contextual Info: Abridged Version SSI 32P4110 350 Mbit/s PRML Read Channel with EPR4, 16/17 0,6/8 ENDEC Prototype Febraury 1998 Functional blocks include AGC, programmable continuous-time filter, adaptive FIR transversal filter, 1+D filter, 6-bit flash ADC, full EPR4 Radix-4 digital
|
Original
|
32P4110
32P4110
|
PDF
|
vhdl code for 16 BIT BINARY DIVIDER
Abstract: UNSIGNED SERIAL DIVIDER using verilog vhdl code for simple radix-2 UNSIGNED SERIAL DIVIDER using vhdl vhdl code for N fraction Divider verilog code for floating point division verilog code for simple radix-2 verilog code for four bit binary divider DS530 IEEE754
Contextual Info: v as in Divider v1.0 DS530 January 18, 2006 Product Specification Introduction LogiCORE Facts The LogiCORE™ Divider core creates a circuit for fixed-point or floating-point division based on radix-2 non-restoring division, or division by repeated multiplications, respectively. The Divider core supersedes
|
Original
|
DS530
vhdl code for 16 BIT BINARY DIVIDER
UNSIGNED SERIAL DIVIDER using verilog
vhdl code for simple radix-2
UNSIGNED SERIAL DIVIDER using vhdl
vhdl code for N fraction Divider
verilog code for floating point division
verilog code for simple radix-2
verilog code for four bit binary divider
IEEE754
|
PDF
|
64 point radix 4 FFT
Abstract: radix-2 16 point DFT butterfly graph 64 point FFT radix-4 16 point DIF FFT using radix 4 fft 64-point core i3 16-Point SB JY transistor YA
Contextual Info: One-Dimensional FFTs 6 6.5 RADIX-4 FAST FOURIER TRANSFORMS Whereas a radix-2 FFT divides an N-point sequence successively in half until only two-point DFTs remain, a radix-4 FFT divides an N-point sequence successively in quarters until only four-point DFTs remain. An
|
Original
|
N/16-point
16-point
64-point
1024-point
64 point radix 4 FFT
radix-2
16 point DFT butterfly graph
64 point FFT radix-4
16 point DIF FFT using radix 4 fft
core i3
SB JY
transistor YA
|
PDF
|
butterfly atmel
Abstract: AT40K-FFT pipeline fft AT40K 1132B 16 point FFT butterfly
Contextual Info: AT40K FPGA IP Core – The Fast Fourier Transform FFT Processor 1. Introduction The Fast Fourier Transform (FFT) processor is a FFT engine developed for the AT40K family of Field Programmable Gate Arrays (FPGAs). The design is based on a decimation-in-frequency radix-2 algorithm and employs in-place computation to optimize memory usage. In order to operate the processor, data must first be loaded into
|
Original
|
AT40K
AT40K-FFT
1132B
butterfly atmel
AT40K-FFT
pipeline fft
16 point FFT butterfly
|
PDF
|
CS2411
Abstract: CS2411TK CS2411XV DS2411
Contextual Info: 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
|
CS2411
CS2411
1024-point
radix-16
1024-word
DS2411
CS2411TK
CS2411XV
|
PDF
|
|
|
68hc11a1fn
Abstract: FT-37-77 transistor k117 78L05 equivalent k117 transistor 34064 Antron-99 theory toroid k117 equivalent of 78l05
Contextual Info: AT-11 Automatic Antenna Tuner Assembly Manual LDG ELECTRONICS Ver 2.4a LDG Electronics 1445 Parran Road St. Leonard MD 20685 Phone: 410-586-2177 Fax: 410-586-8475 e-mail: ldg@radix.net http://www.radix.net/~ldg Introduction: The AT-11 is a full featured auto or semi automatic antenna tuner designed for HF 1.8 to 30
|
Original
|
AT-11
au18-34
R41-44
C1-34
C61-63
100pf
150pf
330pf
680pf
68hc11a1fn
FT-37-77
transistor k117
78L05 equivalent
k117 transistor
34064
Antron-99
theory toroid
k117 equivalent
of 78l05
|
PDF
|
radix-2 DIT FFT C code
Abstract: transistor y1 fft algorithm radix-2 X0187 8 point fft Diode Y1 i3 processor two butterflies y1 transistor
Contextual Info: 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
|
|
PDF
|
trapper
Abstract: fft algorithm addressing mode in core i7 transistor YA S41024 1024-POINT 16 point DIF FFT using radix 4 fft
Contextual Info: One-Dimensional FFTs 6 6.6 OPTIMIZED RADIX-4 DIF FFT 6.6.1 First Stage Modifications This section explores changes to the radix-4 FFT program to increase its execution speed. Specifically, changes in the first and last stages, data structures and program flow are discussed.
|
Original
|
|
PDF
|
00FF
Abstract: ADSP-2100 IEEE-754 Floating-Point Arithmetic
Contextual Info: Floating-Point Arithmetic 3 3 3.1 OVERVIEW In fixed-point number representation, the radix point is always at the same location. While this convention simplifies numeric operations and conserves memory, it places a limit on the magnitude and the precision of
|
Original
|
|
PDF
|
radix-8 FFT
Abstract: 2048-point IFFT radix-2 CS2420 CS2421 2048-POINT xilinx radix-2 fft xilinx
Contextual Info: CS2421 TM 2048/8192-Point IFFT Preliminary Datasheet Virtual Components for the Converging World The CS2421 is an online programmable, 2048/8192-point Inverse Fast Fourier Transform IFFT core. This highly integrated application specific silicon core is based on the radix-4 algorithm and performs 2048-point or 8192point IFFT algorithms in three computation passes. The CS2421 IFFT core is available in both ASIC and FPGA
|
Original
|
CS2421
2048/8192-Point
CS2421
2048-point
8192point
DS2421
radix-8 FFT
IFFT
radix-2
CS2420
2048-POINT xilinx
radix-2 fft xilinx
|
PDF
|
64-Point
Abstract: IFFT 16 point DIF FFT using radix 4 fft 64 point radix 4 FFT application of radix 2 inverse dif fft fast fourier transform CS2461 CS2461AA CS2461QL QL7100
Contextual Info: 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
|
CS2461
64-Point
CS2461
DS2461
IFFT
16 point DIF FFT using radix 4 fft
64 point radix 4 FFT
application of radix 2 inverse dif fft
fast fourier transform
CS2461AA
CS2461QL
QL7100
|
PDF
|
radix-2
Abstract: IFFT fft matlab code using 16 point DFT butterfly matlab code using 8 point DFT butterfly matlab code for fft radix 4 TMS320C62x fft benchmark fft dft MATLAB AHBH tms320c62x fft matlab code for radix-2 fft
Contextual Info: Application Report SPRA696A – April 2001 Extended-Precision Complex Radix-2 FFT/IFFT Implemented on TMS320C62x Mattias Ahnoff DSP Central Europe ABSTRACT The limited dynamic range of a fixed-point DSP causes accuracy problems in Fast Fourier Transform FFT calculation. This is due to quantization and the scaling that has to be
|
Original
|
SPRA696A
TMS320C62x
TMS320C62xTM
C62xTM)
radix-2
IFFT
fft matlab code using 16 point DFT butterfly
matlab code using 8 point DFT butterfly
matlab code for fft radix 4
TMS320C62x fft benchmark
fft dft MATLAB
AHBH
tms320c62x fft
matlab code for radix-2 fft
|
PDF
|
vhdl code for radix-4 fft
Abstract: verilog for 8 point fft verilog code for radix-4 complex fast fourier transform vhdl for 8 point fft verilog code for 256 point fft based on asic 16 point FFT radix-4 VHDL vhdl code for radix-4 complex multiplier radix-8 FFT vhdl code for FFT 32 point verilog code for 64 point fft
Contextual Info: 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
|
CS2410
CS2410
1024-point
1024-word
16-bit
32-bit
DS2410
vhdl code for radix-4 fft
verilog for 8 point fft
verilog code for radix-4 complex fast fourier transform
vhdl for 8 point fft
verilog code for 256 point fft based on asic
16 point FFT radix-4 VHDL
vhdl code for radix-4 complex multiplier
radix-8 FFT
vhdl code for FFT 32 point
verilog code for 64 point fft
|
PDF
|
F46C
Abstract: F487 F65D F61C b1167 F47B F45E F48B F487 transistor 36B2
Contextual Info: National Semiconductor Application Note 487 Ashok Krishnamurthy April 1987 INTRODUCTION This report describes the implementation of a radix-2 Decimation-in-time FFT algorithm on the HPC The program as presently set up can do FFTs of length 2 4 8 16 32 64 128 and 256 The program can be easily modified to work
|
Original
|
|
PDF
|
ADSP-2100
Abstract: integer division 4 bits by 2 bits division algorithm LSHI
Contextual Info: Fixed-Point Arithmetic 2.1 2 OVERVIEW Binary number representations usually include a sign and a radix point, as well as a magnitude. The sign shows whether the number is positive or negative. The radix point separates the integer and fractional parts of the
|
Original
|
ADSP-2100,
ADSP-2100
integer division 4 bits by 2 bits
division algorithm
LSHI
|
PDF
|