Fast Algorithms for the Recursive Computation of Two-Dimensional Discrete Cosine Transform
碩士 === 國立臺灣科技大學 === 電子工程技術研究所 === 86 === This thesis presents an efficient algorithm for computingthe two-dimensional discrete cosine transform (2-D DCT) of size p^r ×p^r, where p is a prime. Based on a generalized 2-D to one-dimensional (1-D) index mapping scheme, the proposedalgorithm decomposes t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15341230838786539253 |