On computing the discrete Fourier and cosine transforms

DOI10.1109/TASSP.1985.1164710zbMATH Open0621.65034MaRDI QIDQ3757261FDOQ3757261

Authors: Zhongde Wang 

Publication date: 1985

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Recommendations

• On the discrete cosine transform computation
• scientific article; zbMATH DE number 3915602
• On the computation of running discrete cosine and sine transform
• scientific article; zbMATH DE number 3918252
• Publication:3199959
• scientific article; zbMATH DE number 11434
• Fast algorithms for computing the discrete cosine transform
• scientific article; zbMATH DE number 24367
• Rapid Computation of the Discrete Fourier Transform
• On a fast algorithm for computing the Fourier transform

zbMATH Keywords

discrete Fourier transformdiscrete cosine transformreal matrix decompositionsinusoidal transforms

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Cited In (11)

• Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications
• Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms
• Title not available (Why is that?)
• Fast and numerically stable algorithms for discrete cosine transforms
• Vector computation of the discrete Fourier transform
• Binary Discrete Cosine and Hartley Transforms
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
• Title not available (Why is that?)
• Discrete Fourier transform computation using prime Ramanujan numbers
• The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
• On computation of certain discrete Fourier transforms using binary calculus

This page was built for publication: On computing the discrete Fourier and cosine transforms

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