Calculation scheme based on a weighted primitive: application to image processing transforms

Authors:
María Teresa Signes Pont;Juan Manuel García Chamizo;Higinio Mora Mora;Gregorio de Miguel Casado
Affiliations:
Departamento de Tecnología Informática y Computación, Universidad de Alicante, Alicante, Spain;Departamento de Tecnología Informática y Computación, Universidad de Alicante, Alicante, Spain;Departamento de Tecnología Informática y Computación, Universidad de Alicante, Alicante, Spain;Departamento de Tecnología Informática y Computación, Universidad de Alicante, Alicante, Spain
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2007

Citing 14
Cited 2

The Hartley transform

The Hartley transform
Fast fourier transforms: a tutorial review and a state of the art

Signal Processing
Discrete cosine transform: algorithms, advantages, applications

Discrete cosine transform: algorithms, advantages, applications
Self-sorting in-place fast fourier transforms

SIAM Journal on Scientific and Statistical Computing
A comparison of fast inverse discrete cosine transform algorithms

Multimedia Systems - Special issue on video compression
Computing with the Hartley transform

Computers in Physics
An Adaptation of the Fast Fourier Transform for Parallel Processing

Journal of the ACM (JACM)
Image and Video Compression for Multimedia Engineering

Image and Video Compression for Multimedia Engineering
Division and Square Root: Digit-Recurrence Algorithms and Implementations

Division and Square Root: Digit-Recurrence Algorithms and Implementations
JPEG Still Image Data Compression Standard

JPEG Still Image Data Compression Standard
High-Radix Logarithm with Selection by Rounding

ASAP '02 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
A Note on Antireflective Boundary Conditions and Fast Deblurring Models

SIAM Journal on Scientific Computing
A DHT-based FFT/IFFT processor for VDSL transceivers

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02
Efficient VLSI architectures for fast computation of the discreteFourier transform and its inverse

IEEE Transactions on Signal Processing

Computational framework for behavioural modelling of neural subsystems

Neurocomputing
Improvement of the Discrete Cosine Transform calculation by means of a recursive method

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT) and then applied to other integral transforms such as the discrete Hartley transform (DHT), the discrete cosine transform (DCT), and the discrete sine transform (DST). Some comparisons with other well-known proposals are also provided.