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

DOI10.1016/S0898-1221(01)00105-5MaRDI QIDQ5948795zbMATH OpenFDO

Authors R. Baghaie, V. Dimitrov

Publication date 12 November 2001

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

Full work available at URL https://doi.org/10.1016/S0898-1221(01)00105-5

zbMATH Keywords

algebraic integer encoding schemealgorithmsdiscrete cosine transformdiscrete Hartley transformerror-free representationexact computer arithmeticHaar transformimage processingsignal processingsystolic arrays

Mathematics Subject Classification ID

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

Recommendations

• Bit-level systolic implementation of discrete orthogonal transforms
• scientific article; zbMATH DE number 882131
• Optimal algebraic integer implementation with application to complex frequency sampling filters
• Computationally efficient systolic architecture for computing the discrete Fourier transform
• The discrete Haar transform: A systolic realization
• An integer approximation method for discrete sinusoidal transforms
• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Discrete Fourier transform algorithms for real valued sequences
• A systolic array architecture for the discrete sine transform

Cites work

• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Discrete Cosine Transform
• Fast algorithms for the discrete cosine transform
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 47594 (Why is no real title available?)
• Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}]</tex>
• Systolic architectures for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition
• Systolic arrays for the discrete Hartley transform

Cited in

(4)

• An integer approximation method for discrete sinusoidal transforms
• A VLSI architecture for the real time computation of discrete trigonometric transforms
• Bit-level systolic implementation of discrete orthogonal transforms
• A generalized approach to linear transform approximations with applications to the discrete cosine transform

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948795)