ACM Home Page
Please provide us with feedback. Feedback
An overview of the Penn State design system
Full text PdfPdf (841 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 24th ACM/IEEE Design Automation Conference table of contents
Miami Beach, Florida, United States
Pages: 516 - 522  
Year of Publication: 1987
ISBN:0-8186-0781-5
Authors
R. M. Owens  Department of Computer Science, Penn State University, University Park, PA
M. J. Irwin  Department of Computer Science, Penn State University, University Park, PA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 8,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/37888.37965
What is a DOI?

ABSTRACT

This paper overviews a CAD system under development at Penn State which will allow fast and near optimal implementation of a restricted class of VLSI architectures. Our target architectures are hierarchical mesh extensions of systolic meshes. Our target applications are primarily in the signal processing domain. The primitive components, at the lowest level in the mesh hierarchy, are one of the unique features of our target architectures. The CAD system under development includes: a tool for target architecture decomposition into primitive components, a tool for multi-level logic reduction for the primitive components; a tool for automatic gate placement within a primitive component; a tool for component placement within the target architecture; a high-level simulation tool; and a layout verification tool.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Ba
Barrow, H. G., "Proving the Correcmess of Digital Hardware Designs," VLSI Design, pp. 64-77, July 1984.
BOI
 
BCAD
Berkeley CAD Tools User's Manual, Scott, Hamachi, Mayo, and Ousterhout, eds., Computer Science Division, UCB, 1986.
 
Br
Bryant, R., "Symbolic Verification of MOS Circuits," Proc. of the 1985 Chapel Hill Conf. on VLSI, pp. 419-438, 1985.
 
DR
 
IO
 
Ir
Irwin, M.J., "A Digit Pipelined Dynamic Time Warp Processor," CS-86-23, PSU, Aug. 1986.
 
KGV
Kirkpatrick, S., C.D. Gelatt, M.P. Vecchi, "Optimization by Simulated Annealing," Science, 220(4598), pp. 671-680, May 1983.
 
Ku
Kung, H.T., "Let's Design Algorithms for VLSI Systems," Proc of the First Caltech Conf. on VLSI, pp. 65-90, Jan. 1979.
 
Ly
Lyons, R., "A Bit-Serial VLSI Architectural Methodology for Signal Processing," VLSI '81, Gray, ed., Academic Press, 1981.
 
MIO
Mackowiak, T., M.J. Irwin, and R.M. Owens, "The Arithmetic Cube Digital Signal Processor," GOMAC-86 Digest, CA, Nov. 1986.
 
Nu
Nussbaumer, H.J., Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, 1982.
 
OI1
 
OI2
Owens, R.M. and M.J. Irwin, "An Area Efficient VLSI FIR Filter," in VLSI Signal Processing, II, Kung, Owen, Nash, eds., IEEE Press, 1986.
 
OI3
Owens, R.M. and M.J. irwin, "A System for Designing, Simulating, and Testing High Performance VLSI Signal Processors," IEEE Trans. on CAD, CAD-5(3), pp. 420-428, July 1986.
 
FPO
Fuh, S-Y, C. Pun, and R.M. Owens, "ARTIST: A Silicon Compiler for Mesh Arrays," CS-86-31, PSU, Nov. 1986.
 
Re
Reeves, D. S., "Verification of MOS Circuits at the Switch Level," Ph.D. Thesis, CS-87-12, PSU, April 1987.
 
RI1
Reeves, D. S. and Irwin, M. J., "Functional Verification of Digi.tal MOS Circuits," Proc. of ICCAD-86, CA, Nov. 1986.
 
RI2
Rawat, S. and M.J. Irwin, "On the C-Testability of Sequential Arrays," submitted to FTCS-17, Dec. 1986.
 
SH
Sridhar, T. and J. Hayes, "Design of Easily Testable Systems," IEEE Trans. on Computers, C-30(11), pp. 842-854, Nov. 1981.
 
Wi
Winograd, S, "On Computing the Discrete Fourier Transform," Math Computing, 32, pp. 175-195, 1978.


Collaborative Colleagues:
R. M. Owens: colleagues
M. J. Irwin: colleagues