By Topic

Flexible architectures for DCT of variable-length targeting shape-adaptive transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thuyen Le ; Inst. of Microelectron. Syst., Darmstadt Univ. of Technol., Germany ; M. Glesner

Shape-adaptive block-based texture coding schemes such as the shape-adaptive discrete cosine transform (SA-DCT) raise the need for an architecture which performs efficiently the transform of variable length N. For an implementation requiring standard DCT and SA-DCT, it is advantageous to have a VLSI architecture which can be configured to compute both schemes. Existing fast algorithms usually consider only the standard DCT of fixed-size length and lack regular structure leading to complex routing. This paper discusses two different architectures satisfying the given requirement in terms of scalability, modularity, and regularity. The first proposed architecture represents a time-recursive fully modular, but nonefficient, structure regarding the number of operation counts. The second proposed feedforward architecture overcomes problems of numerical instability found in time-recursive structure. Both architectures are modeled in VHDL and synthesized using an 0.7-μm two metal-layers CMOS technology for comparison. The design in VHDL is kept generic so that new SA-DCT cores can be easily generated to produce application tailored circuits

Published in:

IEEE Transactions on Circuits and Systems for Video Technology  (Volume:10 ,  Issue: 8 )