A System for Designing, Simulating, and Testing High Performance VLSI Signal Processors
暂无分享,去创建一个
[1] Daniel E. Atkins,et al. Introduction to the Role of Redundancy in Computer Arithmetic , 1975, Computer.
[2] T. Parks,et al. A prime factor FFT algorithm using high-speed convolution , 1977 .
[3] Milos D. Ercegovac,et al. On-Line Algorithms for Division and Multiplication , 1977, IEEE Transactions on Computers.
[4] Neil W. Bergmann,et al. A Case Study of the F.I.R.S.T. Silicon Compiler , 1983 .
[5] Stephen C. Johnson. Code generation for silicon , 1983, POPL '83.
[6] S. Winograd. On the multiplicative complexity of the Discrete Fourier Transform , 1979 .
[7] Alvin M. Despain,et al. Very Fast Fourier Transform Algorithms Hardware for Implementation , 1979, IEEE Transactions on Computers.
[8] 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..
[9] Robert W. Brodersen,et al. Macrocell Design for Concurrent Signal Processing , 1983 .
[10] Mary Jane Irwin,et al. Fully Digit On-Line Networks , 1983, IEEE Transactions on Computers.
[11] J. Cooley,et al. New algorithms for digital convolution , 1977 .
[12] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .
[13] F. Anceau. CAPRI: A Design Methodology and a Silicon Compiler for VLSI Circuits Specified by Algorithms , 1983 .
[14] Dave Johannsen,et al. Bristle Blocks: A Silicon Compiler , 1979, 16th Design Automation Conference.
[15] S. Winograd. On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.
[16] Harvey F. Silverman,et al. A method for programming the complex general-N Winograd Fourier transform algorithm , 1977 .