Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{144099,
        author = {T.Anitha and Sk.Masthan},
        title = {VLSI Computational Architectures for the Arithmetic Cosine Transform},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {3},
        number = {6},
        pages = {51-55},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=144099},
        abstract = {The discrete cosine transform (DCT) is a widely-used and important signal processing tool employed in a plethora ofapplications. Typical fast algorithms for nearly-exact computation of DCT require floating point arithmetic, are multiplier intensive, andaccumulate round-off errors. Recently proposed fast algorithm arithmetic cosine transform (ACT) calculates the DCT exactly using onlyadditions and integer constant multiplications, with very low area complexity, for null mean input sequences. The ACT can also becomputed non-exactly for any input sequence, with low area complexity and low power consumption, utilizing the novel architecturedescribed. However, as a trade-off, the ACT algorithm requires 10 non-uniformly sampled data points to calculate the eight-point DCT.This requirement can easily be satisfied for applications dealing with spatial signals such as image sensors and biomedical sensorarrays, by placing sensor elements in a non-uniform grid. In this work, a architecture for the computation of the null meanACT is proposed, followed by a novel architectures that extend the ACT for non-null mean signals. All circuits are synthesized using the Xilinx ISE.},
        keywords = {Discrete cosine transform, arithmetic cosine transform, fast algorithms, VLSI},
        month = {},
        }