By Topic

Computers and Digital Techniques, IEE Proceedings E

Issue 5 • Date Sep 1993

Filter Results

Displaying Results 1 - 7 of 7
  • Compilation of process algebra expressions into delay-insensitive circuits

    Publication Year: 1993 , Page(s): 261 - 268
    Cited by:  Papers (1)
    Click to expandAbstract | PDF file iconPDF (476 KB)  

    The main advantage of delay-insensitive design of circuits is that it ensures that circuits function correctly independently of delays in their components and wires. Timing constraints do not have to be considered, which facilitates top-down design. Process algebras provide a suitable formalism for specification, design and verification of concurrent systems, but there are few methods for practica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved fractal geometry based texture segmentation technique

    Publication Year: 1993 , Page(s): 233 - 241
    Cited by:  Papers (11)
    Click to expandAbstract | PDF file iconPDF (772 KB)  

    The problem of natural texture segmentation is considered. The technique is based on four texture features derived using the fractal geometry of images. These four features are fractal dimension (FD) of the original image, FD of above average (high) gray level image, FD of below (low) gray level image, and multifractal of order two. A modified box-counting approach is proposed to estimate the FD a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic method for synthesising purely delay-insensitive circuits

    Publication Year: 1993 , Page(s): 269 - 276
    Click to expandAbstract | PDF file iconPDF (556 KB)  

    A novel model for specifying a delay-insensitive circuit is introduced, in which transition signals and two-phase communication convention are used. In this model, a circuit is described by various states. At each state, an input to the circuit not only produces an output, but also causes a corresponding state transition. Based on this model, a systematic method for synthesising purely delay-insen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm for node partitioning problem and applications in VLSI design

    Publication Year: 1993 , Page(s): 255 - 260
    Cited by:  Papers (2)
    Click to expandAbstract | PDF file iconPDF (460 KB)  

    The group of classical graph-theoretic problems, including graph colouring, clique cover, and maximal clique, may be viewed as instances of a general node partitioning problem (NPP). A wide variety of real life problems can be modelled as instances of NPP. Finding an optimal partition for the NPP is said to be NP-complete. A stochastic search by a genetic algorithm (GA) is employed to find a near ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-serial systolic array implementation of a multilayer perceptron

    Publication Year: 1993 , Page(s): 277 - 288
    Cited by:  Papers (4)
    Click to expandAbstract | PDF file iconPDF (760 KB)  

    The paper describes the implementation of a bit-serial systolic array architecture for a multilayer perceptron. It is shown that both the recall phase and learning phase can be mapped onto a similar systolic array structure, with minor differences. As a result, a combined systolic array structure is proposed for both the recall phase and the learning phase. The design is simulated using the FIRST ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solution of linear systems of equations in the presence of two transient hardware faults

    Publication Year: 1993 , Page(s): 247 - 254
    Click to expandAbstract | PDF file iconPDF (556 KB)  

    An algorithmic fault tolerant scheme is presented for the solution via LU decomposition of a linear system of equations in the presence of up to two transient hardware faults. In the general case, where the faults affect arbitrary entries in the coefficient matrix array, the methods are based on an application of the extended Euclidean algorithm scheme for decoding BCH and RS codes. In the special... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteeing the period of linear recurring sequences (mod 2e)

    Publication Year: 1993 , Page(s): 243 - 245
    Click to expandAbstract | PDF file iconPDF (240 KB)  

    Linear congruential recurrence relations modulo 2e are a very obvious way of producing pseudorandom integer sequences on digital signal processors. The maximum value possible for the period of such a sequence generated by an nth-order relation is (2n-1)2e-1. Such a relation can be specified by an nth-degree feedback polynomial f(x) with e-bit coefficients. Necessar... View full abstract»

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