Discrete Cosine Transform (DCT)

More documents

Recommendations

Info

DCT-III: f j = 1 2 x 0 + ∑ − n 1 k = 1 x k π cos[ ( j n Some authors further multiply the x 0 term by 1/ 2 , this makes the DCT-III matrix orthogonal (up to a scale factor), but breaks the direct correspondence with a real even DFT of half-shifted output. + 1 ) k] 2 8
DCT-IV: f j = ∑ − n 1 k = 0 x k π cos[ ( j n DCT-IV matrix is orthogonal (up to a scale factor). MDCT is based on DCT-IV with overlapped data. + 1 )( 2 k + 1 )] 2 9
Page 1 and 2: Discrete Cosine Transform (DCT) 1
Page 3 and 4: Two related transform are the discr
Page 5 and 6: Formulation: DCT is a linear and i
Page 7: DCT-II: f j = ∑ − n 1 k = 0 x k
Page 11 and 12: Inverse Transforms: IDCT-I is DCT-
Page 13 and 14: References: 1. Rao and Yip, Discre
Page 15 and 16: Then the 1-D DCT is applied to the
Page 17 and 18: 4 C u πu cos S 16 8 ( u) = 7 ∑ x
Page 19 and 20: We have the following DCT v.s. DFT
Page 21 and 22: Let X M = (f(0), f(1), f(2), f(3),
Page 23 and 24: F M = X M x (1/8)T M Because cosα
Page 25 and 26: 25 X M = F M x (8T M -1 ) = FM x L
Page 27 and 28: 27 ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥ ⎥
Page 29 and 30: 29 So the IDFT can be performed by
Page 31 and 32: 31 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ ⎪
Page 33: If you count the operations you wil

Discrete Cosine Transform (DCT)

Create successful ePaper yourself

Delete template?

Save as template?