The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Fast Computational Algorithm for the Discrete Cosine Transform
Abstract
A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Fast algorithms exist for DCT computation that are of the order O ( n 2 log n ) [49], where n is the dimension of the frame patches.”
From Blind Prediction of Natural Video Quality (2014) · cites this paper as [49]
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
Hybrid Coding of Pictorial Data
Habibi, A. R. N. (1974) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1974.1092258 · Cited by 117
An Investigation Of MSE Contributions In Transform Image Coding Schemes
Parsons, J. R., & Tescher, A. G. (1975) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.965364 · Cited by 11
Research works printed but not linked: 3
- chen, 0, Adaptive Coding of Color Images Using Cosine Transform, Proceedings of ICC 76, 47-7
- rose, 0, Inter-frame Transform Coding and Predictive Coding Methods, Proceedings of ICC 75, 23.17
- chen, 1976, Image Enhancement Using Cosine Transform Filtering, Proceedings of the Symposium on Current Mathematical Problems in Image Science, 186
Cited by
Visual learning and recognition of 3-d objects from appearance
Murase, H., & Nayar, S. K. (1995) · International Journal of Computer Vision · doi:10.1007/bf01421486 · Cited by 1,881
Blind Image Quality Assessment: A Natural Scene Statistics Approach in the DCT Domain
Saad, M. A., Bovik, A. C., & Charrier, C. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2191563 · Cited by 1,751
Fast fourier transforms: A tutorial review and a state of the art
Duhamel, P., & Vetterli, M. (1990) · Signal Processing · doi:10.1016/0165-1684(90)90158-u · Cited by 1,143
Singh, H., Lee, M.-H., Lu, G., Kurdahi, F. J., Bagherzadeh, N., & Chaves Filho, E. M. (2000) · IEEE Transactions on Computers · doi:10.1109/12.859540 · Cited by 858
Practical fast 1-D DCT algorithms with 11 multiplications
Loeffler, C., Ligtenberg, A., & Moschytz, G. S. (2003) · International Conference on Acoustics, Speech, and Signal Processing, · doi:10.1109/icassp.1989.266596 · Cited by 646
Metadata
- Authors
- Chen, W.-H., Smith, C., & Fralick, S.
- Affiliations
- Campbell Foundation (US)
- Ford Aerospace (United States) (US)
- Venue
- IEEE Transactions on Communications
- Published
- 1977-09
- Volume
- 25
- Issue
- 9
- Pages
- 1004-1009
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2105815873
- Cited by
- 1,148
- References
- 3
- Citations by year
- 2026: 6 · 2025: 7 · 2024: 18 · 2023: 17 · 2022: 19 · 2021: 19 · 2020: 17 · 2019: 19 · 2018: 26 · 2017: 28 · 2016: 35 · 2015: 37 · 2014: 45 · 2013: 41 · 2012: 49
- FWCI
- 7.56
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IRE Transactions on Communications Systems (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Digital Filter Design and Implementation
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Signal Processing › Video Coding and Compression Technologies
- Keywords
- discrete cosine transform, fast algorithms, computational complexity, signal flow graph, matrix representation, hardware implementation, software implementation
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 Computational Algorithm for the Discrete Cosine Transform. https://app.cochat.ai/papers/10.1109/tcom.1977.1093941
- The paper
- Chen, W.-H., Smith, C., & Fralick, S. (1977). A Fast Computational Algorithm for the Discrete Cosine Transform. IEEE Transactions on Communications. https://doi.org/10.1109/tcom.1977.1093941
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.