Download presentation
Presentation is loading. Please wait.
Published byCurtis McKinney Modified over 9 years ago
1
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU A New Algorithm to Compute the Discrete Cosine Transform VLSI Signal Processing 台灣大學電機系 吳安宇 1. B. G. Lee “A new algorithm to compute the discrete cosine trnsform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp.1243-1245, Dec. 84 2. W. H. Chen, C. H. Smith, and S. C. Fralick, “A fast computational algorithm for the discrete cosine transform,” IEEE Trans. Commun., vol. COM-25, pp.1004-1009, Sept. 77
2
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT – Decomposing into even and odd indexes of n, we define
3
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Rearrange for Decimation in Time – Using the trigonometric identity to rearrange
4
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT Decomposed into N/2-Point IDCT
5
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU N-Point IDCT Architecture Take transpose form, we can obtain DCT architecture
6
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Sample : 8-Point IDCT
7
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Complexity Comparison
8
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Unified Parallel Lattice Structures for Time-Recursive Discrete Cosine/Sine/Hartley Transform VLSI Signal Processing 台灣大學電機系 吳安宇 1. K. J. R. Liu and C.T. Chiu “Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transform,” IEEE Trans. Signal Processing,vol. SP-41, pp. 1357-1377, March 93.
9
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU DCT Definition
10
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time-Recursive DCT – DCT at time t – Decompose in and DCT at time (t+1) (See Fig. 1)
11
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU DST Definition
12
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time-Recursive DCT – DST at time t – Decompose in and DST at time (t+1) (See Fig. 1)
13
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Hardware Architecture
14
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Time Recursive Relationship The relationship between the and the data sequence
15
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Overall Architecture
16
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Special Case for k=0 for the DCT and k=N for the DST
17
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU The parallel lattice structure for DCT and DST
18
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Architecture Comparison Architectural Comparison LeeOur approach I/O Operation Architecture Communication Hardware cost Operating frequency PIPO Modular Global Large, O(Nlog 2 N) f s / N SIPO Modulare and Regular Local Small, O(N) f s f s : Input data rate 1. K. J. R. Liu and C.T. Chiu “Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transform,” IEEE Trans. Signal Processing, vol. SP-41, pp. 1357-1377, March 93. 2. B. G. Lee “A new algorithm to compute the discrete cosine trnsform,”, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp.1243-1245, Dec. 84
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.