[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Yarlagadda et al., 1980 - Google Patents

A note on the application of FFT to the solution of a system of Toeplitz normal equations

Yarlagadda et al., 1980

Document ID
13474993151519886653
Author
Yarlagadda R
Babu B
Publication year
Publication venue
IEEE Transactions on Circuits and Systems

External Links

Snippet

This note presents an approach to the solution of a system of Toeplitz normal equations, based on using iterative techniques, the circulant matrices and the fast Fourier transform algorithm. The number of computations required and the roundoff errors associated with this …
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/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
    • 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/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
    • G06F7/5443—Sum of products
    • 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/06—Non-recursive filters
    • H03H17/0621—Non-recursive filters with input-sampling frequency and output-delivery frequency which differ, e.g. extrapolation; Anti-aliasing
    • H03H17/0628—Non-recursive filters with input-sampling frequency and output-delivery frequency which differ, e.g. extrapolation; Anti-aliasing the input and output signals being derived from two separate clocks, i.e. asynchronous sample rate conversion
    • 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
    • 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/04—Recursive filters
    • 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
    • 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
Hamming Digital filters
Selesnick Interpolating multiwavelet bases and the sampling theorem
Wagh et al. A class of translation invariant transforms
US4080661A (en) Arithmetic unit for DFT and/or IDFT computation
Vaidyanathan On power-complementary FIR filters
Yarlagadda et al. A note on the application of FFT to the solution of a system of Toeplitz normal equations
US7246143B2 (en) Traced fast fourier transform apparatus and method
Beraldin et al. Overflow analysis of a fixed-point implementation of the Goertzel algorithm
Thong et al. Limit cycles in the combinatorial implementation of digital filters
Sreeram et al. Solution of Lyapunov equation with system matrix in companion form
Sridharan Implementation of state-space digital filter structures using block floating-point arithmetic
Reddy et al. Realization of first-order two-dimensional all-pass digital filters
Powell et al. Time reversed filtering in real-time
Clark et al. Block adaptive filtering
Maqusi A sampling theorem for dyadic stationary processes
Munson et al. ROM/ACC realization of digital filters for poles near the unit circle
Al-kishawi et al. DESIGN AND REALIZATION OF LESSCOMPLEX WAVELET- BASED TRANSCEIVERS
Prasad et al. Limit-cycle free complex biquad recursive digital filters
Nakayama A new discrete Fourier transform algorithm using butterfly structure fast convolution
Wang et al. Split Levinson algorithm is weakly stable
Martin Power normalized update algorithm for adaptive filters-without divisions
Menon et al. A speed efficient FIR filter for reconfigurable applications
Shyu et al. A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers
Stojić et al. Pole‐zero sensitivities of a digital filter due to parameter quantization
Vlcek et al. Note the window function with nearly minimum sidelobe energy