By Topic

Electronic Computers, IEEE Transactions on

Issue 6 • Date Dec. 1965

Filter Results

Displaying Results 1 - 25 of 65
  • [Front cover]

    Publication Year: 1965 , Page(s): c1
    Request Permissions | PDF file iconPDF (561 KB)  
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1965 , Page(s): nil1
    Request Permissions | PDF file iconPDF (138 KB)  
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1965 , Page(s): nil1
    Request Permissions | PDF file iconPDF (138 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1965 , Page(s): 767
    Request Permissions | PDF file iconPDF (113 KB)  
    Freely Available from IEEE
  • Some New Results on the Convergence, Oscillation, and Reliability of Polyfunctional Nets

    Publication Year: 1965 , Page(s): 769 - 781
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2469 KB)  

    The properties of m×1 homogeneous polyfunctional nets under iteration (a growth process in which each element is replaced by a copy of the original net) are explored in considerable detail. Theorems are proved which relate the sequence of sets of output functions of a net to its structure as well as to the set of functions performed by the elements of the net. A complete characterization with res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Tests for the Linearity of Sequential Machines

    Publication Year: 1965 , Page(s): 781 - 786
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (967 KB)  

    This paper describes two tests for the existence of a linear state assignment for binary input sequential machines. The first test is based on ``transfer sequences'' which map one stationary state of a machine onto another stationary state. It is shown that from a minimal transfer sequence of a machine one can read off directly a linear assignment of this machine if one exists. The second test use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Logic and its Application to the Synthesis of Finite Automata

    Publication Year: 1965 , Page(s): 786 - 791
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (904 KB)  

    Three logic functions are introduced, two of which are functions in two-variables, named sequential logic product and sequential logic sum, while the third, depending on only one variable, is termed sequential logic negation. An algebraic theory is developed for logic processes where time plays an essential part; the connection is pointed out between sequential logic and the algebraic theory of mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Realizability of Special Classes of Autonomous Sequential Networks

    Publication Year: 1965 , Page(s): 791 - 797
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1174 KB)  

    A procedure for testing the realizability of complete 2n-state directed graphs by means of n-stage synchronous autonomous sequential networks of particular types, supplying at the same time state assignments pertaining to realizations of a specified class, is described. The analysis is confined to decomposed and linear networks, although the outlined method, based on the matrix represen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction [to "An algorithm for selecting an optimal set of diagnostic tests"]

    Publication Year: 1965 , Page(s): 797
    Request Permissions | Click to expandAbstract | PDF file iconPDF (195 KB)  

    H.Y. Chang, author of the paper, "An Algorithm for Selecting an Optimal Set of Diagnostic Tests," which appeared on pages 706-711 of the October, 1965, issue of these Transactions, has noted corrections needed on page 707, left column, line 19, and on page 709, right column, fourth line of step 3). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compound Synthesis of Threshold-Logic Network for the Realization of General Boolean Functions

    Publication Year: 1965 , Page(s): 798 - 814
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2499 KB)  

    This paper deals with the problem of compound synthesis of threshold-logic network, or of realizing a general Boolean function with a number of threshold-logic elements. Some basic theorems concerning the expression of a general Boolean function as a combination of a number of threshold functions are presented. The general structure of a network of m threshold-logic elements is analyzed in light o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Group-Theoretical Approach to Two-Rail Cascades

    Publication Year: 1965 , Page(s): 815 - 822
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1389 KB)  

    A two-rail cascade is a one-dimensional binary logic cellular array wherein each noninitial cell has two inputs from the preceding cell and one external input. The initial cell has three external inputs, and the last cell one or two external outputs. The interest in two-rail cascades is due to the fact that one-output two-rail cascades are known to be functionally complete. This paper is concerned... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code Transformation in Sequential Machines

    Publication Year: 1965 , Page(s): 822 - 829
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1053 KB)  

    This paper describes an algebraic method for determining the effect produced on the logical structure of a synchronous, delay-memory sequential machine by a transformation of input, output, and state coding. The logical structure of a combinational transducer is specified by a 0, 1 ``pseudopermutation'' array called a logic matrix. Procedures are developed for computing the logic matrices for seri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Determination of the ps Maximal Implicants of a Switching Function

    Publication Year: 1965 , Page(s): 830 - 840
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1974 KB)  

    ``ps maximal implicant'' of a function T is every function F having the following properties: 1) F implies TX; 2) the cost of the minimal ``product of sums of literals'' expression of F (psMF) is inferior to the cost of the minimal ``product of sums of literals'' of T (psMT); 3) no function V, implying T and implied by F, has a ps expression whose cost is inferior to the cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Tree Circuits

    Publication Year: 1965 , Page(s): 841 - 851
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1298 KB)  

    This article is primarily concerned with means for finding economical tree circuit realizations¿iterative applications of decompositions f(xn, xn-1,..., x1) = Fi(Gi(xn, xn-1,..., x¿i,..., x1), Hi,(xn, xn-1,..., x¿i,..., x1), xi) and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Canonical Form and Synthesis of Cellular Cascades

    Publication Year: 1965 , Page(s): 852 - 862
    Cited by:  Papers (22)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1982 KB)  

    Cascades of two-input, one-output general function cells have been studied previously with the restriction that no external variable may drive more than one cell. Upon relaxing this restriction, it is shown that a variable that drives more than one cell in a cascade need never drive more than one cell that is not an EXCLUSIVE-OR cell, and that cell must be the first cell driven by the variable in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of the Base Two Logarithm of Binary Numbers

    Publication Year: 1965 , Page(s): 863 - 867
    Cited by:  Papers (56)  |  Patents (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (733 KB)  

    An approximation to the computation of the base two logarithm of a binary number, realized with binary circuitry, is described. It is known that the logarithm can be obtained approximately from the binary number itself by simple counting and shifting. A method for the reduction of the resulting approximation error by a factor six is given. The same principle can be used for further reduction of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computer-Oriented Factoring Algorithm for NOR Logic Design

    Publication Year: 1965 , Page(s): 868 - 874
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1263 KB)  

    Because transistor NOR gates allow only a liitmed number of inputs, NOR equations must be factored before they can be implemented. An easily programmed algorithm is developed which rapidly generates a subset of factors, selects optimum factors, and indicates a realization for the factored equation based on the relation A ¿ B ¿ C ¿ D = [(A ¿ B) ¿] ¿ C ¿ D. A method for preventing excessive f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnection and Noise Immunity of Circuitry in Digital Computers

    Publication Year: 1965 , Page(s): 875 - 880
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (915 KB)  

    This paper describes the mutual dependence of interconnection and noise immunity in digital circuitry. Utilizing the charge control concept, the static thresholds of a transistor are defined in terms of the saturation charge and the depletion layer charge. These are subsequently translated into dynamic thresholds of circuitry by means of the network theory. The various noises encountered in digita... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilization of the t* Partial Switching Properties of Ferroelectrics in Memory Devices

    Publication Year: 1965 , Page(s): 881 - 886
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1241 KB)  

    Some ferroelectric materials exhibit a transition from stable to unstable partial switching at a critical pulsewidth t*. Schemes are proposed for utilizing this t* effect for coincident and successive addressing of a matrix memory, for a nondestructive readout from a matrix and for the simplification of a ferroelectric-electroluminescent display system. The practical limitations on these schemes a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog Computer Generation of Bessel Functions of Arbitrary Order

    Publication Year: 1965 , Page(s): 886 - 889
    Cited by:  Papers (1)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (626 KB)  

    This paper presents a method for analog computer generation of Bessel functions of arbitrary order. It is shown at the beginning that the direct analog implementation of Bessel differential equation leads to rather inaccurate mathematical models. These inaccuracies are caused by the necessity of dividing nonzero quantity by zero. Based on these considerations this paper suggests a new approach whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity of Dynamic Systems to Parameters Which Increase the Order of Mathematical Models

    Publication Year: 1965 , Page(s): 890 - 897
    Request Permissions | Click to expandAbstract | PDF file iconPDF (5211 KB)  

    The paper describes a procedure applicable to analog computers for obtaining the sensitivity function of dynamic systems to parameters that change the order of differential equations. The procedure developed is applied to a problem in error analysis and to a problem in steepest ascent model identification. For purposes of comparison, the sensitivity with respect to normal parameters is also presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog Computer Techniques for Problems in Complex Variables

    Publication Year: 1965 , Page(s): 898 - 908
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3975 KB)  

    By programming pairs of amplifiers to represent the real and imaginary parts of complex variables on an analog computer, techniques are developed which 1) permit the mechanization of the method of steepest descents, for finding roots of complex functions, in Cartesian coordinates; 2) allow the generation of complex functions utilizing the Cauchy integral theorem; 3) enable a programmer to scan the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theory and Method for Correlation Analysis of Nonstationary Signals

    Publication Year: 1965 , Page(s): 909 - 919
    Cited by:  Papers (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1862 KB)  

    In this paper, a method is developed for obtaining cross-correlation functions and autocorrelation functions of signals which are generated by nonstationary processes. The theory of the method is based upon optimal approximation of the ensemble correlation function, when only one pair of signals is available for the correlation analysis. The use of the ensemble approximation approach allows the de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maxterm Type Expressions of Switching Functions and Their Prime Implicants

    Publication Year: 1965 , Page(s): 920 - 923
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (843 KB)  

    One of the basic problems of combinational switching circuit theory is that of designing circuits with a minimum number of AND-gates or prime implicants. Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these prime implicants for use in the formation of the minimal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Totally Symmetric Boolean Functions

    Publication Year: 1965 , Page(s): 924 - 926
    Cited by:  Papers (6)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (538 KB)  

    A new method for detection and identification of totally symmetric Boolean functions is developed. Instead of using maps, charts, or truth tables, with permutations and complementations of variables, this method is based on the number of vertices contained in symmetric functions and the concept of distance between two vertices. Since the distance between any two vertices remains invariant under an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

This Transactions ceased publication in 1967. The current retitled publication is 

IEEE Transactions on Computers.

Full Aims & Scope