Design and Implementation of Multidimensional Discrete Transforms on Low-Cost Pipelinable Linear-Array Architecture
碩士 === 國立中山大學 === 資訊工程研究所 === 87 === The fast recursive algorithms for various N-point discrete transforms including discrete Fourier transform (DFT) and discrete cosine transform (DCT) with complexity of O(NlogN) are proposed by efficient matrix factorization. By exploiting the features of Kronecke...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85690851475981789843 |