By Topic

IEE Proceedings E - Computers and Digital Techniques

Issue 2 • March 1989

Filter Results

Displaying Results 1 - 9 of 9
  • Fast parallel algorithm for all-pairs shortest path problem and its VLSI implementation

    Publication Year: 1989, Page(s):85 - 89
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Present a new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm (B.P. Sinha et al. IEEE Trans. Comput. vol.C-35, no.11, p.1000-4, 1986) for the same problem. Next the authors propose a suitable VLSI systolic architecture to map the algorithm and evaluate the performance of the proposed architectu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal flow control of end-to-end packet-switched network with random routing

    Publication Year: 1989, Page(s):90 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (833 KB)

    The problem of optimal flow control of a general queueing network with random routing as a model of virtual circuit or datagram computer communication networks is presented by approximating the general channel transmission-time distributions by a maximum entropy model with known first-two moments. A Norton-maximum entropy algorithm is used to facilitate the optimisation process. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improvement on Aberth's method for choosing initial approximations to zeros of polynomials

    Publication Year: 1989, Page(s):101 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (513 KB)

    Concerns a method for choosing the initial approximations to the zeros of a polynomial. Methods for finding all the zeros of a polynomial simultaneously, which can be considered modified Newton Methods, have been reported by quite a few authors. The initial approximations for these simultaneous methods take much CPU-time to find all the zeros of a polynomial, since CPU time depends mostly on the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational complexity of test generation for ETG PLAs

    Publication Year: 1989, Page(s):107 - 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB)

    In a wide sense, easy test generation (ETG) circuits can be considered as design for testability (DFT) circuits. However most of the DFT techniques presented so far in the literature are attempts to ease test application. Major disadvantages with these DFT techniques are degradation of circuit performance, and often the requirement of a long and continuous test mode. However, an ETG circuit attemp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and synthesis of bent sequences

    Publication Year: 1989, Page(s):112 - 123
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (982 KB)

    Presents an analysis and synthesis of bent sequences in the Hadamard domain. It is shown that the basic bent sequence of length 4/sup k/ is threshold realizable using 3/sup k/ nonzero weights and the realisation of arbitrary bent sequences is also discussed.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of partially occluded 3D objects

    Publication Year: 1989, Page(s):124 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1986 KB)

    Recognition of partially-occluded three dimensional (3D) objects is an essential task for many industrial applications of machine vision. The authors tackle the problem of 3D object recognition using depth map representations. The method consists of two stages: the first is a subtemplate matching scheme that breaks down the object to be recognised into surface patches, called subtemplates, for mat... View full abstract»

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

    Publication Year: 1989, Page(s):142 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Programmable array logic (PAL) devices can be used for realising both combinational and sequential circuits. The final behaviour of a PAL chip is determined by the fuse pattern in this chip. The paper presents a systematic procedure for generating a minimal test set to examine whether a programmed chip functions as expected. The upper bound of the size of a test set generated by the proposed proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DMKS: system kernal for multimedia integration

    Publication Year: 1989, Page(s):150 - 155
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (575 KB)

    Presents the design of the distributed multimedia kernel system (DMKS) developed for supporting multimedia applications based on a distributed approach. It adopts the device independent GKS concepts and extends them to include images and text from databases using a reference method, so that it is not necessary for the application program to have direct contact with the actual contents. The task of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RBCD: redundant binary coded decimal adder

    Publication Year: 1989, Page(s):156 - 160
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (449 KB)

    The major advantage of the binary coded decimal (BCD) system is in providing rapid binary-decimal conversion. The shortcoming of the BCD system is that BCD arithmetic operations are often slow and require complex hardware. The performance of BCD operations can be improved through a redundant binary coded decimal (RBCD) representation which leads to carry-free operations. This paper introduces the ... View full abstract»

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