Completely-pipelined architectures for digital signal processing
暂无分享,去创建一个
[1] F. Leighton. New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[2] Andrea S. LaPaugh,et al. A polynomial time algorithm for optimal routing around a rectangle , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[3] Jean Vuillemin,et al. A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[5] Peter R. Cappello,et al. Optimal choice of intermediate latching to maximize throughput in VLSI circuits , 1983, ICASSP.
[6] Richard J. Lipton,et al. Programming aspects of VLSI: (preliminary version) , 1982, POPL '82.
[7] Sun-Yuan Kung,et al. Highly parallel architectures for solving linear equations , 1981, ICASSP.
[8] John V. McCanny,et al. BIT-LEVEL SYSTOLIC ARRAYS. , 1984 .
[9] H. T. Kung,et al. The Area-Time Complexity of Binary Multiplication , 1981, JACM.
[10] Peter R. Cappello,et al. A VLSI layout for a pipelined Dadda multiplier , 1983, TOCS.
[11] Peter R. Cappello,et al. Some intractable problems in digital signal processing , 1981, ICASSP.
[12] Jean Vuillemin,et al. A Combinatorial Limit to the Computing Power of VLSI Circuits , 1983, IEEE Transactions on Computers.
[13] H. T. Kung. VLSI Systems and Computations , 1982 .
[14] Charles E. Leiserson,et al. Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.
[15] Richard J. Lipton,et al. Programming Aspects of VLSI. , 1982 .
[16] C. Rader. Discrete Fourier transforms when the number of data samples is prime , 1968 .