Suchergebnisse - fast inverse square root algorithm
-
1
A Modification of the Fast Inverse Square Root Algorithm
ISSN: 2079-3197, 2079-3197Veröffentlicht: Basel MDPI AG 01.09.2019Veröffentlicht in Computation (01.09.2019)“… –Raphson corrections with modified coefficients. As compared to the original fast inverse square root code, the new algorithm is two-times more accurate in the case of one Newton …”
Volltext
Journal Article -
2
Modified Fast Inverse Square Root and Square Root Approximation Algorithms: The Method of Switching Magic Constants
ISSN: 2079-3197, 2079-3197Veröffentlicht: MDPI AG 01.02.2021Veröffentlicht in Computation (01.02.2021)“… In contrast, this article proposes a simple modification of the fast inverse square root method that has high accuracy and relatively low latency …”
Volltext
Journal Article -
3
Improving the Accuracy of the Fast Inverse Square Root by Modifying Newton–Raphson Corrections
ISSN: 1099-4300, 1099-4300Veröffentlicht: Switzerland MDPI AG 09.01.2021Veröffentlicht in Entropy (Basel, Switzerland) (09.01.2021)“… We present improved algorithms for fast calculation of the inverse square root function for single-precision and double-precision floating-point numbers …”
Volltext
Journal Article -
4
Comparison of Fast Inverse Square Root Algorithms for 3D Object Rendering using Ray Tracing
Veröffentlicht: IEEE 22.01.2022Veröffentlicht in 2022 2nd International Conference on Information Technology and Education (ICIT&E) (22.01.2022)“… The purpose of this paper is to give an insight on the fast inverse square root that is used to compute the inverse square root of a floating-point number to normalize vector that is necessary in many …”
Volltext
Tagungsbericht -
5
Improving the accuracy of the fast inverse square root algorithm
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.02.2018Veröffentlicht in arXiv.org (17.02.2018)“… We present improved algorithms for fast calculation of the inverse square root for single-precision floating-point numbers …”
Volltext
Paper -
6
Hardware architecture design and mapping of 'Fast Inverse Square Root' algorithm
Veröffentlicht: IEEE 01.01.2014Veröffentlicht in 2014 International Conference on Advances in Electrical Engineering (ICAEE) (01.01.2014)“… The Fast Inverse Square Root algorithm has been used in 3D games of past for lighting and reflection calculations, because it offers up to four times performance gains …”
Volltext
Tagungsbericht -
7
Pseudo-Normalization via Integer Fast Inverse Square Root and Its Application to Fast Computation without Division
ISSN: 2079-9292, 2079-9292Veröffentlicht: Basel MDPI AG 01.08.2024Veröffentlicht in Electronics (01.08.2024)“… Based on this, there is a well-known method referred to as the fast inverse square root (FISR …”
Volltext
Journal Article -
8
Fast enclosure for a matrix inverse square root
ISSN: 0024-3795, 1873-1856Veröffentlicht: Elsevier Inc 15.02.2015Veröffentlicht in Linear algebra and its applications (15.02.2015)“… A fast algorithm for computing an interval matrix containing the inverse square root of an n …”
Volltext
Journal Article -
9
An Improved Square-Root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization
ISSN: 1536-1276Veröffentlicht: New York, NY IEEE 01.01.2011Veröffentlicht in IEEE transactions on wireless communications (01.01.2011)“… A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layered Space-Time architecture (V-BLAST …”
Volltext
Journal Article -
10
Hardware Implementation of Approximate Fixed-point Divider for Machine Learning Optimization Algorithm
ISSN: 2159-2160Veröffentlicht: IEEE 11.11.2022Veröffentlicht in Asia Pacific Conference on Postgraduate Research in Microelectronics & Electronics (Online) (11.11.2022)“… Inspired by the fast inverse square root algorithm, we designed a hardware implementation method according to the algorithm, which generates an approximate division result with conversion …”
Volltext
Tagungsbericht -
11
IterL2Norm: Fast Iterative L2-Normalization
ISSN: 1558-1101Veröffentlicht: EDAA 31.03.2025Veröffentlicht in Proceedings - Design, Automation, and Test in Europe Conference and Exhibition (31.03.2025)“… steps and high precision, outperforming the fast inverse square root algorithm in six out of nine cases for FP32 and five …”
Volltext
Tagungsbericht -
12
High performance compressive sensing reconstruction hardware with QRD process
ISBN: 9781467302180, 146730218XISSN: 0271-4302Veröffentlicht: IEEE 01.05.2012Veröffentlicht in 2012 IEEE International Symposium on Circuits and Systems (ISCAS) (01.05.2012)“… ) process is used for the matrix inverse core and a new algorithm for finding fast inverse square root of a fixed point number is also implemented to support the QRD process …”
Volltext
Tagungsbericht -
13
Floating-Point Inverse Square Root Algorithm Based on Taylor-Series Expansion
ISSN: 1549-7747, 1558-3791Veröffentlicht: New York IEEE 01.07.2021Veröffentlicht in IEEE transactions on circuits and systems. II, Express briefs (01.07.2021)“… Taylor-series expansions of the inverse square root are examined for several center points with their convergence ranges, and the inverse square root calculation algorithm trade-offs among accuracy …”
Volltext
Journal Article -
14
Efficient Floating -Point Square Root and Reciprocal Square Root Algorithms
ISBN: 1665442093, 9781665442091ISSN: 2770-4254Veröffentlicht: IEEE 22.09.2021Veröffentlicht in Proceedings of the ... IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems (Online) (22.09.2021)“… Several algorithms for calculating square roots and inverse square roots are developed …”
Volltext
Tagungsbericht -
15
A fast FPGA based architecture for computation of square root and Inverse Square Root
Veröffentlicht: IEEE 01.03.2017Veröffentlicht in 2017 Devices for Integrated Circuit (DevIC) (01.03.2017)“… This study aims to design a fast FPGA based system for computation of the Square Root and Inverse Square Root values using modified Quake's algorithm …”
Volltext
Tagungsbericht -
16
Machine learning enables polymer cloud-point engineering via inverse design
ISSN: 2057-3960, 2057-3960Veröffentlicht: London Nature Publishing Group UK 12.07.2019Veröffentlicht in npj computational materials (12.07.2019)“… Inverse design is an outstanding challenge in disordered systems with multiple length scales such as polymers, particularly when designing polymers with desired phase behavior …”
Volltext
Journal Article -
17
Fast Inverse Square Root Based Matrix Inverse for MIMO-LTE Systems
ISBN: 9781467344999, 1467344990Veröffentlicht: IEEE 01.12.2012Veröffentlicht in 2012 International Conference on Control Engineering and Communication Technology (01.12.2012)“… This paper addresses the designing of a low complexity and high speed matrix inversion algorithm using fast inverse square root based on QR-decomposition and systolic array architecture …”
Volltext
Tagungsbericht -
18
A Novel Algorithm for Bluetooth ECG
ISSN: 0018-9294, 1558-2531, 1558-2531Veröffentlicht: United States IEEE 01.11.2012Veröffentlicht in IEEE transactions on biomedical engineering (01.11.2012)“… Here, a novel algorithm, identified as peak rejection adaptive sampling modified moving average (PRASMMA …”
Volltext
Journal Article -
19
An Improved Square-root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 11.03.2020Veröffentlicht in arXiv.org (11.03.2020)“… A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layered Space-Time architecture (V-BLAST …”
Volltext
Paper -
20
Realization of area efficient QR factorization using unified division, square root, and inverse square root hardware
ISBN: 9781424433544, 1424433541ISSN: 2154-0357Veröffentlicht: IEEE 01.06.2009Veröffentlicht in 2009 IEEE International Conference on Electro/Information Technology (01.06.2009)“… Newton-Raphson, and Goldschmidt algorithms are used for fast division, square root and inverse square root blocks …”
Volltext
Tagungsbericht

