SUMMARY In this work we consider optimized twiddle factor multipliers based on shift-and-add-multiplication. We propose a low-complexity structure for twiddle factors with a resolution of 32 points. Furthermore, we propose a slightly modified version of a previously reported multiplier for a resolution of 16 points with lower round-off noise. For completeness we also include results on optimal ...

This paper is an engineer-to-engineer note, to show a problematic point of long time DC measurements and show tips how to achieve higher accuracy there.. At long time measurements, rounding errors can seriously influence the output value. The problem is not just theoretical; our investigation is started because of a malfunctioning dilatation sensor system used at industrial turbines. We tried t...

Cluster Deletion and Cluster Editing ask to transform a graph by at most k edge deletions or edge edits, respectively, into a cluster graph, i.e., disjoint union of cliques. Equivalently, a cluster graph has no conflict triples, i.e., two incident edges without a transitive edge. We solve the two problems in time O∗(1.415k) and O∗(1.76k), respectively. These results round off our earlier work b...

Classicaly, the Hilbert class polynomial P∆ ∈ Z[X] of an imaginary quadratic discriminant ∆ is computed using complex analytic techniques. In 2002, Couveignes and Henocq [5] suggested a p-adic algorithm to compute P∆. Unlike the complex analytic method, it does not suffer from problems caused by rounding errors. In this paper we complete the outline given in [5] and we prove that, if the Genera...

A restarted Arnoldi algorithm is given that computes eigenvalues and eigenvectors. It is related to implicitly restarted Arnoldi, but has a simpler restarting approach. Harmonic and regular RayleighRitz versions are possible. For multiple eigenvalues, an approach is proposed that first computes eigenvalues with the new harmonic restarted Arnoldi algorithm, then uses random restarts to determine...

We consider the extent to which Markov chain convergence properties are affected by the presence of computer floating-point roundoff error. Both geometric ergodicity and polynomial ergodicity are considered. This paper extends previous work of Roberts, Rosenthal, and Schwartz (1998); connections between that work and the present paper are discussed.

In the modeling of a large class of problems in science and engineering, the minimization of a functional is appeared. Finding the solution of these problems needs to solve the corresponding ordinary differential equations which are generally nonlinear. In recent years He’s variational iteration method has been attracted a lot of attention of the researchers for solving nonlinear problems. This...

We consider a microstructure model for a financial asset, allowing for price discreteness and for a diffusive behavior at large sampling scale. This model, introduced by Delattre and Jacod, consists in the observation at the high frequency n, with round-off error αn, of a diffusion on a finite interval. We give from this sample estimators for different forms of the integrated volatility of the ...

This correspondence considers error analysis of blockimplemented 2-D digital filters. Expressions for error bound and meansquare error for roundoff error accumulation are derived using fixedpoint arithmetic, and compared with the results obtained usingordinary 2-D difference equations.