The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Practical fast 1-D DCT algorithms with 11 multiplications
Abstract
A class of practical fast algorithms is introduced for the discrete cosine transform (DCT). For an 8-point DCT only 11 multiplications and 29 additions are required. A systematic approach is presented for generating the different members in this class, all having the same minimum arithmetic complexity. The structure of many of the published algorithms can be found in members of this class. An extension of the algorithm to longer transformations is presented. The resulting 16-point DCT requires only 31 multiplications and 81 additions, which is, to the authors' knowledge, less than required by previously published algorithms.>
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
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
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 W transform and for the discrete Fourier transform
Wang, Z. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164399 · Cited by 597
A 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
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
Some bilinear forms whose multiplicative complexity depends on the field of constants
Winograd, S. (1976) · Mathematical Systems Theory · doi:10.1007/bf01683270 · Cited by 165
A Discrete Fourier-Cosine Transform Chip
Vetterli, M., & Ligtenberg, A. (1986) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.1986.1146289 · Cited by 110
Self-citation
Cited by
MMX technology extension to the Intel architecture
Peleg, A., & Weiser, U. (1996) · IEEE Micro · doi:10.1109/40.526924 · Cited by 499
Metadata
- Authors
- Loeffler, C., Ligtenberg, A., & Moschytz, G. S.
- Venue
- International Conference on Acoustics, Speech, and Signal Processing,
- Publisher
- IEEE
- Published
- 2003-01-13
- Pages
- 988-991
- OpenAlex
- W2158664566
- Cited by
- 646
- References
- 8
- FWCI
- 38.80
- Type
- conference paper
- 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: Practical fast 1-D DCT algorithms with 11 multiplications. https://app.cochat.ai/papers/10.1109/icassp.1989.266596
- The paper
- Loeffler, C., Ligtenberg, A., & Moschytz, G. S. (2003). Practical fast 1-D DCT algorithms with 11 multiplications. International Conference on Acoustics, Speech, and Signal Processing,. https://doi.org/10.1109/icassp.1989.266596
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.