The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fast algorithm and implementation of 2-D discrete cosine transform
Abstract
An algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N*N DCT, where N=2/sup m/, can be computed using only N 1-D DCTs and additions, instead of using 2N 1-D DCTs as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach and is also less than that of most of other fast algorithms, whereas the number of additions is almost comparable to that of others. It is also shown that only N/2 1-D DCT module are required for hardware parallel implementation of the proposed algorithm. Thus the number of actual multipliers being used is only a quarter of that required for the conventional approach.>
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
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
Ahn, K., Hoque, M. M., Song, G., Abdullah-Al-Wadud, M., & Chae, O. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.04.004 · Cited by 3
Metadata
- Authors
- Cho, N. I., & Lee, S. U.
- Venue
- IEEE Transactions on Circuits and Systems
- Published
- 1991-03
- Volume
- 38
- Issue
- 3
- Pages
- 297-305
- ISSN
- 0098-4094 (ISSN-L)
- OpenAlex
- W1976667168
- Cited by
- 239
- References
- 1
- FWCI
- 9.64
- 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 algorithm and implementation of 2-D discrete cosine transform. https://app.cochat.ai/papers/10.1109/31.101322
- The paper
- Cho, N. I., & Lee, S. U. (1991). Fast algorithm and implementation of 2-D discrete cosine transform. IEEE Transactions on Circuits and Systems. https://doi.org/10.1109/31.101322
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.