| Summary: | 碩士 === 國立中山大學 === 資訊工程研究所 === 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 Kronecker product representation, the multi-dimensional operation is converted into its corresponding 1-D problem. The resulted matrix decomposition is realized by a cascade of several basic computation blocks with each block implemented by hardware-efficient architecture. Then the VLSI implementation with linear-array architecture has advantages of regularity, modularity, locality, low-cost, low-power and high-throughput.
|
|---|
