High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Feng Zhou Articles by Peter Kornerup

12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95)

Bath, England

July 19-July 21

ISBN: 0-8186-7089-4

	ASCII Text	x
	Feng Zhou, Peter Kornerup, "High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm," Computer Arithmetic, IEEE Symposium on, pp. 180, 12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95), 1995.

	BibTex	x
	@article{ 10.1109/ARITH.1995.465361, author = {Feng Zhou and Peter Kornerup}, title = {High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm}, journal ={Computer Arithmetic, IEEE Symposium on}, volume = {0}, year = {1995}, issn = {1063-6889}, pages = {180}, doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.1995.465361}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Arithmetic, IEEE Symposium on TI - High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm SN - 1063-6889 SP EP A1 - Feng Zhou, A1 - Peter Kornerup, PY - 1995 VL - 0 JA - Computer Arithmetic, IEEE Symposium on ER -

Feng Zhou, Odense University

Peter Kornerup, Odense University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1995.465361

This paper describes DCT (IDCT) computations using the CORDIC algorithm. By rewriting the DCT, for a 1*8 DCT only 6 CORDIC computations are needed, whereas a 1*16 DCT requires 22 CORDIC computations. But these can all be pipelined through a single CORDIC unit, so 16*16 DCT's becomes feasible for HDTV compression. Only some simple adders, registers and a more complicated carry look-ahead adder are needed, and the computing speed can be very high. Limited only by the delay of a carry look-ahead adder, the delay time of the pipelined structure is 2-10ns and the data rate is 100-500MHz for an 8*8 DCT/IDCT and 72.2-366.6MHz for a 16*16 DCT/IDCT when using two units.

Citation:

Feng Zhou, Peter Kornerup, "High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm," arith, pp.180, 12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.