Results 121 to 130 of about 1,550,711 (171)

Roundoff Error Problem of the Sytolic Array for DFT

IEEE Transactions on Signal Processing, 1993
[[abstract]]The roundoff error is inevitable in the VLSI implementation of the systolic array for the discrete Fourier transform (DFT). The roundoff error for DFT in both Kung's and Chang's systolic arrays are analyzed as proportional to N2, where N is ...
Long-Wen Chang
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

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.
Nikos Kanistras, Vassilis Paliouras
openaire   +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

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 distributions of significant digits and roundoff errors

Communications of the ACM, 1974
Generalized logarithmic law is derived for the distribution of the first t significant digits of a random digital integer. This result is then used to determine the distribution of the roundoff errors in floating-point operations, which is a mixture of uniform and reciprocal distributions.
openaire   +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.
Thomas E. Hull, J. Richard Swenson
openaire   +3 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

Roundoff Errors in Signal Averaging Systems

IEEE Transactions on Biomedical Engineering, 1986
In biomedical signal averaging applications where a small repetitive signal is to be extracted form a very noisy waveform (noise variance ?2n), the A/D converter range is set at ±A?n where A typically has a value of 3 or 4. In this case, A/D roundoff noise using a (b + 1)-bit A/D converter degrades the SNR of the resulting signal estimate by an amount ...
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   +3 more sources

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