Fixed-point multiplication: a probabilistic bit-pattern view

The truncation error of fixed-point multiplication is commonly modelled as white noise with a uniform distribution. This paper shows the inaccuracy of this assumption by using a bitwise approach. A probabilistic bit-pattern analysis of the fixed-point multiplication is presented from which an accura...

Full description

Bibliographic Details
Main Authors: Ahmadi, Arash (Author), Zwolinski, Mark (Author)
Format: Article
Language:English
Published: 2011-04.
Subjects:
Online Access:Get fulltext
LEADER 01018 am a22001333u 4500
001 271707
042 |a dc 
100 1 0 |a Ahmadi, Arash  |e author 
700 1 0 |a Zwolinski, Mark  |e author 
245 0 0 |a Fixed-point multiplication: a probabilistic bit-pattern view 
260 |c 2011-04. 
856 |z Get fulltext  |u https://eprints.soton.ac.uk/271707/1/Multiplication_Noise_J15.pdf 
520 |a The truncation error of fixed-point multiplication is commonly modelled as white noise with a uniform distribution. This paper shows the inaccuracy of this assumption by using a bitwise approach. A probabilistic bit-pattern analysis of the fixed-point multiplication is presented from which an accurate probability model for the truncation error is derived. Using this PDF model, exact values for the mean and variance of the truncation error in the output of the fixed-point multiplication are formulated for the first time. The proposed PDF model, mean and variance values are compact and usable in word-length optimization algorithms. 
655 7 |a Article