By Topic

# IEEE Transactions on Electronic Computers

## Filter Results

Displaying Results 1 - 25 of 38
• ### [Front cover]

Publication Year: 1967, Page(s): c1
| PDF (535 KB)
• ### IEEE Computer Group

Publication Year: 1967, Page(s): nil1
| PDF (174 KB)
• ### Breaker Page

Publication Year: 1967, Page(s): nil1
| PDF (174 KB)
• ### Random-Pulse Machines

Publication Year: 1967, Page(s):261 - 276
Cited by:  Papers (35)  |  Patents (2)
| | PDF (3354 KB)

A new kind of machine is proposed, in which the continuous variable is represented as a probability of a pulse occurrence at a certain sampling time. It is shown that threshold gates can be used as simple and inexpensive processors such as adders and multipliers. In fact, for a random-pulse sequence, any Boolean operation among individual pulses will correspond to an algebraic expression among the... View full abstract»

• ### Synthesis of Resistive Digital-to-Analog Conversion Ladders for Arbitrary Codes with Fixed Positive Weights

Publication Year: 1967, Page(s):277 - 281
Cited by:  Papers (3)
| | PDF (612 KB)

Necessary and sufficient conditions are given for the realizability of resistive digital-to-analog conversion ladders for arbitrary codes with fixed positive weights. Realizability and synthesis are shown to hinge on the choice of the input admittance. Simple equations are given for purposes of design and several examples are worked out. View full abstract»

• ### Basic Properties and a Construction Method for Fail-Safe Logical Systems

Publication Year: 1967, Page(s):282 - 289
Cited by:  Papers (43)
| | PDF (1240 KB)

In this paper, the authors study fail-safe'' properties of logical systems, finding the conditions that the basic logical functions of fail-safe logical systems should satisfy and also identifying the allowable failures for the basic logical function circuits. With these results, the authors present a systematic representation of fail-safe logical systems, and an effective method of logical desi... View full abstract»

• ### New Classes of Synchronous Codes

Publication Year: 1967, Page(s):290 - 298
Cited by:  Papers (13)
| | PDF (1618 KB)

New classes of codes with similar application to Gilbert's code [1] are defined. Weakening of his synchronizing condition gives higher efficiency in the new codes. One class (the F codes) is shown to be the most efficient possible among those codes which use Gilbert's method of achieving synchronization, i.e., the position fixing'' method. The other classes use a basically different method of ac... View full abstract»

• ### A Theory of Adaptive Pattern Classifiers

Publication Year: 1967, Page(s):299 - 307
Cited by:  Papers (203)
| | PDF (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»

• ### Generation of Polynomial Discriminant Functions for Pattern Recognition

Publication Year: 1967, Page(s):308 - 319
Cited by:  Papers (149)  |  Patents (7)
| | PDF (2205 KB)

A practical method of determining weights for crossproduct and power terms in the variable inputs to an adaptive threshold element used for statistical pattern classification is derived. The objective is to make it possible to realize general nonlinear decision surfaces, in contrast with the linear (hyperplanar) decision surfaces that can be realized by a threshold element using only first-order t... View full abstract»

• ### Memory Protection in Multiprocessing Systems

Publication Year: 1967, Page(s):320 - 326
Cited by:  Papers (1)  |  Patents (4)
| | PDF (1267 KB)

In a multiprocessor system where a bank of processors share a bank of memories, it becomes necessary to equip a processor with the capability to periodically deny to other processors access to certain memory locations. We call this the memory-protection problem because the processor which has gained access to the data must protect it from others. The type of data contained in the memory locations ... View full abstract»

• ### A Mathematical Model for Diagnosing System Failures

Publication Year: 1967, Page(s):327 - 331
Cited by:  Papers (12)
| | PDF (777 KB)

A mathematical model is developed for diagnosing system failures when symptoms are observable. Optimal policies for searching malfunctions yielding minimum expected diagnostic cost are developed, based on the probabilities of various malfunctions conditioned on the set of observable symptoms, the detection probability of each malfunction, and its associated testing cost. The necessary and sufficie... View full abstract»

• ### Portable Electronic Keyboard for Computer Input by Telephone

Publication Year: 1967, Page(s):332 - 334
Cited by:  Papers (1)
| | PDF (1402 KB)

This device, which may be acoustically-coupled to any conventional telephone handset, generates coded tone sequences representing alphanumeric characters. The full ASCII character set, coded with parity, is used, and all 128 symbols available for selection are displayed on the device in a small electronic keyboard.'' The transmitted tone sequences correspond to those generated by most Teletype-D... View full abstract»

• ### High-Speed Plated-Wire Memory System

Publication Year: 1967, Page(s):335 - 343
Cited by:  Papers (14)
| | PDF (4188 KB)

The plated-wire memory, combined with functional circuit integration, is a strong contender for economic, high-speed, large-capacity memory systems. Important attributes of the plated-wire memory are high-speed DRO and NDRO capability, low digit WRITE current, high output sense signal and low word-to-digit line crosspoint capacitance. Design and operational results for a 1024-word by 80-bit store ... View full abstract»

Publication Year: 1967, Page(s):344 - 350
| | PDF (803 KB)

This paper describes a READ-ONLY memory utilizing the mutual coupling of two solenoids for information storage. The properties of the proposed memory element and the batch-fabricated memory array are discussed. Experimental results on a 256-word, 36-bit-per-word memory stack operating at memory cycle frequency varying up to 10 MHz are reported. A proposed full-size 256-word, 288-bit-per-word, READ... View full abstract»

• ### State-Space Methods for Designing Digital Simulations of Continuous Fixed Linear Systems

Publication Year: 1967, Page(s):351 - 355
Cited by:  Papers (6)
| | PDF (884 KB)

Four somewhat different methods are presented. Method I is an interpolative method, suitable for many all-digital simulations. Method II is an extrapolative method, suitable for hybrid analog-digital simulations and cases involving closed-loop systems with nonlinearities. Method I calculates values of the output vector y and state vector q at t = nT, using values of the input vector, x, at times t... View full abstract»

• ### Experiments with Digital Computer Simulations of Pseudo-Random Noise Generators

Publication Year: 1967, Page(s):355 - 357
Cited by:  Papers (7)
| | PDF (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»

• ### Computation of Time-Phase Displacements of Binary Linear Sequence Generators

Publication Year: 1967, Page(s):357 - 359
Cited by:  Papers (1)
| | PDF (531 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 applicaton of these generators has long been the calculation of the time displacement of the vectors constituting the output bit stream. ... View full abstract»

• ### Synthesis of Symmetric Switching Functions Using Threshold Logic Elements

Publication Year: 1967, Page(s):359 - 364
Cited by:  Papers (3)
| | PDF (872 KB)

The problem of minimal multilevel synthesis of symmetric switching functions with threshold logic elements is studied. A weight matrix representation of a threshold logic network is given. A number of theorems are presented which give necessary and sufficient conditions for minimal synthesis of symmetric functions with a maximum of eight positive transitions. In each case the minimal network is sp... View full abstract»

• ### Two Problems on Boolean Memories

Publication Year: 1967, Page(s):364 - 365
| | PDF (373 KB)

This paper is intended to improve Huffman's results on universal encoding of asynchronous sequential networks. The method employed here consists of assigning to each row of the flow table a single vertex on the corresponding hypercube. The remaining vertices are used for the transitions between stable states. Such a vertex can be used for different transitions if they correspond to distinct input ... View full abstract»

• ### Encoding of Asynchronous Sequential Networks

Publication Year: 1967, Page(s):365 - 369
Cited by:  Papers (7)
| | PDF (978 KB)

This paper is intended to improve Huffman's results on universal encoding of asynchronous sequential networks. The method employed here consists of assigning to each row of the flow table a single vertex on the corresponding hypercube. The remaining vertices are used for the transitions between stable states. Such a vertex can be used for different transitions if they correspond to distinct input ... View full abstract»

• ### Conic Display Generator Using Multiplying Digital-Analog Converters

Publication Year: 1967, Page(s):369 - 370
Cited by:  Papers (4)
| | PDF (452 KB)

A simple waveform generator for display systems has been designed on the basis of homogeneous coordinate mathematics. This generator will draw points, lines, and general conic sections. The fundamental waveform used is the parabola. Circles, ellipses, and hyperbolas are merely perspective transformations of the basic parabola, which is represented by the parametric vector t= [t2, t, 1].... View full abstract»

• ### A New Approach to Permanent Memory

Publication Year: 1967, Page(s):370 - 371
| | PDF (350 KB)

First Page of the Article
View full abstract»

• ### Operational Differentiators Employing Positive Feedback

Publication Year: 1967, Page(s):371 - 372
| | PDF (320 KB)

First Page of the Article
View full abstract»

• ### Comment on "Content-addressed memory using magneto-or electro-optical interrogation''

Publication Year: 1967, Page(s): 372
Cited by:  Papers (2)
| | PDF (187 KB)

First Page of the Article
View full abstract»

• ### Contributors

Publication Year: 1967, Page(s):373 - 375
| PDF (3084 KB)

## Aims & Scope

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

Full Aims & Scope