Amanote Research
Register
Sign In
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication With Operand Modification
IEEE Transactions on Computers
- United States
doi 10.1109/12.588066
Full Text
Open PDF
Abstract
Available in
full text
Categories
Hardware
Architecture
Mathematics
Computational Theory
Theoretical Computer Science
Software
Date
April 1, 1997
Authors
M. Ito
N. Takagi
S. Yajima
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
Complex Square Root With Operand Prescaling
The Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
The Generation of Square Roots on a Computer With Rapid Multiplication Compared With Division
Mathematics of Computation
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Square Multiplicative Labeling for Some Graphs
International Journal of Scientific and Innovative Mathematical Research
A Class of Square Root and Division Free Algorithms and Architectures for QRD-based Adaptive Signal Processing
IEEE Transactions on Signal Processing
Electronic Engineering
Signal Processing
Electrical
Comments on “A Square-Root-Free Matrix Decomposition Method for Energy-Efficient Least Square Computation on Embedded Systems”
IEEE Embedded Systems Letters
Control
Systems Engineering
Computer Science
Polynomial Factorization by Root Approximation
Rechentabellen Für Multiplication Und Division
Monatshefte fur Mathematik
Mathematics
An Initial Guess of Newton's Method for the Matrix Square Root Based on a Sphere Constrained Optimization Problem
JSIAM Letters
Inner Approximation Algorithm for Generalized Linear Multiplicative Programming Problems
Journal of Inequalities and Applications
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
