Fast Algorithms for Signal Processing
From MaRDI portal
Publication:3578724
DOI10.1017/CBO9780511760921zbMath1253.94001OpenAlexW565312106MaRDI QIDQ3578724
Publication date: 20 July 2010
Full work available at URL: https://doi.org/10.1017/cbo9780511760921
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions, Efficient computation of tridiagonal matrices largest eigenvalue, Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution, High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers, A novel approach for defining a Hilbert number transform, Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications, Cosine transforms over fields of characteristic 2, Numerical algorithms for corner-modified symmetric Toeplitz linear system with applications to image encryption and decryption, Velocity filtering for attenuating moving artifacts in videos using an ultra-low complexity 3-D linear-phase IIR filter, Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications, Fractional cosine and sine transforms over finite fields, Derivation and Analysis of Fast Bilinear Algorithms for Convolution, Low-complexity 8-point DCT approximation based on angle similarity for image and video coding, An orthogonal 16-point approximate DCT for image and video compression, An improvement of methods for solving the CUPL-Toeplitz linear system, The eigenstructure and Jordan form of the Fourier transform over fields of characteristic 2 and a generalized Vandermonde-type formula
