The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A fast cosine transform in one and two dimensions
Abstract
The discrete cosine transform (DCT) of an N-point real signal is derived by taking the discrete Fourier transform (DFT) of a 2N-point even extension of the signal. It is shown that the same result may be obtained using only an N-point DFT of a reordered version of the original signal, with a resulting saving of 1/2. If the fast Fourier transform (FFT) is used to compute the DFT, the result is a fast cosine transform (FCT) that can be computed using on the order ofN \log_{2} Nreal multiplications. The method is then extended to two dimensions, with a saving of 1/4 over the traditional method that uses the DFT.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ahmed, N., Natarajan, T., & Rao, K. R. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.223784 · Cited by 5,156
Cited by
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
A new algorithm to compute the discrete cosine Transform
Lee, B. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164443 · Cited by 604
Fast algorithms for the discrete cosine transform
Feig, E., & Winograd, S. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157218 · Cited by 408
Symmetric convolution and the discrete sine and cosine transforms
Martucci, S. A. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.295213 · Cited by 371
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Metadata
- Authors
- Makhoul, J.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1980-02
- Volume
- 28
- Issue
- 1
- Pages
- 27-34
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2037221767
- Cited by
- 341
- References
- 1
- FWCI
- 8.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A fast cosine transform in one and two dimensions. https://app.cochat.ai/papers/10.1109/tassp.1980.1163351
- The paper
- Makhoul, J. (1980). A fast cosine transform in one and two dimensions. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1980.1163351
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.