Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2008-05-20T18:32:10Z
dc.date.available 2008-05-20T03:00:00Z
dc.date.issued 2006-04
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/9513
dc.description.abstract Study deals with implementations of fixed-point division modules based on different algorithms on basis of Xilinx FPGAs. We show that our implementation of the nonrestoring algorithm is significantly faster and smaller than the 32-bit IP Core "Pipelined Divider" from Xilinx. For example, the speed of the 32-bit designed module is almost 245 MHz vs. 193 MHz from Xilinx divider. Moreover, high-speed parameterized modules are designed to provide arbitrary precision of the fixed-point division, for example, with 64-bit or 128-bit operands and large fixedpoint result. en
dc.format.extent 8-11 es
dc.language en es
dc.subject modular design en
dc.subject programmable logic en
dc.title Implementation of high-speed fixed-point dividers on FPGA en
dc.type Articulo es
sedici.identifier.uri http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr06-2.pdf es
sedici.identifier.issn 1666-6038 es
sedici.creator.person Sorokin, Nikolai es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Articulo es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc/3.0/
sedici.description.peerReview peer-review es
sedici2003.identifier ARG-UNLP-ART-0000000552 es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 6, no. 1 es


Descargar archivos

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)