[go: up one dir, main page]

Liu et al., 1991 - Google Patents

A new systolic array algorithm for discrete Fourier transform

Liu et al., 1991

Document ID
5748536562940816461
Author
Liu C
Jen C
Publication year
Publication venue
1991 IEEE International Symposium on Circuits and Systems (ISCAS)

External Links

Snippet

A new systolic algorithm for computing the discrete Fourier transform (DFT) is presented. The algorithm exhibits the minimum required time O (Nt/sub a/) and the computational complexity O (2N/sup 2/), which are much better than the time O (Nt/sub a/+ Nt/sub m/) and …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • 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
    • 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/50—Adding; Subtracting
    • G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8007—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors single instruction multiple data [SIMD] multiprocessors
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575

Similar Documents

Publication Publication Date Title
Shenoy et al. Fast base extension using a redundant modulus in RNS
EP0644492B1 (en) Apparatus for adaptively processing video signals
US5787029A (en) Ultra low power multiplier
KR20190074195A (en) Neural processing accelerator
Liu et al. A new systolic array algorithm for discrete Fourier transform
Webb Implementation and performance of fast parallel multi-baseline stereo vision
Strader et al. A canonical bit-sequential multiplier
Chakrabarti et al. Novel sorting network-based architectures for rank order filters
Gaur et al. An efficient design of scalable reversible multiplier with testability
Asadi et al. Towards designing quantum reversible ternary multipliers
Kung Use of VLSI in algebraic computation: Some suggestions
He et al. An efficient VLSI architecture for new three-step search algorithm
Chang et al. High-performance digit-serial complex-number multiplier-accumulator
Toyoshima Computationally efficient bicomplex multipliers for digital signal processing
Patel et al. Efficient Tree Multiplier Design by using Modulo 2 n+ 1 Adder
Hariyama et al. VLSI processor for reliable stereo matching based on window-parallel logic-in-memory architecture
Dulac et al. Implementation and evaluation of a parallel architecture using asynchronous communications
Tullsen et al. Design and VLSI implementation of an on-line algorithm
Syed et al. A scalable architecture for discrete wavelet transform
Al-Rabadi Representations, operations, and applications of switching circuits in the reversible and quantum spaces
Al-Rabadi Reversible systolic arrays: m-ary bijective single-instruction multiple-data (SIMD) architectures and their quantum circuits
KR100201946B1 (en) Appratus and method for calculating thechecksum of fft network
Gupta et al. Design and implementation of an efficient general-purpose median filter network
Gušev et al. New linear systolic arrays for the string comparison algorithm
Sheu et al. An architecture with low memory-bandwidth and less hardware cost for 3SBM algorithm