By Topic

IEE Proceedings E - Computers and Digital Techniques

Issue 4 • Date July 1986

Filter Results

Displaying Results 1 - 6 of 6
  • Novel data packing algorithm for improved string matching

    Publication Year: 1986, Page(s):185 - 193
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1194 KB)

    A novel method for packing sequential data offers improvements in the efficiency of pattern-matching algorithms. The technique utilises the stochastic synchronisation capability of the augmented T-codes, and the typographical packing procedure provided by the binary-depletion T-codes. The two homomorphic coding systems used here and previously presented are introduced briefly again in an informal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of multiplexers in direct synthesis of ASM-based designs

    Publication Year: 1986, Page(s):194 - 200
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (882 KB)

    Techniques are described for translating an ASM chart or table directly into a variety of synthesis forms. These include PROM-, FPLA- and multiplexer-based implementations. A method for improving the circuit economy based on the preselection of qualifiers by means of multiplexers is presented. An algorithm for the simplification of multiplexer networks is also included. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flexible communication structure for distributed embedded systems

    Publication Year: 1986, Page(s):201 - 211
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1735 KB)

    The paper describes an extensible communication system for Conic, an architecture for distributed embedded systems. Conic provides a high level programming language with interprocess communication primitives suited to both local and remote communication. These primitives are sufficiently powerful to be used for applications programming yet simple and efficient enough for programming system softwar... View full abstract»

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

    Publication Year: 1986, Page(s):212 - 222
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1563 KB)

    Laboratory experiments to familiarise students with the principles of digital control structures, such as computer processors, have in the past been difficult to implement because of the quantity and complexity of the equipment needed. Many institutions have constructed small computers from MSI components, requiring 20¿¿30 hours of a student's time, and providing little, if any, scope for experime... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microcomputer system specification using interval logic and a modified labelled-net model

    Publication Year: 1986, Page(s):223 - 234
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1370 KB)

    The application of interval logic and modified labelled-net models for system specification and verification is introduced. By means of interval logic and modified labelled-net models, system properties involving time interval information can be specified and verified. In interval logic, derivation rules are used to obtain the criteria on the time relationships for the correct implementation of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel processing technique for inverting matrices with random sparsity

    Publication Year: 1986, Page(s):235 - 240
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (747 KB)

    Algorithms for ordering a sparse matrix A for parallel triangular factorisation and for obtaining the parallel inverse of A are given. The heuristic ordering method is based on graph manipulations. It attempts to minimise the completion time of parallel triangular factorisation while preserving the sparsity of the matrix. The inversion method proposed is based on the triangular factors of A. The t... View full abstract»

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