In many high speed Digital Signal Processing (DSP) and multimedia applications, the multiplier plays a very important role because it dominates the chip power consumption and operation speed. In DSP applications, in order to avoid infinite growth of multiplication bit width, it is necessary to reduce the number of multiplication products. Cutting off n-bit Less Significant Bit (LSB) output can ...

This paper describes a new multilevel procedure which can solve the discrete Navier-Stokes system arising from finite volume discretisations on composite grids which may consist of more than one level. SIMPLE is used and tested as the smoother, but the multilevel procedure is such that it does not exclude the use of other smoothers. Local refinement is guided by a criterion based on an estimate...

High-order adaptive methods for fractional differential equations are proposed. The methods rely on a kernel compression scheme for the approximation and localization of the history term. To avoid complications typical to multistep methods, we focus our study on 1-step methods and approximate the local part of the fractional integral by integral deferred correction to enable high order accuracy...

Error estimates are a very important aspect of numerical integration. It is desirable to know what level of truncation error might be expected for a given number of integration points. Here, we determine estimates for the truncation error when Gauss-Legendre quadrature is applied to the numerical evaluation of two dimensional integrals which arise in the boundary element method. Two examples ar...

A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR loss on the AWGN channel, due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code’s free distance, especially at low Eb/No.

Truncated multipliers offers significant improvements in area, delay, and power. The proposed method finally reduces the number of full adders and half adders during the tree reduction. While using this proposed method experimentally, area can be saved. The output is in the form of LSB and MSB. Finally the LSB part is compressed by using operations such as deletion, reduction, truncation, round...