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...
Main Authors: | Ahmadi, Arash (Author), Zwolinski, Mark (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2011-04.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
16-Bit Fixed-Point Number Multiplication With CNT Transistor Dot-Product Engine
by: Sungho Kim, et al.
Published: (2020-01-01) -
Fixed points of mappings with diminishing probabilistic orbital diameters
by: Irshad Aalam, et al.
Published: (2010-04-01) -
Some fixed point results in probabilistic Menger space
by: Maryam Shams, et al.
Published: (2017-04-01) -
Improvement and Discussion of MFCC Algorithm on 32-bit Fixed-point Processors
by: Yi-Hung Edward Chen, et al.
Published: (2006) -
Speech Recognition on 32-bit Fixed-point Processors:Implementation & Discussions
by: Chin-Lung Hart Su, et al.
Published: (2005)