Referenced Items are not available for this document.
This paper is concerned with optimal synthesis of switching logic by a limited depth tree-like network, the NAND cascade. This cascade consists of a number of complete three-level, fan-in restricted NAND trees feeding a NAND collector. The goal of the proposed synthesis is to minimize the number of NAND trees of the cascade, which in turn will minimize its overall depth, i.e., the delay time of the cascade.
Published in:
Computers, IEEE Transactions on
(Volume:C-27
,
Issue:
12
)
Date of Publication: Dec. 1978
- Page(s):
- 1099 - 1111
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/TC.1978.1675012
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 August 2006
- Issue Date :
- Dec. 1978
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
