[go: up one dir, main page]

Qiu et al., 1994 - Google Patents

Structure of the Gabor matrix and efficient numerical algorithms for discrete Gabor expansions

Qiu et al., 1994

View PDF
Document ID
17102856828295943483
Author
Qiu S
Feichtinger H
Publication year
Publication venue
Visual Communications and Image Processing'94

External Links

Snippet

The standard way to obtain suitable coefficients for the (non-orthogonal) Gabor expansion of a general signal for a given Gabor atom g and a pair of lattice constants in the (discrete) time/frequency plane, requires to compute the dual Gabor window function g-first. In this …
Continue reading at www.researchgate.net (PDF) (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
    • 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/144—Prime factor Fourier transforms, e.g. Winograd transforms, number theoretic transforms
    • 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
    • G06F17/12—Simultaneous equations, e.g. systems of linear equations
    • 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/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • 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/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • 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/30—Information retrieval; Database structures therefor; File system structures therefor

Similar Documents

Publication Publication Date Title
Nussbaumer The fast Fourier transform
Kamm et al. Optimal Kronecker product approximation of block Toeplitz matrices
Cohen et al. Non-separable bidimensional wavelet bases
Hardin et al. Biorthogonal multiwavelets on [− 1, 1]
Kok Fast algorithm for computing discrete cosine transform
US5384725A (en) Method and apparatus for encoding and decoding using wavelet-packets
Chan et al. Direct methods for computing discrete sinusoidal transforms
Feichtinger et al. Group theoretical approach to Gabor analysis
Qiu et al. Structure of the Gabor matrix and efficient numerical algorithms for discrete Gabor expansions
Balan et al. Fast algorithms for signal reconstruction without phase
Lipitakis et al. Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
Zarowski et al. Spectral filtering using the fast Walsh transform
US6343304B1 (en) Apparatus with selective fixed-coefficient filter for performing recursive discrete cosine transforms
Mersereau An algorithm for performing an inverse chirp z-transform
Feichtinger Pseudoinverse matrix methods for signal reconstruction from partial data
Göttfert An acceleration of the Niederreiter factorization algorithm in characteristic 2
Montefusco Parallel numerical algorithms with orthonormal wavelet packet bases
Hong et al. Basefield transforms with the convolution property
Lira et al. Compactly supported wavelets derived from Legendre polynomials: Spherical harmonic wavelets
VESEL Fast algorithms of Fourier and Hartley transform and their implementation in MATLAB
Gumber et al. Finite dual g-framelet systems associated with an induced group action
Chan et al. Fast algorithms for computing the discrete W transforms
Prusa et al. Segmented computation of wavelet transform via lifting scheme
Lazzaro Biorthogonal M-band filter construction using the lifting scheme
Pan et al. On parallel computations with banded matrices