Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications

DOI10.1007/BF01816549MaRDI QIDQ2277807zbMATH OpenOpenAlexFDO

Authors Mohamed El-Sharkawy, Wenlong Tsang, Maurice F. Aburdene

Publication date 1990

Published in Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01816549

zbMATH Keywords

Cray X-MP/48 vector computerdigital signal processingdiscrete cosine transformdiscrete Hadamard transformdiscrete Hartley transformdiscrete sine transformdiscrete Walsh transformfactorizations of transform matricesfast real discrete Fourier transformsmultidimensional orthogonal transformsparallel algorithmsrow-column methodspeed performancesvector processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

The paper presents vector and parallel algorithms and implementations of one- and two-dimensional orthogonal transforms. The sinusoidal transforms (discrete cosine transform, discrete sine transform, discrete Hartley transform) are computed via fast real discrete Fourier transforms. The discrete Walsh transform and the discrete Hadamard transform are performed by using direct factorizations of transform matrices. The two- dimensional transform algorithms are based on the row-column method. The speed performances are evaluated on Cray X-MP/48 vector computer.

Recommendations

• Publication:4720677
• 1-D and 2-D algorithms for orthogonal transformations
• scientific article; zbMATH DE number 494405
• scientific article; zbMATH DE number 97099
• FFT algorithms for vector computers

Cites work

• A fast algorithm for the discrete sine transform implemented by the fast cosine transform
• A Fast Computational Algorithm for the Discrete Cosine Transform
• A Fast Computational Algorithm for the Discrete Sine Transform
• A fast cosine transform in one and two dimensions
• A new algorithm to compute the discrete cosine Transform
• Discrete Cosine Transform
• Fast algorithms for the discrete W transform and for the discrete Fourier transform
• FFT algorithms for vector computers
• On computing the discrete Fourier and cosine transforms
• On the Computation of the Discrete Cosine Transform
• The Fast Hartley Transform Algorithm

Cited in

(9)

• 1-D and 2-D algorithms for orthogonal transformations
• Parallel vector multidimensional Slant, Haar, and Walsh-Hadamard transforms
• scientific article; zbMATH DE number 986598 (Why is no real title available?)
• scientific article; zbMATH DE number 4139196 (Why is no real title available?)
• scientific article; zbMATH DE number 3990819 (Why is no real title available?)
• scientific article; zbMATH DE number 494405 (Why is no real title available?)
• scientific article; zbMATH DE number 494450 (Why is no real title available?)
• scientific article; zbMATH DE number 3992799 (Why is no real title available?)
• Bit-level systolic implementation of discrete orthogonal transforms

Describes a project that uses

Uses Software

• FFTPACK

This page was built for publication: Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications

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