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.
New 2^n DCT algorithms suitable for VLSI implementation
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
Small length Discrete Cosine Transforms (DCT's) are used for image data compression. In that case, length 8 or 16 DCT's are needed to be performed at video rate. We propose two new implementation of DCT's which have several interesting features, as far as VLSI implementation is concerned. A first one, using modulo-arithmetic, needs only one multiplication per input point, so that a single multiplier is needed on-chip. A second one, based on a decomposition of the DCT into polynomial products, and evaluation of these polynomial products by distributed arithmetic, results in a very small chip, with a great regularity and testability. Furthermore, the same structure can be used for FFT computation by changing only the ROM-part of the chip. Both new architectures are mainly based on a new formulation of a length-2nDCT as a cyclic convolution, which is explained in the first section of the paper.
How it got here
How it got here
agent via openalex
Added
2026-10-27 13:51 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{duhamel1987new,
title = {New 2^n DCT algorithms suitable for VLSI implementation},
author = {Pierre Duhamel and H. H'Mida},
year = {1987},
journal = {IEEE International Conference on Acoustics Speech and Signal Processing},
volume = {12},
pages = {1805--1808},
doi = {10.1109/icassp.1987.1169491},
}
This record lives at https://refs.drheap.org/duhamel1987new/ and will keep
doing so. It used to be called duhamel20052sup, and those addresses still resolve to this one.