Sciweavers

    21 search results - page 1 / 5
    » Hardware starting approximation for the square root operatio...
    Sort
    View
    ARITH
    1993
    IEEE
    104views Applied Computing» more  ARITH 1993»
    Hardware starting approximation for the square root operation
    13 years 9 months ago
    Hardware starting approximation for the square root operation
    Download  www.acsel-lab.com
    Eric M. Schwarz, Michael J. Flynn
    claim paper
    Read More »
    ASAP
    2005
    IEEE
    142views Hardware» more  ASAP 2005»
    Decimal Floating-Point Square Root Using Newton-Raphson Iteration
    13 years 10 months ago
    Decimal Floating-Point Square Root Using Newton-Raphson Iteration
    Download  mesa.ece.wisc.edu
    With continued reductions in feature size, additional functionality may be added to future microprocessors to boost the performance of important application domains. Due to growth...
    Liang-Kai Wang, Michael J. Schulte
    claim paper
    Read More »
    ARITH
    1999
    IEEE
    103views Applied Computing» more  ARITH 1999»
    High-Speed Inverse Square Roots
    13 years 9 months ago
    High-Speed Inverse Square Roots
    Download  mesa.ece.wisc.edu
    Inverse square roots are used in several digital signal processing, multimedia, and scientific computing applications. This paper presents a high-speed method for computing invers...
    Michael J. Schulte, Kent E. Wires
    claim paper
    Read More »
    DSD
    2008
    IEEE
    91views Hardware» more  DSD 2008»
    A New Rounding Algorithm for Variable Latency Division and Square Root Implementations
    13 years 7 months ago
    A New Rounding Algorithm for Variable Latency Division and Square Root Implementations
    Download  www.ac.usc.es
    The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
    D. Piso, Javier D. Bruguera
    claim paper
    Read More »
    TC
    2008
    109views Information Technology» more  TC 2008»
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    13 years 5 months ago
    Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
    Download  eprint.iacr.org
    In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
    Francisco Rodríguez-Henríquez, Guill...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.