Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

Computers and Digital Techniques, IEE Proceedings -

Issue 2 • Date Mar 2002

Filter Results

Displaying Results 1 - 4 of 4
  • Incomplete reduction in modular arithmetic

    Publication Year: 2002 , Page(s): 46 - 52
    Cited by:  Papers (8)  |  Patents (10)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (705 KB)  

    The authors describe a novel method for obtaining fast software implementations of the arithmetic operations in the finite field GF(p) with an arbitrary prime modulus p of arbitrary length. The most important feature of the method is that it avoids bit-level operations which are slow on microprocessors and performs word-level operations which are significantly faster. The proposed method has appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic simulation methods for longest path delay estimation

    Publication Year: 2002 , Page(s): 53 - 59
    Cited by:  Papers (4)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (767 KB)  

    Two original methods are proposed for digital circuit delay estimation with logic simulation: direct circuit simulation (DCS) and inverse circuit simulation (ICS). With only one run of the logic simulator, the DCS method evaluates the longest path delay for each signal in the circuit for both rising and falling edges. If the delay to some primary output is too long to meet with the required circui... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional complexity estimation for large combinational circuits

    Publication Year: 2002 , Page(s): 39 - 45
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (676 KB)  

    A disjoint cube-based method for the fast computation of M.G. Karpovsky's (1976, 1977) functional complexity measure is presented. A modification to the method for generating a disjoint sum-of-cubes representation for a combinational system is also presented, which results in improved speed performance in the generation of disjoint sums of cubes. The proposed algorithms are tested on several bench... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Branch prediction using both global and local branch history information

    Publication Year: 2002 , Page(s): 33 - 38
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (594 KB)  

    As the pipeline depth and issue rate of high-performance superscalar processors increase, the importance of an excellent branch predictor becomes more crucial to delivering the potential performance of a wide-issue, deep pipelined processor. Conventional two-level branch predictors predict the outcome of a branch either based on the local branch history information, comprising the previous outcome... View full abstract»

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