By Topic

IEE Proceedings - Computers and Digital Techniques

Issue 3 • Date May 1996

Filter Results

Displaying Results 1 - 8 of 8
  • Fast algorithm and its systolic realisation for distance transformation

    Publication Year: 1996, Page(s):168 - 173
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (496 KB)

    Distance transformation has been widely applied to image matching and analysis. The hardware implementation of distance transformation is necessary because real-time (video rate) processing is required for most applications. The paper proposes a four-pass algorithm for distance transformation. Its computation complexity is the same as a two-pass raster scan algorithm but the data dependencies are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic DFT approach for pattern sensitive faults in word-oriented memories

    Publication Year: 1996, Page(s):199 - 202
    Cited by:  Papers (2)  |  Patents (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (384 KB)

    The testability problem of word-oriented memories (WOMs) for pattern sensitive faults is addressed. A novel design for testability (DFT) strategy allows efficient built-in self-testing (BIST) of WOMs. By proper selection of the memory array tiling scheme, it is possible to implement O(√n) BIST algorithms which test WOMs for various types of neighbourhood pattern sensitive faults (NPSFs). The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closed semiring connectionist network for the Bellman-Ford computation

    Publication Year: 1996, Page(s):189 - 195
    Cited by:  Papers (9)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (652 KB)

    The Bellman-Ford algorithm (R. Bellman, 1958; L.R. Ford, 1956) is well known for providing a dynamic programming solution for the shortest path problem. Alternatively, the closed semiring is an algebraic structure which unifies a family of path problems, including all pairs shortest path, transitive closure and minimum spanning tree, defined on directed or undirected graphs. The paper proposes a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of two common pipeline structures

    Publication Year: 1996, Page(s):161 - 167
    Cited by:  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (792 KB)

    Two pipeline structures that are employed in commercial microprocessors are examined. The first is the load-use interlock (LUI) pipeline, which employs an interlock to ensure correct operation during load-use hazards. The second is the address-generation interlock (AGI) pipeline. It eliminates the load-use hazard but has an address-generation hazard, which requires an address-generation interlock ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cellular automata based scheme for solution of Boolean equations

    Publication Year: 1996, Page(s):174 - 180
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (592 KB)

    The paper utilises a particular class of nongroup CA as a mathematical tool to derive solutions of XOR dominated Boolean equations. Some problems in digital circuits (such as logic synthesis, test pattern generation etc.) demand efficient schemes for the solution of Boolean equations. A large number of combinational benchmarks and real life circuits used in the fields of built in self test (BIST) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KGPMAP: library-based technology-mapping technique for antifuse based FPGAs

    Publication Year: 1996, Page(s):203 - 204
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (172 KB)

    S. Chattopadhyay et al. (1994) recently proposed a signature based library search mapper that is able to distinguish the nonequivalent functions with very low aliasing. The method uses an algebraic transformation of Boolean functions into the corresponding polynomial form and then characterises the polynomial by means of prime numbers. While the technique is very interesting the algebraic transfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modified Harn signature scheme based on factorising and discrete logarithms

    Publication Year: 1996, Page(s):196 - 198
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (244 KB)

    L. Harn (1994) proposed a digital signature scheme which was claimed to be unbreakable if the factorisation and the discrete logarithms are simultaneously unsolvable. The paper shows that `hackers' can forge the signatures of Harn schemes with high probabilities, if they can solve the discrete logarithms modulo α large prime number. The Harn signature scheme is modified to give it the same d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic evaluation strategy for fine-grain data-parallel computing

    Publication Year: 1996, Page(s):181 - 188
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (764 KB)

    The placement of elemental operations (as opposed to data) of a data driven data parallel computation in a network of processors is examined. A fast suboptimal algorithm is proposed for such placement which tends to minimise the overall network load when the computation is essentially nonlocal. The cases of grid, torus and hypercube topology are considered. It is shown that the proposed algorithm,... View full abstract»

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