Systolic implementation of real-valued discrete transforms via algebraic integer quantization

DOI10.1016/S0898-1221(01)00105-5zbMath0983.65148MaRDI QIDQ5948795

No author found.

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmssystolic arraysimage processingsignal processingalgebraic integer encoding schemediscrete cosine transformdiscrete Hartley transformerror-free representationexact computer arithmeticHaar transform

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}</tex>]
• Systolic arrays for the discrete Hartley transform
• Fast algorithms for the discrete cosine transform
• Discrete Cosine Transform
• Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition

This page was built for publication: Systolic implementation of real-valued discrete transforms via algebraic integer quantization