✦ LIBER ✦

The bit-complexity of arithmetic algorithms

✍ Scribed by V Pan

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 953 KB
Volume: 2
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(81)90016-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bit-operation complexity of approxim

The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

✍ V. Pan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.

The bit complexity of the predecessor pr

The bit complexity of the predecessor problem

✍ Y. Afek; M. Cohen; E. Haalman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 348 KB

A tight bound of 2n -1 bits on the communication complexity of the "predecessor" problem in a synchronous ring (previously known as the "last in a synchronous ring" problem) is presented. @ 1997 Elsevier Science B.V.

Bit complexity of matrix products

✍ Andrzej Lingas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 704 KB

The bit complexity of matrix multiplicat

The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms

✍ V.Y. Pan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 869 KB

The numbers of bit operations (br) required for matrix multiplication (MM), matrix inversion (MI). the evaluation of the determinant of a matrix (Det). and the solution of a system of linear equations (SLE) are estimated from above and below. (For SLE the estimates are nearly sharp.) The bit-complex

On the arithmetic complexity of matrix K

On the arithmetic complexity of matrix Kronecker powers

✍ Gadiel Seroussi; Fai Ma 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 118 KB

Low complexity bit allocation algorithm

Low complexity bit allocation algorithm for OFDM systems

✍ Changwook Lee; Gi J. Jeon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A bit allocation algorithm is presented for orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic–geometric means inequality. Consequ