By Topic

Electronic Computers, IRE Transactions on

Issue 6 • Date Dec. 1962

Filter Results

Displaying Results 1 - 23 of 23
  • [Front cover]

    Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (509 KB)  
    Freely Available from IEEE
  • IRE Professional Group on Electronic Computers

    Page(s): nil1
    Save to Project icon | Request Permissions | PDF file iconPDF (115 KB)  
    Freely Available from IEEE
  • [Breaker page]

    Page(s): nil1
    Save to Project icon | Request Permissions | PDF file iconPDF (115 KB)  
    Freely Available from IEEE
  • The Design of Complementary-Output Networks

    Page(s): 743 - 753
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1740 KB)  

    Using the contact network as a representative of the class of combinational branch-type networks, various realization techniques are examined for their applicability or adaptability to the particular class of complementary-output networks, that is, two-output networks which have exactly one active output for each combination of the independent variables. Some elementary structural characteristics are developed and a particular class of functions which are minimally realized in separate parts is discussed. Upper and lower bounds are derived for the the number of contacts required to realize an arbitrary n-variable specification. Rudin's interconnection rules are extended to the non-series-parallel case and examples are given of their application. Trees are discussed in terms of a specific procedure proposed for their realization. Finally, Calingaert's reduction of the general multi-output problem to a single-output problem is reviewed in terms of the specific class of networks of interest here, and results, in conjunction with Moore's tables of minimal four-variable networks, in a table of minimal three-variable complementary-output networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Computation and Recursive Functions Not Real-Time Computable

    Page(s): 753 - 760
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1412 KB)  

    As an attempt to investigate a general theory of real-time computability in digital computers, a subclass of Turing machines is formally introduced together with some classes of functions that are computable by them in real time. Then the existence is established of a class of recursive functions that are not computable in real time by use of a class of machines, no matter how general we make the machines subject to a given constraint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Class of Binary Divisions Yielding Minimally Represented Quotients

    Page(s): 761 - 764
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (655 KB)  

    Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ¿1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ¿¿|D|¿¿. This method is extended to yield minimally represented quotients for all normalized divisors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Density Magnetic Head Design for Noncontact Recording

    Page(s): 764 - 773
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3836 KB)  

    The information storage density in digital magnetic recording is dependent on both the pulse resolution and the track definition. This paper is concerned with these two factors in the design of magnetic heads for noncontact recording.1 A concept of changed pole-tip geometry which led to a significant improvement of pulse resolution is introduced. A general expression based on ``single-pulse'' superposition is derived for various bit densities2 and data codes. In addition, several recording methods are discussed for achieving near-maximum track density2 under various head-repositioning error3 conditions. As shown, high-density heads for noncontact recording have been designed successfully by applying the concept and techniques developed. Good correlation has been realized between analytical and experimental results. Performance characteristics under simulated machine conditions are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bias-Controlled Tunnel-Pair Logic Circuits

    Page(s): 773 - 779
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1695 KB)  

    A three-terminal network consisting of two matched tunnel diodes and a fixed resistor is introduced as a basic element for performing peak threshold summation logic. The characteristic between two terminals resembles a tunnel diode curve where application of a signal or bias current to the third terminal causes reduction of the observed peak current. Decrease of this peak current below a fixed load line allows switching from the low- to the high-voltage state for logic-function circuit operation. Such bias-controlled tunnel pairs are shown to be unilateral to a considerable extent (30 db). This is advantageous in logic networks since it allows directional flow of information without the provision of multiphase power supplies or backward diodes, as needed in conventional tunnel diode logic circuits to eliminate back-switching. Circuits are described based on this principle, consisting entirely of tunnel junctions and resistors, for performing OR, MAJORITY, AND and NOR logic. Generalized design equations for circuits with a fan-in of M and a fan-out of N are derived. Test circuits based upon the generalized equations with a fan-in of 9 and a fan-out of 5 were found to operate over a temperature range from ¿70° to +60°C. A sample switching speed measurement for an OR gate using 1-ma tunnel diodes and a normal degree of drive showed a 7.5-nsec rise time which was triple that observed with a single tunnel diode under similar conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear-Segment Function Generator

    Page(s): 780 - 788
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1530 KB)  

    A single-variable function generator, based on a pulse averaging method,1 accepts a width-modulated pulse input. The clock generator accuracy determines the precision with which this device can produce a linear-segment curve. With 300-kc flip-flops in the clock, a static repeatability of ±0.02 per cent has been obtained with a carrier frequency of 100 cps, and ±1 per cent with a 10-kc carrier frequency. This device can multiply the single-variable function by a second input variable at no loss of accuracy and with no additional circuitry. View full abstract»

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

    Page(s): 797
    Save to Project icon | Request Permissions | PDF file iconPDF (943 KB)  
    Freely Available from IEEE
  • Reviews of Books and Papers in the Computer Field

    Page(s): 798 - 807
    Save to Project icon | Request Permissions | PDF file iconPDF (2671 KB)  
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Page(s): 809 - 832
    Save to Project icon | Request Permissions | PDF file iconPDF (5512 KB)  
    Freely Available from IEEE
  • PGEC News

    Page(s): 833
    Save to Project icon | Request Permissions | PDF file iconPDF (236 KB)  
    Freely Available from IEEE
  • IFIP News

    Page(s): 833
    Save to Project icon | Request Permissions | PDF file iconPDF (236 KB)  
    Freely Available from IEEE
  • Notices

    Page(s): 834 - 835
    Save to Project icon | Request Permissions | PDF file iconPDF (422 KB)  
    Freely Available from IEEE
  • Index to IRE Transactions on Electronic Computers

    Page(s): 836 - 845
    Save to Project icon | Request Permissions | PDF file iconPDF (2027 KB)  
    Freely Available from IEEE
  • Information for authors

    Page(s): nil3
    Save to Project icon | Request Permissions | PDF file iconPDF (185 KB)  
    Freely Available from IEEE
  • [Front cover]

    Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (134 KB)  
    Freely Available from IEEE

Aims & Scope

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

IEEE Transactions on Computers.

Full Aims & Scope