๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

BKM: a new hardware algorithm for complex elementary functions

โœ Scribed by Bajard, J.-C.; Kla, S.; Muller, J.-M.

Book ID
119772231
Publisher
IEEE
Year
1994
Tongue
English
Weight
902 KB
Volume
43
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new elementary algorithm for proving q
A new elementary algorithm for proving q-hypergeometric identities
โœ Bao-Yin Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

We give a fast elementary algorithm to get a small number n 1 for an admissible q-proper- such that we can prove the identity by checking its correctness for n (n 0 โ‰ค n โ‰ค n 1 ). For example, we get n 1 = 191 for the q-Vandermonde-Chu identity, n 1 = 70 for a finite version of Jacobi's triple produc

A new algorithm for parallel thinning an
A new algorithm for parallel thinning and its hardware realization
โœ Xinlun Zhou; Jian Wei; Feng Li; Peng-Yung Woo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 97 KB

A new algorithm for template matching parallel thinning is proposed in this article. This algorithm is an improvement of the fast fully parallel thinning algorithm by producing more quality images. This article describes the details of the algorithm and its hardware realization. Experimental results