A multiplier-less 1-D and 2-D fast Fourier transform-like transformation using sum-of-powers-of-two (SOPOT) coefficients

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn 4, Issue , 2002, Pages

  Chan, S C ^a   Yiu, P M ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; DISCRETE FOURIER TRANSFORMS; FAST FOURIER TRANSFORMS; MATRIX ALGEBRA; PARAMETER ESTIMATION; POLYNOMIALS;

CANONICAL SIGNED DIGITS; MULTIPLIERLESS FAST FOURIER TRANSFORM; POLYNOMIAL TRANSFORMATION; SUM OF POWERS OF TWO COEFFICIENTS;

DIGITAL SIGNAL PROCESSING;

EID: 0036292871     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Multiplierless perfect reconstruction modulated filter banks with sum-of-power-of-two coefficients
2. Multiplier-less discrete sinusoidal and lapped transforms using sum-of-powers-of-two (SOPOT) coefficients
3. A fast multiplier-less block transform for image and video compression
4. The integer transforms analogous to discrete trigonometric transforms
5. An order-16 integer cosine transform
6. Lapped orthogonal transform with integer coefficients
7. Multiplier-less approximation of DFT and DHT
8. Fast computation of discrete fourier transform using polynomial transform
9. Split vector-radix fast Fourier transform