Results 211 to 220 of about 43,945 (232)
Some of the next articles are maybe not open access.
On the Error-Free Computation of Fast Cosine Transform
2009We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the
Dimitrov, Vassil, Wahid, Khan
openaire +1 more source
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
2009Existing selfverifying solvers for dense linear (interval-) systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster than the existing solvers, without losing too much accuracy. This is achieved through two main changes.
Walter Krämer, Michael Zimmer 0002
openaire +1 more source
1997
A method of the calculation of a discrete convolution via number-theoretic transforms realized without multiplications is described. It is shown that the data representation over algebraic fields allows to generalize the known Mersennse and Fermat transforms onto a wider set of periods of transformed sequences.
Vladimir M. Chernov, Maria V. Pershina
openaire +1 more source
A method of the calculation of a discrete convolution via number-theoretic transforms realized without multiplications is described. It is shown that the data representation over algebraic fields allows to generalize the known Mersennse and Fermat transforms onto a wider set of periods of transformed sequences.
Vladimir M. Chernov, Maria V. Pershina
openaire +1 more source
Materials Science & Engineering A: Structural Materials: Properties, Microstructure and Processing, 2020
Mrinmoy Sinha
exaly
Mrinmoy Sinha
exaly
On the topological entropy of induced transformations for free semigroup action
Dynamical Systems, 2021exaly