Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 3 • March 1972

Filter Results

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

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

    Publication Year: 1972, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (211 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1972, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (211 KB)
    Freely Available from IEEE
  • On the Execution of Fuzzy Programs Using Finite-State Machines

    Publication Year: 1972, Page(s):241 - 253
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2332 KB)

    An abstract model for the execution of fuzzy programs using finite-state machines is described, Different ways of executing fuzzy programs are investigated. It is shown that the performance function λ of a fuzzy machine M can be effectively constructed so that the program searching cost of an elementary fuzzy program, a number of elementary fuzzy programs, or a regular fuzzy program is min... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Correction in Adders using Systematic Subcodes

    Publication Year: 1972, Page(s):254 - 259
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (945 KB)

    It is presently known that (single) error correction in adders can be obtained by use of biresidue codes, which use two separate checkers with respect to two different check bases of the form 2c -1. It is shown here that a class of systematic subcodes derived from the nonsystematic AN codes can provide error correction using only one checker. However, the check base A of these codes is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum-Perimeter Polygons of Digitized Silhouettes

    Publication Year: 1972, Page(s):260 - 268
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1745 KB)

    The minimum-perimeter polygon of a silhouette has been shown to be a means for recognizing convex silhouettes and for smoothing the effects of digitization in silhouettes. We describe a new method of computing the minimum-perimeter polygon (MPP) of any digitized silhouette satisfying certain constraints of connectedness and smoothness, and establish the underlying theory. Such a digitized silhouet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourier Descriptors for Plane Closed Curves

    Publication Year: 1972, Page(s):269 - 281
    Cited by:  Papers (929)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2175 KB)

    A method for the analysis and synthesis of closed curves in the plane is developed using the Fourier descriptors FD's of Cosgriff [1]. A curve is represented parametrically as a function of arc length by the accumulated change in direction of the curve since the starting point. This function is expanded in a Fourier series and the coefficients are arranged in the amplitude/phase-angle form. It is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State Assignment of Asynchronous Sequential Machines Using Graph Techniques

    Publication Year: 1972, Page(s):282 - 288
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 KB)

    A new algorithm for asynchronous machines is presented. The problem is formulated and solved in graph-theoretic terms. A graph-embedding algorithm in an n-cube developed in Sections I-III is used to establish the encoding method. The resulting critical race free encoding minimizes the dimensions of the internal variables and the transition times. This method should be especially interesting for la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Walsh-Hadamard Transformation

    Publication Year: 1972, Page(s):288 - 292
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (871 KB)

    A technique for obtaining the digital Walsh-Hadamard transform of two-dimensional discrete pictures in real time is presented. A considerable reduction in total time for the transformation of a picture results since the process of scanning and digitizing one picture line overlaps with computations on the previous line. This is accomplished by operating on each picture line as it is generated from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An On-Line Computer Method for Parameter Tracking of Sampled-Data Systems

    Publication Year: 1972, Page(s):292 - 299
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    Methods are presented for tracking the variable parameters of sampled-data systems by a model. Both linear and nonlinear systems are considered and use is made of parameter sensitivity functions. The proposed schemes are divided into the identification error method and the output error method. Under suitable assumptions, the identification error method ensures that the system is closely tracked by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smoothing of Data by Least Squares Procedures and by Filtering

    Publication Year: 1972, Page(s):299 - 301
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    It is shown that when discrete experimental data are smoothed by fitting 2m + 1 consecutive data to a polynomial of 2nth degree, with n≪m, and when n and m are increased indefinitely, the smoothing obtained is equivalent to passing the original data through an ideal low-pass filter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Mathematical Models Characterizing Faulty Four-Phase MOS Logic Arrays

    Publication Year: 1972, Page(s):301 - 305
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (797 KB)

    In earlier papers no analysis characterizing faulty four-phase MOS logic arrays due to single load and sampling transistor faults has been given. In this note the models due to faulty load and sampling transistors are analyzed and discussed. Some useful results leading to faster simulation of four-phase MOS logic arrays with single faulty load and sampling transistors are presented. The computer s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the Length of Terminal Stuck-Fault Test

    Publication Year: 1972, Page(s):305 - 309
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1093 KB)

    A terminal stuck fault in a logic network is represented by one or more stuck-at-1 or stuck-at-0 faults on the n input lines or single output. It is shown that for n ≤ 5, a least upper bound on the test length is n + 1, and for n > 5, an upper bound is 2n - 4. A greatest lower bound is 3, for all n > 1. The upper bounds are based on a maximum size alternating 1-tree in the n-cube represent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decomposition Method of Determining Maximum Compatibles

    Publication Year: 1972, Page(s):309 - 312
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (829 KB)

    A direct method of determining the maximum compatibility sets of an incompletely specified flow table of a sequential machine is presented. Subsets of pairwise incompatibles are utilized to decompose the set of all states in a step-by-step process into the maximum compatibles in a few steps. The method is simpler and faster than previously reported tabular, algebraic, and graphical techniques. View full abstract»

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

    Publication Year: 1972, Page(s):312 - 317
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (866 KB)

    This note describes an algorithm for identifying multivalued symmetric switching functions using parallel processing. Some general properties of multivalued symmetric functions have been investigated. The mixed multivalued symmetric switching function is defined and an algorithm for identifying it is also presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem

    Publication Year: 1972, Page(s):317 - 318
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB)

    This correspondence derives a lower bound for the size of a minimal solution of a 0-1 covering problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Correctness of Some Sequential Classification Schemes in Pattern Recognition

    Publication Year: 1972, Page(s):318 - 320
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (591 KB)

    This correspondence points out some discrepancies observed in [2]-[5] in the formulation of the sequential decision process for simplifying approximations to the probability distributions. The authors use two mutually contradictory conditions in introducing the approximations. The correct form of the functional equation for statistically independent features is presented. View full abstract»

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

    Publication Year: 1972, Page(s): 320
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 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: 1972, Page(s):321 - 322
    Request permission for commercial reuse | PDF file iconPDF (1993 KB)
    Freely Available from IEEE
  • Book Review

    Publication Year: 1972, Page(s): 322
    Request permission for commercial reuse | PDF file iconPDF (951 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1972, Page(s):323 - 331
    Request permission for commercial reuse | PDF file iconPDF (2489 KB)
    Freely Available from IEEE
  • Descriptor-in-Context Index

    Publication Year: 1972, Page(s):331 - 335
    Request permission for commercial reuse | PDF file iconPDF (1149 KB)
    Freely Available from IEEE
  • Identifier index

    Publication Year: 1972, Page(s):335 - 336
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1972, Page(s): 336
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1972, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org