Area Efficient VLSI Design with Cells of Controllable Complexity
暂无分享,去创建一个
[1] Richard P. Brent,et al. Some Area-Time Tradeoffs for VLSI , 1982, SIAM J. Comput..
[2] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[3] Thompson. The VLSI Complexity of Sorting , 1983, IEEE Transactions on Computers.
[4] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .
[5] Bernard Chazelle,et al. A Model of Computation for VLSI with Related Complexity Results , 1985, J. ACM.
[6] Bernard Chazelle,et al. Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[7] Mary Sheeran,et al. Designing Regular Array Architectures using Higher Order Functions , 1985, FPCA.
[8] S. Kung,et al. VLSI Array processors , 1985, IEEE ASSP Magazine.
[9] C. Thomborson,et al. A Complexity Theory for VLSI , 1980 .
[10] M. Pracchi,et al. A critique of network speed in VLSI models of computation , 1982, IEEE Journal of Solid-State Circuits.