6
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Efficient Systolic Architecture for Implementation of 2-D Discrete Cosine Transform

&
Pages 173-178 | Published online: 26 Mar 2015

REFERENCES

  • L W Chang & M C Wu, A unified systolic array for discrete cosine and sine transforms, IEEE Trans Signal Processing, vol 39, pp 192–193, 1991.
  • N Ahmed, T Natarajan & K R Rao, Discrete consine transform, IEEE Trans Comput, vol C-23, pp 90–93, 1974.
  • R J Clarke, Relation between the Karhunen-Loeve and cosine transforms, IEE Proc, vol 128, Pt F, no 6, pp 359–360, 1981.
  • M J Narasimha & A M Peterson, On the computation of discrete cosine transform, IEEE Trans Commun, vol COM-26. pp 934–936, 1978.
  • J Makhoul, A fast cosine transform in one and two dimensions, IEEE Trans Acoust Speech, Signal Processing, vol ASSP-28. pp 27–34, 1980.
  • W Li, A new algorithm to compute the DCT and its inverse, IEEE Trans Signal Processing, vol 39, pp 1305–1313, 1991.
  • M T Heidman, Computation of an odd-length DCT from a real-valued DFT of the same length, IEEE Trans Signal Processing, vol 40, pp 54–61, 1992.
  • P Duhamel & C Guillemot, Polynomial transform computation of 2-D DCT, Proc ICASSP-90, pp 1515–1518, 1990.
  • N I Cho & S U Lee, Fast algorithm and implementation of 2-D discrete cosine transform, IEEE Trans Circuit and Syst, vol CAS-38, pp 297–305, 1991.
  • N I Cho, D Yun & S U Lee, On regular structure for the fast 2-D DCT algorithm, IEEE Trans, Circuits and Systems-II, Analog and Digital Signal processing, vol 40, pp 259–266, 1993.
  • S Y Kung, H J Whitehouse & T Kailath, VLSI and modern signal processing, Englewood Cliffs, NJ Prentice-Hall, 1985.
  • S Y Kung, VLSI array processors, Englewood Cliffs, NJ, Prentice-Hall, 1988.
  • H T Kung, Why systolic architecture? IEEE Computer, pp 37–46, 1982.
  • N I Cho & S U Lee, DCT algorithms for VLSI parallel implementations, IEEE Trans, Acoust Speech, Signal Processing, vol ASSP-38, pp 121–127, 1990.
  • M A Bayoumi, GA Jullin & W C Millar, A VLSI array for computing DFT based on RNS, Proc Int Conf on Acoustics, Speech Signal Processing, pp 2147–2150, 1986.
  • R M Owens & J Ja'Ja', A VLSI chip for the Winograd/Prime factor algorithm to compute the discrete Fourier transform, IEEE Trans Acoust Speech Signal Processing, vol ASSP-34, pp 979–989, 1986.
  • C Chakrabarti & J Ja‘Ja’, Systolic architecture for the computation of the discrete Hartley and the discrete cosine transforms based on prime factor decomposition, IEEE Trans Comput vol C-39, pp 1359–1368, 1990.
  • J I Guo, C M Liu & C W Jen, A new array architecture for prime-length discrete cosine transform, IEEE Trans Signal Processing, vol 41, pp 436–442, 1993.
  • P Z Lee & F Y Huang, An efficient prime factor algorithm for discrete cosine transform and its hardware implementations, IEEE Trans Signal Processing, vol 42, pp 1996–2005, 1994.
  • M T Sun, T C Chen & A M Gottlieb, VLSI implementation of a 16 × 16 discrete cosine transform, IEEE Trans Circuits and Systems, vol 36, pp 610–617, 1989.
  • J Canaris, A VLSI architecture for real time computation of discrete trigonometric transforms, J VLSI Signal Processing, vol 5, no 1. pp 95–104, 1993.
  • G Goertzel, An algorithm for the evaluation of finite trigonometric series, Amer Math Monthly, vol 65, pp 34–35, 1958.
  • L P Chau & W C Siu, Recursive algorithm for the discrete cosine transform with general length, Electron Lett, vol 30, no 3, pp 197–198. 1994, Errata: vol 30, no 7, p 608.
  • L P Chau & W C Siu, Direct formulation for the realisation of discrete cosine transform using recursive structure, IEEE Trans Circuits and Systems-II: Analog and Digital Signal Processing, vol 42, no 1, pp 50–53, 1995.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.