Zobrazeno 1 - 10
of 37
pro vyhledávání: '"D.L. Dietmeyer"'
Autor:
D.L. Dietmeyer, Feng Wang
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 17:772-781
Effective algorithms exist for synthesizing symmetric functions and for "ordinary" nonsymmetric functions. However, the existing methods have difficulties when the functions are not symmetric but are "close" to being symmetric. We formulate a set of
Autor:
D.L. Dietmeyer
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12:710-713
An algorithm is offered for generating minimum-cost, two-level expressions for totally symmetric, complete switching functions. The algorithms discussed were programmed in TurboPascal (and TurboC) and executed on an IBM PS/2-80. Many symmetric switch
Autor:
Y. Chu, F.J. Hill, D.L. Dietmeyer, B. Johnson, G. Ordy, C.W. Rose, M. Roberts, J.R. Duley, M.R. Barbacci
Publikováno v:
IEEE Design & Test of Computers. 9:69-81
Current hardware description languages (HDLs) benefit from the efforts of designers of hardware description languages dating back to the mid 1960s. The developers of six HDLs discuss their motivations and their views of how their work relates to the
Autor:
D.L. Dietmeyer, Bo-Gwan Kim
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 11:142-157
The authors offer extended algebraic operations and strategies for se in algebraic approaches. A novel cube/array representation that directly shows some legal expressional variations from a minimal expression written in the conventional three symbol
Autor:
B.-G. Kim, D.L. Dietmeyer
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10:436-446
Designs of totally symmetric functions provided by logic synthesis systems have on average more than twice as many literals as best designs, while the designs of nonsymmetric functions have on average 20% more literals. A simple, but effective, heuri
Autor:
D.L. Dietmeyer
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 6:892-902
Wislan is a language for describing computer hardware at the gate and functional levels of abstraction. After converting a WISLAN description to a gate table data structure, users interactively apply local transformations to that network to transform
Autor:
R.R. Hackbart, D.L. Dietmeyer
Publikováno v:
IEEE Transactions on Computers. :184-189
Armstrong et al.[1] have shown how critical races and function hazards can be suppressed in asynchronous sequential circuits by using gate delays to advantage rather than introducing explicit delay elements, if certain delay assumptions are satisfied
Autor:
D.L. Dietmeyer, J.R. Duley
Publikováno v:
IEEE Transactions on Computers. :850-861
—Successful design and manufacture of future digital systems will depend upon the availability of a suitable design language. A precise, concise language is presented which facilitates the specification of complex digital systems. The language 1) i
Autor:
D.L. Dietmeyer, Yueh-Hsung Su
Publikováno v:
IEEE Transactions on Computers. :58-63
An algorithm which reduces the number of gates and connections (diodes) in two-level, multiple-output combinational logic networks is presented and compared with conventional minimization procedures.
Autor:
D.L. Dietmeyer, Yueh-Hsung Su
Publikováno v:
IEEE Transactions on Computers. :11-22
Factoring techniques are incorporated in computer-oriented algorithms for the synthesis of fan-in limited NAND switching networks. Tree networks with reduced gate count or levels of logic are sought. While example FORTRAN programs emphasize computer