By Topic

Electronic Computers, IEEE Transactions on

Issue 6 • Date Dec. 1967

Filter Results

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

    Publication Year: 1967, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (471 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1967, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • Breaker Page

    Publication Year: 1967, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • The Use of Hybrid Computing in the Analysis of Steel Rolling

    Publication Year: 1967, Page(s):717 - 722
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (767 KB)

    The equations that govern the behavior of steel under-going reduction are complex differential equations. A method of solving these equations using a hybrid computer is described, and the peculiar problems associated with such a solution are discussed. In the hybrid implementation, differential equations can be solved very fast, and the speed of solution is governed by the number of samples one re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Device Applications of Charge Rectifiers

    Publication Year: 1967, Page(s):723 - 731
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3476 KB)

    Two circuit models of a semiconductor junction rectifier are presented. For times long compared to the effective minority carrier lifetime, the usual current rectifier concept obtains. For times short compared to the lifetime, a charge rectifier is better able to explain experimental results; reverse recovery is evidence of this. Viewed in this way, semiconductor junctions are suitable for certain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum Analysis of Digital Magnetic Recording Waveforms

    Publication Year: 1967, Page(s):732 - 743
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1925 KB)

    Closed form expressions have been obtained for the power density spectra of signal waveshapes in use for digital magnetic recording. The ``signal'' is the magnetization versus distance profile imposed on the magnetic medium to encode binary ones and zeros. Two general classes of signals are distinguished in terms of neighboring bit-to-bit correlation. Standard recording methods such as saturation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crosstalk (Noise) in Digital Systems

    Publication Year: 1967, Page(s):743 - 763
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6799 KB)

    As digital system speeds increase and their sizes diminish, it becomes increasingly important to understand the mechanism of signal crosstalk (noise) in interconnections between logic elements. The worst case is when two wires run parallel for a long distance. Past literature has been unsuccessful in explaining crosstalk between parallel wires above a ground plane, because it was assumed that only... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of Computing Systems with Memory Hierarchies

    Publication Year: 1967, Page(s):764 - 773
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1694 KB)

    Data transfers in computing systems with memory hierarchies usually prolong computing time and, consequently, cause degradation of system performance. A method to determine data processing rates and the relative utilization of memories for various system configurations under a variety of program loads is presented. According to this method, a program-independent ultimate data processing rate is de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ``Intergraphic,'' A Microprogrammed Graphical-Interface Computer

    Publication Year: 1967, Page(s):773 - 784
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2194 KB)

    The paper describes a proposed microprogrammed interface computer, ``Intergraphic,'' which will link many (initially 13; potentially more than 50) general-purpose graphical terminals to a central processor. Intergraphic will generate new images once only, at high speed (10-MHz incremental plotting rates) on one of several small, electrostatically deflected, precision CRT's. The images will be gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem

    Publication Year: 1967, Page(s):784 - 790
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    The two-dimensional ``hidden-line'' problem is the problem of determining, by means of a computer algorithm, which edges or parts of edges of an arbitrary, nonintersecting polygon are visible from a specified vantage point in the plane of the polygon. The problem is an important one in the field of computer graphics, and is encountered, for example, in using a computer to determine the portion of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Programming Approach to Sequential Pattern Recognition

    Publication Year: 1967, Page(s):790 - 803
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2029 KB)

    This paper presents the dynamic programming approach to the design of optimal pattern recognition systems when the costs of feature measurements describing the pattern samples are of considerable importance. A multistage or sequential pattern classifier which requires, on the average, a substantially smaller number of feature measurements than that required by an equally reliable nonsequential cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of Symmetry, Redundancy and Equivalence of Boolean Functions

    Publication Year: 1967, Page(s):804 - 817
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2450 KB)

    Functionally packaged logic can only be effectively utilized if the totality of switching functions that each package is capable of providing is recognized. Theorems concerning, and algorithms operating on, multiple output switching functions (possibly with don't care conditions) in cubical array notation are presented that 1) detect partial symmetry and redundancy sets of input varibles, 2) deter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Threshold Logic Network for Shape Invariance

    Publication Year: 1967, Page(s):818 - 828
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2047 KB)

    A property filter is developed that is suitable for recognizing translation-rotation-dilation classes of two-dimensional images. Invariant outputs corresponding to such classes are obtained by employing two successive sampled spatial harmonic transforms. The required analyses are equivalent to taking inner products of pairs of vectors only one of which is variable in each case. Subsequently, the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Realization Procedure for Multithreshold Threshold Elements

    Publication Year: 1967, Page(s):828 - 835
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1472 KB)

    A synthesis procedure is introduced for obtaining multithreshold threshold-element realizations of arbitrary Boolean functions (including functions with don't cares). Through transforms of multithreshold threshold-element realizations, the procedure is also applicable to threshold-element-network realizations of functions. The procedure is useful for hand calculations for functions with a small nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of Reduced Dependencies for Synchronous Sequential Machines

    Publication Year: 1967, Page(s):835 - 847
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2658 KB)

    The purpose of this paper is to describe an algorithmic ``solution'' to the assignment problem of synchronous sequential machines. The figure of merit used provides a mathematical evaluation of the reduced dependencies that may exist in the set of logic equations. If desired, the algorithm can assign the input, state, and output symbols of a given machine so as to ``minimize'' the total logic, i.e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Connection Assignment Problem of Diagnosable Systems

    Publication Year: 1967, Page(s):848 - 854
    Cited by:  Papers (451)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1326 KB)

    This paper treats the problem of automatic fault diagnosis for systems with multiple faults. The system is decomposed into n units u1, u2, . . . , un, where a unit is a well-identifiable portion of the system which cannot be further decomposed for the purpose of diagnosis. By means of a given arrangement of testing links (connection assignment) each unit of the sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified Pseudorandom Number Generators

    Publication Year: 1967, Page(s):854 - 856
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (698 KB)

    Pseudorandom number generator programs can be modified by a simple procedure which has particular advantages for the shorter word binary computers. The method combines the result of any conventional arithmetic generator with the current state of counters by means of a logic instruction. A variety of statistical tests have indicated that good results are realized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Line Computer Classification of Handprinted Chinese Characters as a Translation Aid

    Publication Year: 1967, Page(s):856 - 860
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2854 KB)

    This paper describes a method for using sequential positional information to recognize handprinted Chinese characters, and a computer program which uses this method to provide a translation aid. The method is based on the fact that Chinese characters are drawn as a definite sequence of a few types of strokes. The program, which provides a direct man-computer communication via a RAND Tablet and a C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experimental Investigation of a Nonsupervised Adaptive Algorithm

    Publication Year: 1967, Page(s):860 - 864
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1195 KB)

    An unsupervised or nonsupervised adaptive algorithm for linear decision boundaries is applied to two pattern recognition problems: the classification of spoken words, and the classification of hand-printed characters. The term unsupervised indicates that the class identification of the input patterns is not continuously available to the adaptive system. The algorithm discussed offers two advantage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Calculation of Mean Shift for a Binary Multiplier Using 2, 3, or 4 Bits at a Time

    Publication Year: 1967, Page(s):864 - 866
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (579 KB)

    Binary multiplication can be speeded up by taking two or more bits of the multiplier at a time. This note describes an exact method, based on the use of a discrete-time, finite-state system model, for calculating the gain in multiplication speed resulting from such a scheme. It is shown that the gain in speed is less than what had previously been obtained using an approximation formula. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Coding for Self-Clocking Recording

    Publication Year: 1967, Page(s):866 - 868
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (683 KB)

    Self-clocking of binary information involves a coding constraint whereby the maximum length of zero strings is limited to a predetermined number. For reasons of operational stability it is desirable to keep this number low. The price of such constraint is a degradation in code density. The class of serial recording which includes the well-known frequency modulation and phase encoding represents on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing and Realization of Threshold Functions with Don't Cares

    Publication Year: 1967, Page(s):868 - 870
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (721 KB)

    In this note the successive-higher-ordering method for testing and realization of threshold functions is applied to the realization of a threshold function F, such that it will contain a given function F1, which may or may not be a threshold function, and such that it will be contained in F1+F¿, where F¿ is the function representing the don't care vert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rapid Method for the Identification of the Type of a Four-Variable Boolean Functin

    Publication Year: 1967, Page(s):870 - 871
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB)

    The hyperoctahedral group on the set of N-variable Boolean functions is defined. The problem of determining, given an arbitrary function, its equivalence class membership (type) is posed and, for the special case of four-variable functions, solved by a method that in use proved to be four times as rapid as computation of the conventional Golomb-Ninomiya[1],[2] invariants. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Noise Generation by Hybrid Computer

    Publication Year: 1967, Page(s):872 - 873
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1087 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 1967, Page(s):873 - 876
    Request permission for commercial reuse | PDF file iconPDF (4037 KB)
    Freely Available from IEEE

Aims & Scope

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

IEEE Transactions on Computers.

Full Aims & Scope