Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/800073.802335acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free access

A computer-aided-design system for segmented-folded PLA macro-cells

Published: 29 June 1981 Publication History

Abstract

A PLA structure incorporating segmenting and folding features intended for use as a macro-cell for VLSI applications is described. A brief outline of a computer-aided-design system for the layout synthesis of such PLAs is given. The objectives are the attainment of compact area, low design time, and ease of design Symbolic layout generation for the PLA is treated in detail and practical design algorithms for partitioning and folding are discussed. An example is used to illustrate currently achievable results.

References

[1]
D. L. Dietmeyer and M. H. Doshi, "Automated PLA Synthesis of the Combinational Logic of a DDL Description", Design Automation & Fault-Tolerant Computing., vol. 3, issue 3/4, pp. 241-257.
[2]
H. Fleisher and L. Maissel, "Introduction to Array Logic", IBM J. Res. Devlp. vol. 19, 1975, p. 98.
[3]
D. L. Greer, "An Associative Logic Matrix", IEEE J. of Solid State Circuits, vol. SC-11, Oct. 1976.
[4]
G. D. Hachtel, A. L. Sangiovanni-Vincentelli, and A. R. Newton, "Some Results in Optimal PLA Folding", Proc. ICCC, Oct. 1980, pp. 1023-1027.
[5]
S. J. Hong, R. G. Cain, and D. L. Ostapko, "MINI: A Heuristic Approach for Logic Minimization", IBM J. Res. Devlp., vol. 18, Sept. 1974, pp. 443-457.
[6]
C. Mead and L. Conway, "Introduction to VLSI Systems", Addison-Wesley, 1980.
[7]
J. P. Roth, "Programmed Logic Array Optimization", IEEE Trans. on Comp., vol. C-27, Feb. 1978, pp. 174-176.
[8]
R. Wood, "A High Density Programmable Logic Array Chip", IEEE Trans. on Computers., vol. C-28, Sept. 1979, pp. 602-608.

Cited By

View all
  • (1994)On the equivalence of pull-up transistor assignment in PLA folding and distribution graphProceedings of the 1994 ACM symposium on Applied computing10.1145/326619.326783(374-378)Online publication date: 6-Apr-1994
  • (1988)Pleasure: a computer program for simple/multiple constrained unconstrained folding of programmable logic arraysPapers on Twenty-five years of electronic design automation10.1145/62882.62913(263-270)Online publication date: 1-Jun-1988
  • (1987)Improving a PLA area by pull-up transistor foldingProceedings of the 24th ACM/IEEE Design Automation Conference10.1145/37888.37984(608-614)Online publication date: 1-Oct-1987
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '81: Proceedings of the 18th Design Automation Conference
June 1981
899 pages

Sponsors

Publisher

IEEE Press

Publication History

Published: 29 June 1981

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)5
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (1994)On the equivalence of pull-up transistor assignment in PLA folding and distribution graphProceedings of the 1994 ACM symposium on Applied computing10.1145/326619.326783(374-378)Online publication date: 6-Apr-1994
  • (1988)Pleasure: a computer program for simple/multiple constrained unconstrained folding of programmable logic arraysPapers on Twenty-five years of electronic design automation10.1145/62882.62913(263-270)Online publication date: 1-Jun-1988
  • (1987)Improving a PLA area by pull-up transistor foldingProceedings of the 24th ACM/IEEE Design Automation Conference10.1145/37888.37984(608-614)Online publication date: 1-Oct-1987
  • (1984)A branch and bound algorithm for optimal pla foldingProceedings of the 21st Design Automation Conference10.5555/800033.800833(426-433)Online publication date: 25-Jun-1984
  • (1984)PleasureComputer-Aided Design10.1016/S0010-4485(84)80002-016:1(2-12)Online publication date: 1-Jan-1984
  • (1983)PLEASUREProceedings of the 20th Design Automation Conference10.5555/800032.800719(530-537)Online publication date: 27-Jun-1983
  • (1983)APSSProceedings of the 20th Design Automation Conference10.5555/800032.800703(430-435)Online publication date: 27-Jun-1983
  • (1982)A layout synthesis system for NMOS gate-cellsProceedings of the 19th Design Automation Conference10.5555/800263.809222(307-314)Online publication date: 1-Jan-1982
  • (1982)Optimal bipartite folding of PLAProceedings of the 19th Design Automation Conference10.5555/800263.809199(141-146)Online publication date: 1-Jan-1982
  • (1982)A depth-first branch-and-bound algorithm for optimal PLA foldingProceedings of the 19th Design Automation Conference10.5555/800263.809198(133-140)Online publication date: 1-Jan-1982

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media