VLSI Computational Architectures for the Arithmetic Cosine Transform
Author(s):
T.Anitha, Sk.Masthan
Keywords:
Discrete cosine transform, arithmetic cosine transform, fast algorithms, VLSI
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.
Article Details
Unique Paper ID: 144099

Publication Volume & Issue: Volume 3, Issue 6

Page(s): 51 - 55
Article Preview & Download


Share This Article

Join our RMS

Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Call For Paper

Volume 10 Issue 10

Last Date for paper submitting for March Issue is 25 June 2024

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews