By Topic

Computers and Digital Techniques, IEE Proceedings E

Issue 2 • Date Mar 1991

Filter Results

Displaying Results 1 - 6 of 6
  • Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

    Page(s): 85 - 92
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (588 KB)  

    Reed-Muller canonical networks are known to be easily testable implementations of logical functions. The authors present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. They also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter procedure avoids exponentially long minterm representations, and hence alleviates some of the difficulties in applying spectral synthesis procedures to large Boolean functions. Both of these procedures are suitable for automation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for generating optimal tests for exclusive-OR networks

    Page(s): 93 - 96
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (396 KB)  

    An algorithm is presented for generating minimal-cardinality test sets for logic networks composed of exclusive-OR gates arranged in a structure that can be described in the form of a connected acyclic graph. It is assumed that 2" unique input combinations are required to test an n-input (n>or=2) exclusive-OR gate. The algorithm requires no lookup tables. The method is suitable for automation but can also be performed manually even for large networks'. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on systematic procedure for test generation of PAL based circuits

    Page(s): 106 - 108
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (188 KB)  

    Comments on the test generation algorithm 1 given in a previous paper (see ibid., vol.136, no.2, p.142-9 (1989)), for single S-fault detection are presented. It is shown that the test vectors belonging to the test set generated by algorithm 1 can not detect certain faults. To generate a test set T, detect all single faults in a given PAL modification to the algorithm 1 is suggested. Furthermore, it is shown that some of the conclusions drawn on multiple fault detection capabilities of a single fault test set T discussed in Section 7 of that paper do not hold good in the presence of certain multiple faults with a four way masking cycle. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image registration using an image graph and its application to map matching

    Page(s): 79 - 84
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (440 KB)  

    A representation of line images by an algebraic expression is proposed and image registration between two maps by use of matching of the line segments is discussed using this expression. In this method, input map images are transformed into line images in which line segments are expressed by piecewise linear lines using unit vectors. Next, the structure of the line images is represented by image graphs. The matching process makes use of a degree of the structural similarity between nodes using the image graphs. The results of the computer simulations show that the approach is insensitive to scaling, rotation and grey level modification of the map image and effective to the matching of the real map images. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypercube concurrent processor implementation of a position invariant object classifier

    Page(s): 73 - 78
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (444 KB)  

    A position-invariant fast object classification scheme is described. The grey-level image of objects is converted to binary form and a parallel region growing techniques is employed to detect objects. A 2-D fast Fourier transform (FFT) is applied to each object region after translating the origin of the image co-ordinate system to the object centre and aligning the image co-ordinate axes with the object principal axes. The first five components from the principal lobe of the Fourier spectrum of each object are selected as characteristic features for minimum-distance object classification. For time efficiency, region growing and 2-D FFT computations were performed on a 16-node hypercube processor. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic search approach to shape matching in image sequences

    Page(s): 97 - 105
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (824 KB)  

    The problem of detecting correspondences between object contours belonging to successive image frames of a dynamic scene is addressed. The object contours are represented using concave, convex, and straight line segments which are extracted after smoothing the contour with a Gaussian kernel. The matching problem is tackled using heuristic search with a state space formulation. An admissible heuristic function is designed for guiding the search. Experimental results are presented to demonstrate the capabilities of the method. View full abstract»

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