[go: up one dir, main page]

Xue et al., 2018 - Google Patents

Hardware implementation of Hirschman optimal transform based on distributed arithmetic

Xue et al., 2018

Document ID
6676420243170153675
Author
Xue D
DeBrunner L
DeBrunner V
Publication year
Publication venue
2018 52nd Asilomar Conference on Signals, Systems, and Computers

External Links

Snippet

The Hirschman Optimal Transform (HOT) has been shown to be superior to Discrete Fourier Transform (DFT) in computational complexity and resolution. The HOT can be implemented by periodic shifts of the DFT. The DFT calculation is comprised of a sum of products which is …
Continue reading at ieeexplore.ieee.org (other versions)

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/4806—Computations with complex numbers
    • G06F7/4818—Computations with complex numbers using coordinate rotation digital computer [CORDIC]
    • 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
    • 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
    • H03H17/0223—Computation saving measures; Accelerating measures
    • 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/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • 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/15—Correlation function computation including computation of convolution operations
    • 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
    • H03H17/0211—Frequency selective networks using specific transformation algorithms, e.g. WALSH functions, Fermat transforms, Mersenne transforms, polynomial transforms, Hilbert transforms
    • H03H17/0213—Frequency domain filters using Fourier transforms
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
    • H03H21/00—Adaptive networks
    • H03H21/0012—Digital adaptive filters
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
    • H03H17/00—Networks using digital techniques
    • H03H2017/0072—Theoretical filter design

Similar Documents

Publication Publication Date Title
AU689439B2 (en) Digital filter having high accuracy and efficiency
Garrido The feedforward short-time Fourier transform
Garrido et al. The constant multiplier FFT
Biglieri Theory of Volterra processors and some applications
Xue et al. Hardware implementation of Hirschman optimal transform based on distributed arithmetic
Sekhar et al. Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
Orović et al. A system for compressive sensing signal reconstruction
Martens Discrete Fourier transform algorithms for real valued sequences
Gustafsson et al. Low-complexity constant coefficient matrix multiplication using a minimum spanning tree approach
CN112799634A (en) A High Performance Ring Polynomial Multiplier Based on Radix 22MDC NTT Structure
Bae et al. Overlap-save commutators for high-speed streaming data filtering
Perkins A separable Hartley-like transform in two or more dimensions
Arun et al. Design of high speed FFT algorithm For OFDM technique
Vinchurkar et al. HDL implementation of DFT architectures using Winograd fast Fourier transform algorithm
Yang et al. Recursive discrete cosine transforms with selectable fixed-coefficient filters
Xue et al. Hardware implementation of discrete Hirschman transform convolution using distributed arithmetic
Hostetter Recursive discrete Fourier transformation with unevenly spaced data
Harshitha et al. Design of low complexity high performance LUT based feed-forward FFT architecture
Yu et al. A Low-area and Low-power 512-point Pipelined FFT Design Using Radix-2 4-2 3 for OFDM Applications
Ahuja et al. Design Of Efficient Add/Shift Algorithm For Multiple Constant Multiplication
Meenpal Efficient MUX based CORDIC on FPGA for signal processing application
KR20030054300A (en) Fast fourier transform apparatus using radix-8 single-path delay commutator and method thereof
Kaur et al. Design and Simulation of 32-Point FFT Using Mixed Radix Algorithm for FPGA Implementation
Qureshi et al. Generalized twiddle factor index mapping of radix-2 fast Fourier transform algorithm
Chodoker et al. Multiple Constant Multiplication Technique for Configurable Finite Impulse Response Filter Design