The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Fast algorithms for the discrete cosine transform
Abstract
Several fast algorithms for computing discrete cosine transforms (DCTs) and their inverses on multidimensional inputs of sizes which are powers of 2 are introduced. Because the 1-D 8-point DCT and the 2-D 8*8-point DCT are so widely used, they are discussed in detail. Algorithms for computing scaled DCTs and their inverses are also presented. These have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization.>
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
Discrete Cosine Transform: Algorithms, Advantages, Applications
Rao, K. R., Yip, P. C. Y., & Britaňák, V. (1990) · Cited by 1,862
A Fast Computational Algorithm for the Discrete Cosine Transform
Chen, W.-H., Smith, C., & Fralick, S. (1977) · IEEE Transactions on Communications · doi:10.1109/tcom.1977.1093941 · Cited by 1,148
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Self-citationA 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
Arithmetic Complexity of Computations
Winograd, S. (1980) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970364 · Cited by 535
Self-citationA fast recursive algorithm for computing the discrete cosine transform
Hou, H. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165060 · Cited by 405
A Fast DCT-SQ Scheme for Images
Arai, Y., Agui, T., & Nakajima, M. (1988) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 360
A fast cosine transform in one and two dimensions
Makhoul, J. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163351 · Cited by 341
Simple FFT and DCT algorithms with reduced number of operations
Vetterli, M., Eurasip, M., & Nussbaumer, H. J. (1984) · Signal Processing · doi:10.1016/0165-1684(84)90059-8 · Cited by 334
Cited by
Handcrafted vs. non-handcrafted features for computer vision classification
Nanni, L., Ghidoni, S., & Brahnam, S. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.05.025 · Cited by 542
Text detection and recognition in images and video frames
Chen, D., Odobez, J.-M., & Bourlard, H. (2004) · Pattern Recognition · doi:10.1016/j.patcog.2003.06.001 · Cited by 277
Fast Algorithms for Signal Processing
Blahut, R. E. (2010) · doi:10.1017/cbo9780511760921 · Cited by 274
Facial Sentiment Analysis Using AI Techniques: State-of-the-Art, Taxonomies, and Challenges
Patel, K., Mehta, D., Mistry, C., Gupta, R., Tanwar, S., Kumar, N., & Alazab, M. (2020) · IEEE Access · doi:10.1109/access.2020.2993803 · Cited by 157
Metadata
- Authors
- Feig, E., & Winograd, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1992
- Volume
- 40
- Issue
- 9
- Pages
- 2174-2193
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2148248162
- Cited by
- 408
- References
- 17
- FWCI
- 18.74
- 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: Fast algorithms for the discrete cosine transform. https://app.cochat.ai/papers/10.1109/78.157218
- The paper
- Feig, E., & Winograd, S. (1992). Fast algorithms for the discrete cosine transform. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.157218
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.