By Topic

IEEE Transactions on Electronic Computers

Popular Articles (August 2016)

Browse the top 50 most frequently downloaded documents for this publication according to the usage statistics for the month of

  • 1. A Suggestion for a Fast Multiplier

    Publication Year: 1964, Page(s):14 - 17
    Cited by:  Papers (656)  |  Patents (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (723 KB)

    It is suggested that the economics of present large-scale scientific computers could benefit from a greater investment in hardware to mechanize multiplication and division than is now common. As a move in this direction, a design is developed for a multiplier which generates the product of two numbers using purely combinational logic, i.e., in one gating step. Using straightforward diode-transisto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition

    Publication Year: 1965, Page(s):326 - 334
    Cited by:  Papers (585)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1589 KB)

    This paper develops the separating capacities of families of nonlinear decision surfaces by a direct application of a theorem in classical combinatorial geometry. It is shown that a family of surfaces having d degrees of freedom has a natural separating capacity of 2d pattern vectors, thus extending and unifying results of Winder and others on the pattern-separating capacity of hyperplanes. Applyi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3. A Theory of Adaptive Pattern Classifiers

    Publication Year: 1967, Page(s):299 - 307
    Cited by:  Papers (196)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1535 KB)

    This paper describes error-correction adjustment procedures for determining the weight vector of linear pattern classifiers under general pattern distribution. It is mainly aimed at clarifying theoretically the performance of adaptive pattern classifiers. In the case where the loss depends on the distance between a pattern vector and a decision boundary and where the average risk function is unimo... View full abstract»

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

    Publication Year: 1967, Page(s):848 - 854
    Cited by:  Papers (642)  |  Patents (14)
    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.
  • 5. Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition

    Publication Year: 1964, Page(s):118 - 127
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1918 KB)

    This paper describes the development of a procedure that enables a digital computer to solve ``apictorial'' jigsaw puzzles, i.e., puzzles in which all pieces are uniformly gray and the only available information is the shape of the pieces. The problem was selected because it provided an excellent vehicle to develop computer techniques for manipulation of arbitrary geometric patterns, for pattern i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 6. A Design for (d, k) Graphs

    Publication Year: 1966, Page(s):253 - 254
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (286 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.
  • 7. A Method of Generating Functions of Several Variables Using Analog Diode Logic

    Publication Year: 1963, Page(s):112 - 129
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3228 KB)

    A diode-resistor network technique for simulating functions of any number of variables is described. The function is approximated by a polyhedron, or its N-dimensional equivalent, and this polyhedral model is generated directly by the circuit. The circuit is formed of two cascaded sections: the first, using resistive networks, generates voltages representing each of the faces of the polyhedron; th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 8. Characteristics of Microstrip Transmission Lines

    Publication Year: 1967, Page(s):185 - 193
    Cited by:  Papers (50)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2176 KB)

    Equations are developed which accurately describe the characteristic impedance and signal propagation delay for narrow microstrip transmission lines. Differences in signal propagation delay for microstrip, strip line, and coaxial cables are compared as a function of dielectric constant. The characteristic impedance equation is verified through comparison with experimental results for impedance val... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 9. Analysis of Programs for Parallel Processing

    Publication Year: 1966, Page(s):757 - 763
    Cited by:  Papers (97)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1234 KB)

    A set of conditions are described which determine whether or not two successive portions of a given program can be performed in parallel and still produce the same results. The conditions are general and can be applied to sections of the program of arbitrary size. The conditions are interesting because of the light they shed on the structure of programs amenable to parallel processing and the memo... View full abstract»

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

    Publication Year: 1967, Page(s):743 - 763
    Cited by:  Papers (45)
    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.
  • 11. On the Construction of (d, k) Graphs

    Publication Year: 1965, Page(s): 488
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB)

    The computer organization described here is an extension of a concept of Leondes and Rubinoff [1]. The original machine consisted of a drum store and a single processor capable of sequencing its access from one track (array column) to another at the end of each drum revolution. In this way the system could process one iteration of a Laplace equation in n-drum revolutions, where n is the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 12. Design of an Accumulator for a General Purpose Computer

    Publication Year: 1965, Page(s):570 - 574
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (799 KB)

    This paper describes the logical design of an accumulator register for a general purpose digital computer. The only logic gates used are NOR gates and inverter gates and the sole storage device is a gated clocked flip-flop which takes the value on a single input line when the gate line is high. The accumulator register operates in conjunction with another register called the memory exchange regist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 13. Content-Addressable and Associative Memory Systems a Survey

    Publication Year: 1966, Page(s):509 - 521
    Cited by:  Papers (27)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2929 KB)

    This review of content-addressable memory and associative computer systems represents an attempt to consolidate and report nontechnically the direction in which numerous independent research programs have progressed during the last ten years. The paper reflects the views of a myriad of researchers on subjects of organization (configuration concepts), hardware elements, logical operations, speed, c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 14. A Method to Increase the Accuracy of Fast-Serial-Parallel Analog-to-Digital Converters

    Publication Year: 1964, Page(s):471 - 473
    Cited by:  Papers (3)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (469 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.
  • 15. Design of Sequential Machines with Fault-Detection Capabilities

    Publication Year: 1967, Page(s):473 - 484
    Cited by:  Papers (40)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2257 KB)

    A sequential machine for which any input sequence of a specified length is a distinguishing sequence is said to be definitely diagnosable. A method is developed to obtain for any arbitrary sequential machine a corresponding machine which contains the original one and which is definitely diagnosable. Similarly, these techniques are applied to embed machines which are not information lossless of fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 16. Generalization of Consensus Theory and Application to the Minimization of Boolean Functions

    Publication Year: 1967, Page(s):446 - 456
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1510 KB)

    Given two implicants of a Boolean function, we can, by performing their consensus, find a third implicant. This operation has been used for finding the prime implicants of a Boolean function. In this paper, the consensus is extended from two to any number of terms. A property of these generalized consensus relations leads to a systematic way of finding them. It is shown that any prime implicant of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 17. Protecting Core Memory Circuits with Error Correcting Cyclic Codes

    Publication Year: 1964, Page(s):303 - 304
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 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.
  • 18. A Theory and Method for Correlation Analysis of Nonstationary Signals

    Publication Year: 1965, Page(s):909 - 919
    Cited by:  Papers (2)
    Request permission for commercial reuse | 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.
  • 19. An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem

    Publication Year: 1967, Page(s):784 - 790
    Cited by:  Papers (18)
    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.
  • 20. Optimization of Pulse and Digital Circuits by Use of the Lagrange Multiplier Technique

    Publication Year: 1963, Page(s):488 - 492
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (847 KB)

    Equations are derived for the optimal design of a frequency divider circuit, and optimal design equations are presented for other typical pulse circuits: a timing circuit, a gating circuit and a clipping circuit. The Lagrange Multiplier Technique used in this paper has also been applied successfully for the optimal design of switching amplifiers [1]. For each of the circuits considered, the reliab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 21. A Fast Analog Comparison for Hybrid Computation

    Publication Year: 1965, Page(s):717 - 719
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1251 KB)

    This paper describes the design of a new exceptionally fast analog comparator with digital output for hybrid computation. A wide-band dc amplifier with regenerative feedback permits high-speed comparator operation within 100 ns of zero crossing for all input rates of change between zero and 5×106 volts/second. Static hysteresis between ±10 mV and ±40 mV improves noise immunity. Drift... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 22. A High-Speed Direct-Coupled Magnetic Memory Sense Amplifier Employing Tunnel-Diode Discriminators

    Publication Year: 1963, Page(s):282 - 295
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3702 KB)

    Because of a multiplicity of conflicting requirements, sense amplifier design is probably the most difficult circuit problem in a large, high-speed digital computer memory. The requirements include absence of pattern sensitivity, controllable input impedance, a wide band pass, stable gain, high common mode rejection, the ability to handle bipolar signals, stable reference levels, a fast comparator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 23. Fault Detection in Redundant Circuits

    Publication Year: 1967, Page(s):99 - 100
    Cited by:  Papers (60)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    It is shown that a set of diagnostic tests designed for a redundant circuit under the single-fault assumption is not necessarily a valid test set if a fault occurrence is preceded by the occurrence of some (undetectable) redundant faults. This is an additional reason (besides economy) for trying to eliminate certain kinds of redundancy from the circuit. However, single-fault analysis may remain va... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 24. Some Results of Amplitude Distribution Experiments on Shift Register Generated Pseudo-Random Noise

    Publication Year: 1966, Page(s):926 - 927
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB)

    The well-known cyclic error-correcting codes are used so far only for serial systems; that is, systems having a single channel with information transmitted one bit at a time. In data-processing equipments and communication systems, information is often transmitted serially by characters and parallel by bits within a character. That is, there are several channels in parallel. Error correction in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 25. Multi-threshold threshold elements

    Publication Year: 1966, Page(s):45 - 65
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3905 KB)

    A multi-threshold element is one in which several thresholds are used to separate the true inputs from the false inputs. Many circuit elements and configurations can be described by this model. An approach, based on conventional single-threshold threshold elements, is developed for the analysis and synthesis of multithreshold threshold elements. It is shown that the basic properties of such elemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 26. Experiments with Digital Computer Simulations of Pseudo-Random Noise Generators

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

    One of the most useful binary linear sequential machines is the maximal-length linear sequence generator. These are sometimes known as pseudo-noise generators because of certain statistical characteristics of their output. One of the more tedious problems in the application of -these generators has long been the calculation of the time displacement of the vectors constituting the output bit stream... View full abstract»

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

    Publication Year: 1964, Page(s):382 - 385
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The fundamental concepts of FORTRAN, the most widely used high-level, scientific programming language, are set forth and the significant characteristics are described in historical order from inception of FORTRAN in 1954 to the present time. The basic problem of how to get high quality programming from an-easy- to-write high-level language is emphasized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 28. Experiments on Models of Computations and Systems

    Publication Year: 1967, Page(s):59 - 69
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1579 KB)

    This paper reports results of experiments on models of computational sequences and models of computer systems. The validity of these models is a step in the evolution of methods for prediction of complex computer system performance. A graph model representing computational sequences was implemented and mapped onto a model of computer systems using programmable assignment and sequencing strategies.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 29. Improving Digital Computer Performance Using Residue Number Theory

    Publication Year: 1964, Page(s):93 - 101
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1622 KB)

    Residue arithmetic has the interesting characteristic that in multiplication, addition and subtraction any digit in the result is dependent only on its two corresponding operand digits. Consequently, for these operations, residue arithmetic is inherently faster than the conventional weighted arithmetics. A system design approach for exploiting the desirable characteristics of both residue and conv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 30. A Method for the Determination of a Differential Equation Model for Simple Nonlinear Systems

    Publication Year: 1963, Page(s):394 - 400
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1165 KB)

    A method is described for the establishment of a nonlinear differential equation which acts as a model for an actual physical system. It is assumed initially that the actual system contains only a single nonlinear element and that this element may be represented in the differential equation model by a single-valued nonlinear function of a single variable. The method is then extended to systems whi... View full abstract»

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

    Publication Year: 1967, Page(s):773 - 784
    Cited by:  Papers (6)
    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.
  • 32. 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.
  • 33. A Dynamic Programming Approach to Sequential Pattern Recognition

    Publication Year: 1967, Page(s):790 - 803
    Cited by:  Papers (21)
    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.
  • 34. A Threshold Logic Network for Shape Invariance

    Publication Year: 1967, Page(s):818 - 828
    Cited by:  Papers (24)
    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.
  • 35. Adaptive Coding for Self-Clocking Recording

    Publication Year: 1967, Page(s):866 - 868
    Cited by:  Papers (17)  |  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.
  • 36. Nonstable Cycle and Level Sets for Linear Sequential Machines

    Publication Year: 1965, Page(s):957 - 959
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB)

    It is shown that the cycles sets of a linear sequential machine with a constant input having no stable state, are derivable from the cycle sets of that same linear sequential machine with a constant 0 input. It is shown that the level sets are independent of the input. A synthesis procedure and an example are presented. The objective of this short paper is to show the relation between the cycle se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 37. 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 (3)
    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.
  • 38. 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.
  • 39. "Light-Pen"' Facilities for Direct View Storage Tubes-An Economical Solution for Multiple Man-Machine Communication

    Publication Year: 1965, Page(s):637 - 639
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (555 KB)

    Techniques are presented which enable conventional "light-pen" tracking and pointing functions to be extended to the direct view storage tube (DVST). The schemes eliminate the high data transfer rates or considerable buffer storage required even for static displays when short persistence cathode ray tubes (CRTs) are used. Two solutions, a "quadruple photo-sensor pen" and the "potentiometer pen" (a... View full abstract»

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

    Publication Year: 1965, Page(s):822 - 829
    Request permission for commercial reuse | 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.
  • 41. On-Line Computer Classification of Handprinted Chinese Characters as a Translation Aid

    Publication Year: 1967, Page(s):856 - 860
    Cited by:  Papers (16)  |  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.
  • 42. Analysis of Linear Sequential Circuits by Confluence Sets

    Publication Year: 1964, Page(s):226 - 231
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1051 KB)

    In this paper the group-theoretical concept of ``confluence sets'' is introduced as a valuable tool in the analysis of linear sequential circuits (LSC's). Using this concept, a scheme is formulated for producing state graphs of autonomous LSC's which, in the ``singular'' case, is superior to currently known schemes. Singular LSC's, which are of potential interest in error correction systems, are s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 43. 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.
  • 44. An Experimental Investigation of a Nonsupervised Adaptive Algorithm

    Publication Year: 1967, Page(s):860 - 864
    Cited by:  Papers (2)
    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.
  • 45. Band-Pass Quadrature Filters

    Publication Year: 1966, Page(s):726 - 731
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1161 KB)

    Two identical low-pass electrical filters, having any realizable low-pass frequency-response characteristic and synthesized from linear analog computer components by any convenient method, may be interconnected in a simple manner to form a band-pass filter whose frequency-response characteristic represents a translation along the frequency axis of the frequency response characteristic of the origi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 46. The Use of Hybrid Computing in the Analysis of Steel Rolling

    Publication Year: 1967, Page(s):717 - 722
    Cited by:  Papers (1)
    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.
  • 47. 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.
  • 48. Random Noise Generation by Hybrid Computer

    Publication Year: 1967, Page(s):872 - 873
    Cited by:  Papers (1)
    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.
  • 49. Spectrum Analysis of Digital Magnetic Recording Waveforms

    Publication Year: 1967, Page(s):732 - 743
    Cited by:  Papers (11)
    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.
  • 50. Boolean Matrices and the Stability of Neural Nets

    Publication Year: 1963, Page(s):61 - 66
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (797 KB)

    The functional states of a neural (combinational) net of prescribed interconnection geometry and over-all net function are characterized and enumerated. The problem is formalized for a class of nets having an arbitrary number of inputs and outputs by introducing the notion of a Boolean matrix. The concept of stability of neural nets (which is closely related to the set of functional states over wh... 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