The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Practical fast 1-D DCT algorithms with 11 multiplications
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
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.>
How it got here
How it got here
agent via openalex
Added
2026-10-27 13:57 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{loeffler1989practical,
title = {Practical fast 1-D DCT algorithms with 11 multiplications},
author = {Charles M. Loeffler and A. Ligtenberg and G.S. Moschytz},
year = {1989},
journal = {IEEE International Conference on Acoustics Speech and Signal Processing},
pages = {988--991},
doi = {10.1109/icassp.1989.266596},
}