Kar et al., 2002 - Google Patents
A new systolic realization for the discrete Fourier transformKar et al., 2002
- Document ID
- 10469459867148993350
- Author
- Kar D
- Rao V
- Publication year
- Publication venue
- IEEE transactions on signal processing
External Links
Snippet
A new systolic realization for the discrete Fourier transform Page 1 2008 IEEE TRANSACTIONS
ON SIGNAL PROCESSING, VOL. NO. MAY 1993 1 .oc ,875 .750 A 0 X N Jl C (Ir Q L Q- (U ,625
v =, ,500 $ .375 ,250 .125 ,000 I .79V 1.59 2.38 3.17 3.97 9.76 5.56 6 t ime-ms (XIO~) 5 Fig. 21 …
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
- G06F17/142—Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/544—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices for evaluating functions by calculation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/4806—Computations with complex numbers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06G—ANALOGUE COMPUTERS
- G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
- G06G7/12—Arrangements for performing computing operations, e.g. operational amplifiers
- G06G7/19—Arrangements for performing computing operations, e.g. operational amplifiers for forming integrals of products, e.g. Fourier integrals, Laplace integrals, correlation integrals; for analysis or synthesis of functions using orthogonal functions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/06—Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06J—HYBRID COMPUTING ARRANGEMENTS
- G06J1/00—Hybrid computing arrangements
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Septimus et al. | Compressive sampling hardware reconstruction | |
| Van et al. | Generalized low-error area-efficient fixed-width multipliers | |
| Park et al. | Fixed-point error analysis of CORDIC processor based on the variance propagation formula | |
| Liu et al. | One-step calculation circuit of FFT and its application | |
| Jana et al. | An area efficient vlsi architecture for 1-d and 2-d discrete wavelet transform (dwt) and inverse discrete wavelet transform (idwt) | |
| Jain et al. | A universal nonlinear component and its application to WSI | |
| Kar et al. | A new systolic realization for the discrete Fourier transform | |
| Lee | On computing 2-D systolic algorithm for discrete cosine transform | |
| Lim et al. | A systolic array for 2-d dft and 2-d dct | |
| Odugu et al. | Implementation of low power and memory efficient 2D FIR filter architecture | |
| Bruton et al. | Highly selective three-dimensional recursive beam filters using intersecting resonant planes | |
| Marino | A" double-face" bit-serial architecture for the 1D discrete wavelet transform | |
| Townsend et al. | An NMOS microprocessor for analog signal processing | |
| Soleimani | Combine particle swarm optimization algorithm and canonical sign digit to design finite impulse response filter | |
| Ghonge et al. | VLSI design of fixed width 2's compliment multiplier | |
| Poornima et al. | Memory efficient high speed systolic array architecture design with multiplexed distributive arithmetic for 2D DTCWT computation on FPGA | |
| Mahmoud et al. | Signal denoising by wavelet packet transform on FPGA technology | |
| Boga et al. | A generalized stochastic implementation of the disparity energy model for depth perception | |
| Mahdavi | Complex-Domain FIR Filter Design for Signal Processing Applications | |
| Inggs et al. | Exploring the latency-resource trade-off for the Discrete Fourier Transform on the FPGA | |
| Zhang et al. | Design of an efficient multiplier-less architecture for multi-dimensional convolution | |
| Pyrgas et al. | An FPGA design for the two-band fast discrete Hartley transform | |
| Ge et al. | Efficient algorithm for 2-D arithmetic Fourier transform | |
| Cardarilli et al. | RNS implementation of high performance filters for satellite demultiplexing | |
| Bochev | Distributed arithmetic implementation of artificial neural networks |