Article View: comp.compression.research
Article #18DCT Sources/References
From: Chua Tai Wei
Date: Sun, 02 Aug 1992 05:58
Date: Sun, 02 Aug 1992 05:58
81 lines
3282 bytes
3282 bytes
Summary
-------
With regards to my earlier request for source code and references on DCT
related stuff, I would like to thank all the contributors.
Probably the most significant source for DCT code would be the JPEG source
code available from ftp.uu.net in the directory graphics/jpeg. In the FAQ
list for comp.compression, a site avahi.inria.fr, directory /pub/h261,
contains a software implementation of the H.261 codec.
With regards to references, Tom Lane (Tom_Lane@G.GP.CS.CMU.EDU) provides a
very comprehensive list:
Polynomial Transform Computation of the 2-D DCT, Duhamel & Guillemot,
ICASSP '90 p. 1515.
A Forward-Mapping Realization of the Inverse DCT, McMillan & Westover,
DCC '92 p. 219.
A Fast Algorithm for 2-D DCT, Cho, Yun & Lee, ICASSP '91 p. 2197.
Fast Algorithm and Implementation of 2-D DCT, Cho & Lee,
Tr. CAS v38 p. 297.
A DCT Chip based on a new Structured and Computationally Efficient DCT
Algorithm, Duhamel, Guillemot & Carlach, ICCAS '90 p. 77.
Trade-offs in the Computation of Mono- and Multi-dimensional DCTs,
Vetterli, Duhamel & Guillemot, ICASSP '89 p. 999.
Practical Fast 1-D DCT Algorithms with 11 Multiplications,
Loeffler, Ligtenberg & Moschytz, ICASSP '89 p. 988.
New Scaled DCT Algorithms for Fused Multiply/Add Architectures,
Linzer & Feig, ICASSP '91 p. 2201.
Fast Algorithms for the 2-D Discrete Cosine Transform, Kamangar & Rao,
IEEE Tr. Computers, v C-31 p. 899.
Fast 2-D Discrete Cosine Transform, Vetterli, ICASSP '85 p. 1538.
A Two-Dimensional Fast Cosine Transform, Haque, Tr. ASSP v ASSP-33
p. 1532.
Real-Time Parallel and Fully Pipelined 2-D DCT Lattice Structures with
Application to HDTV Systems, Chiu & Liu, Tr. CAS for Video Tech,
v 2 p. 25.
Tom Lane also highlights the Loeffler paper as one with the best algorithm.
Peter Freed (pfreed@rp.CSIRO.AU) also recommends a book:
"Signal Processing with Lapped Transforms"
by Henrique S Malvar(Artech House 1992)
and an article:
Narasimha M.J. & A.M. Peterson "On the Computation of the
Discrete Cosine Transform", IEEE Trans Commun., vol COMM 25, Sep
1977, pp 1004-1009
featuring DCT stuff.
F Dudbridge (eesfd@gdr.bath.ac.uk) indicated that his colleagues B.Sherlock
& D.Monro are also working on DCT algorithms.
I hope I did not miss out any important references.... drop me an email should
anyone has more to add ...
has more to add...
Thanks again.......
Technical Details
Message-ID:
<1992Aug2.055820.5672@iti.gov.sg>Path:
arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!jvnc.net!nuscc!iti.gov.sg!taiweiShow Full Headers
Complete Article Headers
Newsgroups: comp.compression.research Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!jvnc.net!nuscc!iti.gov.sg!taiwei From: taiwei@iti.gov.sg (Chua Tai Wei) Subject: DCT Sources/References Message-ID: <1992Aug2.055820.5672@iti.gov.sg> Summary: DCT sources/algorithms Keywords: DCT Sender: news@iti.gov.sg (News Admin) Organization: Information Technology Institute, National Computer Board, S'pore Date: Sun, 2 Aug 1992 05:58:20 GMT Lines: 82