By Topic

IEE Proceedings - Computers and Digital Techniques

Issue 4 • Date July 2000

Filter Results

Displaying Results 1 - 14 of 14
  • Multiparty key agreement protocols

    Publication Year: 2000, Page(s):229 - 236
    Cited by:  Papers (7)  |  Patents (7)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (976 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a unified arithmetic processor based on redundant constant-factor CORDIC with merged scaling operation

    Publication Year: 2000, Page(s):297 - 303
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (540 KB)

    An arithmetic processor is designed based on redundant constant-factor implementation of the coordinate rotation digital computer (CORDIC) algorithm with three different modes: circular, hyperbolic and linear. Both CORDIC types (angle calculation and vector rotation) are considered in this unified processor that is capable of computing a wide variety of arithmetic and elementary functions includin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low power architecture for floating point MAC fusion

    Publication Year: 2000, Page(s):288 - 296
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (824 KB)

    With the proliferation of floating point computing applications, the demand for high performance, low power floating point hardware has increased. A new architecture for low power floating point multiply-accumulate fusion is presented. The proposed architecture minimises power consumption through transition activity scaling and data path simplifications. The switching activity function of the prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RNS-based logarithmic adder

    Publication Year: 2000, Page(s):283 - 287
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (324 KB)

    The operation of logarithmic addition has always been burdened with large volumes of look-up tables. Therefore with a goal of reducing the ROM size required, an elegant and novel technique for logarithmic addition using the residue number system is demonstrated. To formulate this technique, the properties of finite fields and finite rings are exploited. A multiple-base logarithm is defined first, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of fast high-radix SRT dividers and their VLSI implementation

    Publication Year: 2000, Page(s):275 - 282
    Cited by:  Papers (1)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (632 KB)

    Division accounts for a significant fraction of the total arithmetic operations, and most implementations for the division are based on the SRT algorithm that uses a recurrence producing one quotient digit for each step. The complexity of the quotient-digit selection process can be simplified significantly by using a look-up table, referred to as the quotient-digit selection table (QST). However, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated fault-tolerant multicast and anycast routing algorithms

    Publication Year: 2000, Page(s):266 - 274
    Cited by:  Papers (4)  |  Patents (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (948 KB)

    Anycast is a new communication service defined in IPv6 (Internet Protocol Version 6 for the next generation). An anycast message is the one that should be delivered to the `nearest' member in a group of designated recipients. Anycast and multicast mechanisms may be integrated to provide better services. A group of replicated (or mirrored) servers that provides anycast service may also provide mult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient algorithm for computing the Luc chain

    Publication Year: 2000, Page(s):263 - 265
    Cited by:  Papers (5)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (256 KB)

    Since Lucas functions were introduced for designing public key cryptosystems and digital signatures in cryptography, the question of how to speed up their computation has attracted more attention. The fastest algorithm for computing the Lucas function, that we are aware of, was proposed by Yen and Laih. The authors now propose a more efficient algorithm for computing the Lucas function. It is show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysing and reducing the protocol overheads of MPOA in the intra-IASG communication

    Publication Year: 2000, Page(s):255 - 262
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (736 KB)

    The MPOA protocol adopts LANL for the Intra-IASG Communication. In the paper, the authors discuss the advantages and the disadvantages of MPOA and explain why LANE is a performance bottleneck in the Intra-IASG Communication and the Inter-IASG Communication. To verify their ideas, they benchmark the performance of LANE and IPOA. The results show IPOA is more scaleable than LANE when bandwidths incr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast BBS-sequence generation using Montgomery multiplication

    Publication Year: 2000, Page(s):252 - 254
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (288 KB)

    VLSI modules are proposed for fast, efficient generation of high-throughput Blum-Blum-Shub (BBS) and BBS-like sequences using Montgomery multiplication, where postprocessing associated with Montgomery's algorithm can be eliminated View full abstract»

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

    Publication Year: 2000, Page(s):241 - 251
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (732 KB)

    Quadratic residue and twin prime sequences are well known types of binary sequence with ideal periodic autocorrelation functions. These are just special cases of much larger families of sequences referred to here as Legendre sequences and modified Jacobi sequences. Although these more general forms are suboptimal and do not have ideal autocorrelation functions, nevertheless they do exhibit out-of-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of T-codes with minimal average synchronisation delay

    Publication Year: 2000, Page(s):229 - 236
    Cited by:  Papers (9)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (324 KB)

    A class of multiparty key agreement protocols based on secret sharing is presented. The trust infrastructure necessary to achieve the intended security goals is discussed. Entity authentication is suggested to be replaced by a less expensive group authentication. Two key agreement protocols are discussed. The first is the group key agreement where all principals must be active to call the conferen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accurate data path models for fast RT-level power estimation

    Publication Year: 2000, Page(s):209 - 214
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (576 KB)

    A methodology is presented for RT-level power estimation using cycle-accurate power models of common components, exploiting their functionality, regularity, and symmetry. The proposed methodology consists of three steps: creation of a set of look-up tables of primitive blocks, creation of a C power model for each data path component, estimation of power consumption of an RT-level circuit using a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical bubble-sorting-based non-Manhattan channel routing

    Publication Year: 2000, Page(s):215 - 220
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (568 KB)

    For a bubble-sorting-based non-Manhattan channel routing (BSNMCR) problem, Chen's O(k2n) optimal algorithm and Yan's O(kn) optimal algorithm have been proposed respectively where n is the number of terminals and k is the number of routing tracks in a channel. For the sorting process of a given vector, these two optimal algorithms consider that a left-swap pass or a right-swap pass is an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protecting data compression: Arithmetic coding

    Publication Year: 2000, Page(s):221 - 228
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (824 KB)

    Data-compression implementations are particularly sensitive to internal faults because most inherent redundancy in the input data is minimised by the source-coding process. Fault-tolerance techniques are presented for protecting a lossless compression algorithm, arithmetic coding, that is vulnerable to temporary hardware failures. The fundamental arithmetic operations are protected by low-cost res... View full abstract»

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