The Experts below are selected from a list of 2649 Experts worldwide ranked by ideXlab platform
R W Brocato - One of the best experts on this subject based on the ideXlab platform.
-
integer multiplication with overflow detection or saturation
IEEE Transactions on Computers, 2000Co-Authors: M J Schuite, P I Balzola, A Akkas, R W BrocatoAbstract:High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative Representable Number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection or saturation.
M J Schuite - One of the best experts on this subject based on the ideXlab platform.
-
integer multiplication with overflow detection or saturation
IEEE Transactions on Computers, 2000Co-Authors: M J Schuite, P I Balzola, A Akkas, R W BrocatoAbstract:High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative Representable Number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection or saturation.
Haranath Kar - One of the best experts on this subject based on the ideXlab platform.
-
an improved criterion for the global asymptotic stability of fixed point state space digital filters with combinations of quantization and overflow
Digital Signal Processing, 2014Co-Authors: Neha Agarwal, Haranath KarAbstract:This paper deals with the problem of global asymptotic stability of fixed-point state-space digital filters under various combinations of quantization and overflow nonlinearities and for the situation where quantization occurs after summation only. Utilizing the structural properties of the nonlinearities in greater detail, a new global asymptotic stability criterion is proposed. A unique feature of the presented approach is that it exploits the information about the maximum normalized quantization error of the quantizer and the maximum Representable Number for a given wordlength. The approach leads to an enhanced stability region in the parameter-space, as compared to several previously reported criteria.
P I Balzola - One of the best experts on this subject based on the ideXlab platform.
-
integer multiplication with overflow detection or saturation
IEEE Transactions on Computers, 2000Co-Authors: M J Schuite, P I Balzola, A Akkas, R W BrocatoAbstract:High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative Representable Number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection or saturation.
A Akkas - One of the best experts on this subject based on the ideXlab platform.
-
integer multiplication with overflow detection or saturation
IEEE Transactions on Computers, 2000Co-Authors: M J Schuite, P I Balzola, A Akkas, R W BrocatoAbstract:High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative Representable Number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection or saturation.