Results 131 to 140 of about 7,065 (184)

Impact of roundoff errors in LDPC decoding

2008 3rd International Symposium on Wireless Pervasive Computing, 2008
In this paper the impact of roundoff mechanisms on the performance of message-passing LDPC decoding is studied. It is shown that finite word length introduces error by means of two mechanisms, each of which is analyzed. The impact and behavior of the two mechanisms are clarified by experimental results.
V Paliouras
exaly   +2 more sources

Tests of probabilistic models for propagation of roundoff errors

Communications of the ACM, 1966
In any prolonged computation it is generally assumed that the accumulated effect of roundoff errors is in some sense statistical. The purpose of this paper is to give precise descriptions of certain probabilistic models for roundoff error, and then to describe a series of experiments for testing the validity of these models.
T E Hull
exaly   +3 more sources

Roundoff errors in block-floating-point systems

IEEE Transactions on Signal Processing, 1996
Block-floating-point representation is a special case of floating-point representation, where several numbers have a joint exponent term. In this paper, roundoff errors in signal processing systems utilizing block-floating-point representation are studied. Special emphasis is on analysis of quantization errors when data is quantized to a block-floating-
J Astola
exaly   +2 more sources

Algorithms for roundoff error analysis —A relative error approach

Computing, 1980
Methods are presented for performing various error analyses of numerical algorithms. These analyses include forward, backward, and B-analysis (a combination of forward and backward). These analyses additionally provide alternative criteria by which different algorithms that solve the same problem may be compared.
John L. Larson, Ahmed H. Sameh
openaire   +1 more source

An approach to eliminate roundoff errors in digital filters

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
"Second-order quantizers" are introduced which can be used for implementing recursive digital filters with practically no roundoff errors or limit-cycle oscillations. Based on the idea of changing the transfer function used to compute roundoff errors, these quantizers save the low-order bits to correct the product at future iterations. For several pole
A Abu-El-Haija
exaly   +2 more sources

Quantization and Roundoff Errors

1989
A one-dimensional (1-D) digital filter, as noted in Section 1.3, is generally defined by $${y_n} = \sum\limits_{i = 0}^M {{a_i}{u_{n - i}}} - \sum\limits_{i = 1}^N {{b_i}{y_{n - i}}} $$ (5.1) where {u n } is the input sequence, {y n } is the output sequence, and a i , and b i are some constants.
Robert King, Majid Ahmadi, Raouf Gorgui-Naguib, Alan Kwabwe, Mahmood Azimi-Sadjadi   +4 more
openaire   +1 more source

On the statistics of fixed-point roundoff error

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
Roundoff error after fixed-point multiplication is commonly modeled as uniformly distributed white noise that is uncorrelated with the signal. This paper presents a statistical analysis of fixed-point roundoff error that identifies the conditions under which this model is valid, and examines the statistical behavior of roundoff error when these ...
Casper W. Barnes, Boi N. Tran, Shu Hung Leung   +2 more
exaly   +2 more sources

On fixed-point roundoff error analysis

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
The author points out the existence of work published by the author (US Dept. of Commerce, Tech. Rep. AD-A086826, 57 pp., Apr. 1980) prior to the appearance of the paper by Barnes et al. (ibid., vol.ASSP-33, p.595-606, June 1985) covering the same subject. >
openaire   +1 more source

Symplectic Integrators: Rotations and Roundoff Errors

Celestial Mechanics and Dynamical Astronomy, 1998
We investigate the numerical implementation of a symplectic integrator combined with a rotation (as in the case of an elongated rotating primary). We show that a straightforward implementation of the rotation as a matrix multiplication destroys the conservative property of the global integrator, due to roundoff errors.
openaire   +2 more sources

On Local Roundoff Errors in Floating-Point Arithmetic

Journal of the ACM, 1973
A bound on the relative error in floating-point addition using a single-precision accumulator with guard digits is derived. It is shown that even with a single guard digit, the accuracy can be almost as good as that using a double-precision accumulator.
Toyohisa Kaneko, Bede Liu
openaire   +2 more sources