An improved convergence algorithm to compute ln(x) – FPGA implementations
This paper presents FPGA implementations of classical algorithms for computing ln(x) with some improvement at the level of the multiplication steps, and step skipping techniques. One starts from a practical implementation of ln(x) computation using a convergence method. The function is approximated...
Guardado en:
| Autores principales: | Bioul, Géry Jean Antoine, Vázquez, Martín Osvaldo, Acosta, Martín Oriol |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2007
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21591 |
| Aporte de: |
Ejemplares similares
-
Step skipping acceleration techniques on recursive logical circuits : Practical implementations on FPGA
por: Vázquez, Martín Osvaldo, et al.
Publicado: (2008) -
Improving evolutionary algorithms performance by extending incest prevention
por: Alfonso, Hugo, et al.
Publicado: (1998) -
Incest prevention and multirecombination in evolutionary algorithms to deal with the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000) -
Contrasting main selection methods in genetic algorithms
por: Alfonso, Hugo, et al.
Publicado: (1998) -
Telecommunications convergence : bridging the gap between technologies and services /
por: Shepard, Steven
Publicado: (2002)