Complex Square Root with Operand Prescaling

Abstract : We propose a radix-$r$ digit-recurrence algorithm for complex square-root. The operand is prescaled to allow the selection of square-root digits by rounding of the residual. This leads to a simple hardware implementation. Moreover, the use of digit recurrence approach allows correct rounding of the result. The algorithm, compatible with the complex division, and its design are described at a high-level. We also give rough comparisons of its latency and cost with respect to implementation based on standard floating-point instructions as used in software routines for complex square root.
Type de document :
Communication dans un congrès
Sanjay Rajopadhye; Tobias Noll. Application-Specific Systems, Architectures and Processors, 2004., Sep 2004, Galveston, Texas, United States. IEEE Computer Society, pp.52-62, 2004, 〈10.1109/ASAP.2004.1342458〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00086852
Contributeur : Jean-Michel Muller <>
Soumis le : lundi 28 août 2006 - 10:45:06
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : lundi 5 avril 2010 - 22:15:56

Fichier

Identifiants

Collections

Citation

Jean-Michel Muller, Milos Ercegovac. Complex Square Root with Operand Prescaling. Sanjay Rajopadhye; Tobias Noll. Application-Specific Systems, Architectures and Processors, 2004., Sep 2004, Galveston, Texas, United States. IEEE Computer Society, pp.52-62, 2004, 〈10.1109/ASAP.2004.1342458〉. 〈ensl-00086852〉

Partager

Métriques

Consultations de la notice

222

Téléchargements de fichiers

115