作者:
KORNERUP, PDept. of Math. & Comput. Sci.
Odense Univ. Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
The problem of digit set conversion for fixed radix is investigated for the case of converting into a non redundant, as well as into a redundant, digit set. Conversion may he from very general digit sets, and covers a...
详细信息
The problem of digit set conversion for fixed radix is investigated for the case of converting into a non redundant, as well as into a redundant, digit set. Conversion may he from very general digit sets, and covers as special cases multiplier recodings, additions, and certain multiplications. We generalize known algorithms for conversions into non redundant digit sets, as well as apply conversion to generalize the O(log) time algorithm for conditional sum addition using parallel prefix comput.tion, and a comparison is made with standard carry-lookahead techniques. Examples on multi-operand addition are used to illustrate the generality of this approach. O(1) time algorithms for converting into redundant digit sets are generalized based on a very simple lemma, which provides a framework for all conversions into redundant digit sets. Applications in multiplier recoding and partial product accumulation are used here as exemplifications.
A summary of the theoretical and comput.tional approaches to rough surface scattering is presented. For the Dirichlet problem new comput.tional results are presented for the behaviour of the normal derivative of the f...
A summary of the theoretical and comput.tional approaches to rough surface scattering is presented. For the Dirichlet problem new comput.tional results are presented for the behaviour of the normal derivative of the field on the surface as well as the behaviour of coherent and incoherent intensities as a function of angle and surface height. Examples are given for surface reconstruction using scattered data as a function of surface height and as the scattered data window is narrowed.
作者:
KORNERUP, PDept. of Math. & Comput. Sci.
Odense Univ. Denmark Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for unsigned or 2' complement operands. Each cell produces two digit-product terms and accumu...
详细信息
A very simple multiplier cell is developed for use in a linear, purely systolic array forming a digit-serial multiplier for unsigned or 2' complement operands. Each cell produces two digit-product terms and accumulates these into a previous sum of the same weight, developing the product least significant digit first. Grouping two terms per cell, the ratio of active elements to latches is low, and only [n/2] cells are needed for a full n by n multiply. A modulo-multiplier is then developed by incorporating a Montgomery type of modulo-reduction. Two such multipliers interconnect to form a purely systolic modulo exponentiator, capable of performing RSA encryption at very high clock frequencies, but with a low gate count and small area. It is also shown how the multiplier, with some simple back-end connections, can comput. modular inverses and perform modular division for a power of two as modulus.
Here we propose a new anisotropic acoustic wave equation based on the same dispersion relation as Alkhalifah's (2000), but introducing an auxiliary function which allows the original fourth-order differential equa...
详细信息
Here we propose a new anisotropic acoustic wave equation based on the same dispersion relation as Alkhalifah's (2000), but introducing an auxiliary function which allows the original fourth-order differential equation to become a coupled system of lower-order differential equations. Of these two equations, one equation can be considered as a hyperbolic wave equation for elliptical anisotropy, but with a correction term that compensates for the loss of anisotropy for VTI media, while the other can be considered as the additional expansion or contraction of the wavefront in the lateral directions. This two-way anisotropic wave equation can be used for both modeling and reverse-time migration. The new anisotropic acoustic equation has the obvious physical meaning and is much easier to implement. Impulse responses for both modeling and migration have been shown to validate the proposed anisotropic acoustic equation. Copyright 2006, European Association of Geosci.ntists and Engineers.
Some performance simulation results of a remote-positioning system on a multitarget real-time context for oceanic instruments tracking are discussed and several indicators are considered to fine-tune the system's ...
We focus on the issue of retrieving software from a collection of reusable software components. The proposed method is a variation of the relevance feedback process, a popular retrieval mechanism typically used for te...
详细信息
An algorithm for simultaneous comput.tion of the adjoint G(s) and determinant d(s) of the matrix polynomial s2J-sA 1-A 2 is presented, where J is a singular matrix. Both G(s) and d(s) are expressed relative to a basis...
详细信息
An algorithm for simultaneous comput.tion of the adjoint G(s) and determinant d(s) of the matrix polynomial s2J-sA 1-A 2 is presented, where J is a singular matrix. Both G(s) and d(s) are expressed relative to a basis of Laguerre orthogonal polynomials. This algorithm is a new extension of Leverrier-Fadeev algorithm..
Several strategies have been proposed for routing in a low Earth orbit (LEO) satellite system. Some of them are based on the Internet protocol (IP) and a few on asynchronous transfer mode (ATM) switching. However, iss...
详细信息
作者:
BARBOUR, AEDept. of Math. & Comput. Sci.
Georgia Southern Univ. Statesboro GA USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
This paper investigates the optimization problem of a general approach for designing fault-tolerant circuits. The gate minimization problem is solved so that optimal design with respect to the numbers of gates and lev...
详细信息
This paper investigates the optimization problem of a general approach for designing fault-tolerant circuits. The gate minimization problem is solved so that optimal design with respect to the numbers of gates and levels is obtained. The concept and properties of block design are used to formulate, solve, and construct the optimal form. The gate minimization problem of a fault-tolerant circuit is formulated and a lower bound to the number of minimum gates for any design is established. For certain design parameters, explicit minimum solutions are given. When no minimum solution is found, sets of explicit block designs which produce near minimum designs are characterized. In both cases, minimum and near minimum algorithms which generate the blocks required to construct the logic for fault-tolerant circuits in linear times are devised. If a block design does not have any connection with the minimum or near minimum classes, an approximation algorithm which generates near minimum blocks in a polynomial time is suggested. The minimization techniques devised in this paper are more efficient than the minimization techniques developed to minimize the number of gates in a general switching circuit.
The linear algebraic approach to queueing theory is applied to analyze the performance of a typical single-bus multiprocessor system. This system can be modeled as an M/G/1//N queueing system with load-dependent arriv...
详细信息
The linear algebraic approach to queueing theory is applied to analyze the performance of a typical single-bus multiprocessor system. This system can be modeled as an M/G/1//N queueing system with load-dependent arrivals. The method presented requires only that the nonexponential service time distribution for the system be a matrix-exponential, that is, one with a rational Laplace transform. Using linear algebraic techniques, expressions are obtained for the performance characteristics of interest, such as the processing power for the multiprocessor system. The algorithm does not rely on root finding and can be implemented using symbolic programming techniques. The explicit closed form expression for the processing power is presented for some special cases.
暂无评论