Pages that link to "Item:Q3578724"

The following pages link to Fast Algorithms for Signal Processing (Q3578724):

Displaying 16 items.

• The eigenstructure and Jordan form of the Fourier transform over fields of characteristic 2 and a generalized Vandermonde-type formula (Q252622) (← links)
• Cosine transforms over fields of characteristic 2 (Q897337) (← links)
• Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
• Velocity filtering for attenuating moving artifacts in videos using an ultra-low complexity 3-D linear-phase IIR filter (Q1698421) (← links)
• Fractional cosine and sine transforms over finite fields (Q1947085) (← links)
• Low-complexity 8-point DCT approximation based on angle similarity for image and video coding (Q2002406) (← links)
• An orthogonal 16-point approximate DCT for image and video compression (Q2014160) (← links)
• An improvement of methods for solving the CUPL-Toeplitz linear system (Q2079121) (← links)
• Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions (Q2405466) (← links)
• Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution (Q2668536) (← links)
• High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers (Q2946459) (← links)
• Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
• A novel approach for defining a Hilbert number transform (Q6046505) (← links)
• Efficient, low complexity 8-point discrete Tchebichef transform approximation for signal processing applications (Q6099845) (← links)
• Numerical algorithms for corner-modified symmetric Toeplitz linear system with applications to image encryption and decryption (Q6138325) (← links)
• Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications (Q6179934) (← links)