IRE Trans. Electron. Comput.最新文献_第4页

A New Approach to Resistor-Transistor-Tunnel-Diode Nanosecond Logic 电阻-晶体管-隧道-二极管纳秒逻辑的新方法

IRE Trans. Electron. Comput. Pub Date : 1962-10-01 DOI: 10.1109/TEC.1962.5219428

W. Smith, A. Pohm

{"title":"A New Approach to Resistor-Transistor-Tunnel-Diode Nanosecond Logic","authors":"W. Smith, A. Pohm","doi":"10.1109/TEC.1962.5219428","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219428","url":null,"abstract":"A transistor amplifier with nonlinear tunnel-diode or backward-diode feedback is described for use as a resistor-coupled threshold logic circuit or general purpose switch. The tunnel-diode feedback serves to virtually eliminate saturation and prevent cutoff thus allowing the high gain-bandwidth products of epitaxial switching transistors to be utilized at all times during switching. Switching plus delay times as low as 2 nsec have been observed with a fan in and fan out of three. Ring oscillator experiments show that delays per stage from 2 to 5 nsec are easily obtained with logical gains of two or three. The input impedance of the network is 3 to 12 ohms leading to a very practical threshold network. The particular logic decision is determined only by the bias current. Tolerance calculations are presented that indicate component requirements will not be severe. The peak current is not a critical parameter and can easily vary 100 per cent. Due to the quantizing effect of the tunnel-diode feedback, circuits with fan ins and fan outs of three would operate satisfactorily under worst case conditions with 2 per cent resistors and mild restrictions on the transistor and diode parameters. By adding backward diodes in series with the input resistors the tolerance requirements can be relaxed to 10 per cent resistors and slight restrictions on the diodes or transistor parameters. By using backward diodes the fan in and fan out can be substantially increased with little loss in speed.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129181683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

A Mechanized Chart for Simplification of Switching Functions 转换函数简化的机械化图

IRE Trans. Electron. Comput. Pub Date : 1962-10-01 DOI: 10.1109/TEC.1962.5219441

A. K. Choudhury, M. Basu

引用次数: 6

A Decoder Scheme Using Magnetic-Core Matrices for Systematic Codes 基于磁芯矩阵的系统码解码器方案

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219405

M. Hsiao

引用次数: 0

Automatic Time-Mark Generation for Analog Computer Phase-Plane Trajectories 模拟计算机相平面轨迹的自动时间标记生成

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219400

Y. Blache

引用次数: 0

Computer Multiplication and Division Using Binary Logarithms 使用二进制对数的计算机乘法和除法

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219391

John N. Mitchell

引用次数: 317

Comments on "The Use of the Simplex Algorithm in the Mechanization of Boolean Switching Functions by Means of Magnetic Cores “单纯形算法在磁芯布尔切换函数机械化中的应用”述评

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219402

R. C. Minnick

引用次数: 0

The Reduction of Redundancy in Solving Prime Implicant Tables 解素数隐含表的冗余减少

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219386

I. B. Pyne, E. McCluskey

{"title":"The Reduction of Redundancy in Solving Prime Implicant Tables","authors":"I. B. Pyne, E. McCluskey","doi":"10.1109/TEC.1962.5219386","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219386","url":null,"abstract":"This paper is primarily concerned with finding, in the most efficient possible way, the set of all solutions to a cyclic prime implicant table. (A solution is a set of rows such that every column contains at least one marked entry in a row belonging to the set and such that no row can be deleted from the set without destroying this property.) Extensive use is made of the relationship between this and the problem of efficiently reducing a Boolean frontal function from the form of a product of sums of single literals to a sum of products. The transformation methods commonly in use today have the disadvantage that they tend to introduce duplicate and redundant products. (A redundant product includes at least one row which can be removed, and the remaining rows will still constitute a solution.) Several methods which appreciably reduce the number of such redundancies are presented. One of these methods (called row branching), applies repeatedly the algebraic transformation f = af(? = 1) + f(?= 0) where ? is the Boolean variable corresponding to a row of the table, and f is the function corresponding to the given table. The mechanism by which a redundant solution is generated is described. The paper includes other useful transformation procedures such as, for example, a tabular method in which redundancies are avoided systematically at each step.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127974996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 37

Rules to Manipulate Regular Expressions of Finite Automata 有限自动机正则表达式的操作规则

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219404

H. Ghiron

引用次数: 4

A Method for Evaluating Stieltjes Integrals on the Analog Computer 一种在模拟计算机上求Stieltjes积分的方法

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219395

T. Anderson

引用次数: 0

Encoding and Decoding for Cyclic Permutation Codes 循环置换码的编码与解码

IRE Trans. Electron. Comput. Pub Date : 1962-08-01 DOI: 10.1109/TEC.1962.5219390

Peter G. Neumann

引用次数: 3