2-D discrete cosine transforms on a fine grain array processor
暂无分享,去创建一个
Mary Jane Irwin | Robert Michael Owens | M. Borah | Heung-Nam Kim | R. Owens | M. Borah | M. Irwin | Heung-Nam Kim
[1] Mary Jane Irwin,et al. The Arithmetic Cube , 1987, IEEE Transactions on Computers.
[2] Mary Jane Irwin,et al. A micro-grained VLSI signal processor , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[3] B. Lee. A new algorithm to compute the discrete cosine Transform , 1984 .
[4] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..
[5] M. Liou,et al. A concurrent architecture for VLSI implementation of discrete cosine transform , 1987, IEEE Transactions on Circuits and Systems.
[6] N. Ahmed,et al. FAST TRANSFORMS, algorithms, analysis, applications , 1983, Proceedings of the IEEE.
[7] Ronald N. Bracewell. The Hartley transform , 1986 .
[8] N. Ahmed,et al. Discrete Cosine Transform , 1996 .
[9] Henrique S. Malvar. Fast computation of discrete cosine transform through fast Hartley transform , 1986 .
[10] Charles M. Rader,et al. Fast transforms: Algorithms, analyses, applications , 1984 .
[11] J. Makhoul. A fast cosine transform in one and two dimensions , 1980 .
[12] Robert Michael Owens,et al. A VLSI chip for the winograd/Prime factor algorithm to compute the discrete Fourier transform , 1986, IEEE Trans. Acoust. Speech Signal Process..
[13] Chaitali Chakrabarti,et al. Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition , 1990, IEEE Trans. Computers.