Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

IEE Proceedings - Computers and Digital Techniques

Issue 3 • May 2002

Filter Results

Displaying Results 1 - 6 of 6
  • Linear complexity of modified Jacobi sequences

    Publication Year: 2002, Page(s):97 - 101
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (469 KB)

    Legendre sequences are a well-known class of binary sequences, which possess good periodic and aperiodic autocorrelation functions. They are also known to exhibit high linear complexity, which makes them significant for cryptographic applications. Jacobi and modified Jacobi sequences are constructed by combining two appropriate Legendre sequences and they also have good correlation properties. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimisation algorithm for three-level mixed AND-OR-EXOR/AND-OR-EXNOR representation of Boolean functions

    Publication Year: 2002, Page(s):82 - 96
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1211 KB)

    The AND-OR-EXOR form of a logic function comprises a pair of sum-of-products expressions (groups) connected by a single EXOR operator, such that the result realises the function. This paper presents several fast AND-OR-EXOR optimisation algorithms based on our previous technique for AND-OR-EXOR minimisation. It has been observed using benchmarks that this technique is able to produce results faste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a tree algorithm to determine the average synchronisation delay of self-synchronising T-codes

    Publication Year: 2002, Page(s):79 - 81
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (422 KB)

    First proposed in 1984, T-codes are a class of variable-length codes that exhibit exceptional tendency towards self-synchronisation. A number of industrial applications have been reported, ranging from moving-picture images to boundary markers. A number of attempts have been made to quantify the synchronisation performance of different T-codes. The first complete analytical method for calculating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Densely packed decimal encoding

    Publication Year: 2002, Page(s):102 - 104
    Cited by:  Papers (30)  |  Patents (26)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (369 KB)

    Chen-Ho encoding is a lossless compression of three binary coded decimal digits into 10 bits using an algorithm which can be applied or reversed using only simple Boolean operations. An improvement to the encoding which has the same advantages but is not limited to multiples of three digits is described. The new encoding allows arbitrary-length decimal numbers to be coded efficiently while keeping... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organising networks in modelling experimental data in software engineering

    Publication Year: 2002, Page(s):61 - 78
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1399 KB)

    Experimental software datasets describing software projects in terms of their complexity and development time have been the subject of intensive modelling. A number of various modelling methodologies and detailed modelling designs have been proposed including neural networks and fuzzy models. The authors introduce self-organising networks (SON) that result from a synergy of fuzzy inference schemes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of new roll-forward recovery approach for distributed systems

    Publication Year: 2002, Page(s):105 - 112
    Cited by:  Papers (1)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (947 KB)

    A new roll-forward checkpointing scheme is proposed using basic checkpoints. The direct-dependency concept used in the communication-induced checkpointing scheme is applied to basic checkpoints to design a simple algorithm to find a consistent global checkpoint. Both blocking (i.e. when the application processes are suspended during the execution of the algorithm) and non-blocking approaches are p... View full abstract»

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