• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1019-1030
• /
• 2020

Efficient computation of r-th root in 𝔽_q has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller's result on square root, and which provides a possible improvement of the Cipolla-Lehmer type algorithms for general case. More precisely, for given r-th power c ∈ 𝔽_q, we show that there exists α ∈ 𝔽_q^r such that $$Tr{\left(\begin{array}{cccc}{{\alpha}^{{\frac{({\sum}_{i=0}^{r-1}\;q^i)-r}{r^2}}}\atop{\text{ }}}\end{array}\right)}^r=c,$$ where $Tr({\alpha})={\alpha}+{\alpha}^q+{\alpha}^{q^2}+{\cdots}+{\alpha}^{q^{r-1}}$ and α is a root of certain irreducible polynomial of degree r over 𝔽_q.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.39-44
• /
• 1996

An efficient interacting multiple mode(IMM) approach for tracking a maneuvering target with kinematic constraints is described based on the square root information filter(SRIF). The SRIF is employed instead of the conventional Kalman filter since it exhibits more efficient features in handling the kinematic constraints and improved numerical characteristics. The kinematic constraints are considered in the filtering process as pseudomeasurements where the degree of uncertainty is represented by the magnitude of the pseudomeasurement noise variance. The Monte Carlo simulations for the constant speed, maneuvering target are provided to demonstrate the improved tracking performance of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.15-20
• /
• 2006

A Newton-Raphson Method for table driven algorithm is presented in this paper. We concentrate the approximation of square root by using Newton-Raphson method. We confirm that this method has advantages of accurate and fast processing with optimized initial point. Hence the selection of the fitted initial points used in approximation of Newton-Raphson algorithm is important issue. This paper proposes that log scale based on geometric wean is most profitable initial point. It shows that the proposed method givemore accurate results with faster processing speed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.2
• /
• pp.64-69
• /
• 2003

In this paper, I introduce a simple design method using existing filter design method, such as Parks-McClecllan algorithm, for root-squared type raised cosine filter with equiripple characteristics, Thought some design examples, we show that the proposed filter has much better performance in ripple than the conventional SRCF at the expense of small increasing of ISI. In addition, the proposed filter is compatible with conventional SRCF. Finally, the filter for W-CDMA which uses RRC (Root Raised Cosine) with a=0.22 is designed in 12bit finite precision.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• Structural Monitoring and Maintenance
• /
• v.5 no.2
• /
• pp.231-242
• /
• 2018

Subway tunnel structure has been rapidly developed in many cities for its strong transport capacity. The model-based damage detection of subway tunnel structure is usually difficult due to the complex modeling of soil-structure interaction, the indetermination of boundary and so on. This paper proposes a new data-based method for the damage detection of subway tunnel structure. The root mean square acceleration and cross correlation function are used to derive a statistical pattern recognition algorithm for damage detection. A damage sensitive feature is proposed based on the root mean square deviations of the cross correlation functions. X-bar control charts are utilized to monitor the variation of the damage sensitive features before and after damage. The proposed algorithm is validated by the experiment of a full-scale two-rings subway tunnel lining, and damages are simulated by loosening the connection bolts of the rings. The results verify that root mean square deviation is sensitive to bolt loosening in the tunnel lining and X-bar control charts are feasible to be used in damage detection. The proposed data-based damage detection method is applicable to the online structural health monitoring system of subway tunnel lining.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1471-1481
• /
• 1998

In this paper, we propose a new digital image stabilization scheme based on the bit-plane matching. In the proposed algorithm, the conventional motion estimation algorithms are applied to the binary images extracted from the bit-plane images. It is shown that the computational complexity of the proposed algorithm can be significantly reduced by replacing the arithmetic calculations with the binary Boolean functions, while the accuracy of motion estimation is maintained. Furthermore, an adaptive algorithm for selecting a bit-plane in consideration of changes in external illumination can provide the robustness of the proposed algorithm. We compared the proposed algorithm with existing algorithms using root mean square error (RMSE) on the basis of the brute-force method, and proved experimentally that the proposed method detects the camera motion more accurately than existing algorithms. In addition, the proposed algorithm performs digital image stabilization with less computation.

• Geophysics and Geophysical Exploration
• /
• v.2 no.1
• /
• pp.54-62
• /
• 1999

This paper describes a datuming scheme for a prestack dataset which uses wavefield depth extrapolation. The formulation of the prestack datuming algorithm is performed by finding the adjoint operator to the corresponding forward prestack wavefield extrapolation from a flat surface to an irregular surface. Here I used double-square-root (DSR) equation to extrapolate wavefield in prestack sense. This correspond to the forward model of the well known `survey sinking` prestack imaging algorithm.