• Title/Summary/Keyword: Newton algorithm

Search Result 384, Processing Time 0.024 seconds

Performance Improvement for Device-to-Device (D2D) Users in Underlay Cellular Communication Networks

  • Bin Zhong ;Hehong Lin;Liang Chen ;Zhongshan Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.9
    • /
    • pp.2805-2817
    • /
    • 2024
  • This study focuses on the performance of device-to-device (D2D) communications in underlay cellular networks by analyzing key metrics such as successful transmission probability, coverage probability, and throughput. Under the homogeneous Poisson point process (PPP) spatial distribution of full-duplex (FD)-D2D users in cellular networks, stochastic geometry tools are used to derive approximate expressions for D2D users' coverage probability and throughput. In comparison to the conventional half-duplex (HD) communication mode, when the self-interference cancellation factor β reaches -95 dB, there is a substantial improvement in the throughput of FD-D2D users, nearly doubling their gain. Additionally, experimental results demonstrate that the Newton iterative algorithm can be used to optimize the targeted signal-to-interference-plus-noise-ratio (SINR) threshold of users within the range of (10, 20) dB.

Optimum Design of Composite Framed Structures Based Reliability Index (신뢰성지수를 고려한 합성 뼈대구조물의 최적설계에 관한 연구)

  • Jung, Young Chae;Kim, Jong Gil
    • Journal of Korean Society of Steel Construction
    • /
    • v.15 no.4 s.65
    • /
    • pp.389-401
    • /
    • 2003
  • The purpose of this study is to develop an algorithm, which can be designed the optimal sections of the composite framed structures constituted with the beams and the columns consisted of H type of steel section and concrete considering the reliability index. The optimized problem or the composite framed structures is formulated with the objective function and the constraints taking the section sizes as the design variables. The objective functions are constituted by the total costs of constructions. Also, the constraints are derived by considering the reliability index of section stress and allowable stress. The algorithm optimized the section of the composite framed structures utilizes the SUMT method using the modified Newton-Raphson direction method. The optimizing algorithm developed in this study is applied to the numerical examples with respecting a one-bay, one-story composite framed structure and a one-bay five-story one for the practical utilization of design on the composite framed structures using the reliability indices$({\beta})$ three and zero. In addition, their numerical results are compared and analyzed to examine the possibility of optimization the applicability, and the convergence this algorithm.

A Study on the UPFC Dynamic Simulation Algorithm for Low Frequency Oscillation Studies (저주파 진동 해석을 위한 UPFC의 동적 시뮬레이션 알고리즘에 관한 연구)

  • Son, Kwang-Myoung
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.10
    • /
    • pp.502-508
    • /
    • 2000
  • This paper presents a dynamic simulation algorithm for studying the effect of United Power Flow Controller(UPFC) on the low frequency power system oscillations and transient stability studies. The proposed algorithm is a Newton-type one and uses current injection type UPFC model, which gives a fast convergence characteristics. The algorithm is applied to studying inter-area power oscillation damping enhancement of a sample two-area power system both in time domain and frequency domain. The case study results show that the proposed algorithm is very efficient and UPFC is very effective and robust against operating point change.

  • PDF

Large strain analysis of two-dimensional frames by the normal flow algorithm

  • Tabatabaei, R.;Saffari, H.
    • Structural Engineering and Mechanics
    • /
    • v.36 no.5
    • /
    • pp.529-544
    • /
    • 2010
  • Nonlinear equations of structures are generally solved numerically by the iterative solution of linear equations. However, this iterative procedure diverges when the tangent stiffness is ill-conditioned which occurs near limit points. In other words, a major challenge with simple iterative methods is failure caused by a singular or near singular Jacobian matrix. In this paper, using the Newton-Raphson algorithm based on Davidenko's equations, the iterations can traverse the limit point without difficulty. It is argued that the propose algorithm may be both more computationally efficient and more robust compared to the other algorithm when tracing path through severe nonlinearities such as those associated with structural collapse. Two frames are analyzed using the proposed algorithm and the results are compared with the previous methods. The ability of the proposed method, particularly for tracing the limit points, is demonstrated by those numerical examples.

Image Stabilization Algorithm for Close Watching UAV(Unmanned Aerial Vehicle) Aystem (근접감시용 무인항공기 시스템을 위한 영상 안정화 알고리즘)

  • Lee, Hong-Suk;Lee, Tae-Yeoung;Kim, Byoung-Soo;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.10-18
    • /
    • 2010
  • This paper proposes an image stabilization algorithm for close watching UAV(Unmanned Aerial Vehicle) using motion separation and stabilization mode. The motion of UAV is composed of its actual navigating motion and unwanted vibrating motion so that image sequences obtained from UAV are shaken randomly. In order to stabilize these images we separate the vibrating motion component from UAV motion and remove the effect caused by it from image sequences. In the proposed algorithm the motion and global intensity change of two consecutive images are modeled with 6 motion parameters and 2 intensity change parameters respectively. These modeled parameters are estimated by non-linear least square method based on Gauss-Newton algorithm. The vibrating motion component is separated from the estimated motion using IIR filtering and the geometric deformation caused by it is removed from image sequences. In order to apply the proposed method to real aerial image sequences with many abrupt changes of camera view, we proposed a stabilizing method using two different modes named as stabilizing and non-stabilizing mode. Experimental results show that the accuracy of motion estimation is 99% and the efficiency of removing the vibrating motion component is 90%. We apply the proposed method to real aerial image sequences and verified its stabilizing performance.

A Variable Latency Newton-Raphson's Floating Point Number Reciprocal Square Root Computation (가변 시간 뉴톤-랍손 부동소수점 역수 제곱근 계산기)

  • Kim Sung-Gi;Cho Gyeong-Yeon
    • 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.

Modified Integration Algorithm on the Strain-Space for Rate and Temperature Dependent Elasto-Plastic Constitutive model (변형률 공간에서 변형률속도 및 온도를 고려한 구성방정식의 개선된 적분방법)

  • Cho, S.S.;Huh, H.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2007.05a
    • /
    • pp.272-275
    • /
    • 2007
  • This paper is concerned with modified integration algorithm on the strain-space for rate and temperature dependent elasto-plastic constitutive relations in order to obtain more accurate results in numerical implementation. The proposed algorithm is integrated analytically using integration by part and chain rule and then is applied to the 2-stage Lobatto IIIA with second-order accuracy. It has advantage that is able to consider the convective stress rates on the yield surface of the strain-space. Also this paper is carried out the iteration procedure using the Newton-Raphson method to enforce consistency at the end of the step. And the performance of the proposed algorithm for rate and temperature dependent constitutive relation is illustrated by means of analysis of adiabatic shear bands.

  • PDF

Development of OPF Algorithm with Changing Inequality to Equality (부등호의 등호화를 통한 OPF 해석 알고리즘 개발)

  • Ju, Un-Pyo;Kim, Geon-Jung;Choe, Jang-Heum;Eom, Jae-Seon;Lee, Byeong-Il
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.7
    • /
    • pp.339-344
    • /
    • 2000
  • This paper presents an improved optimal power flow algorithm, which solves an optimization problem with equality constraints with converted inequality constraints. The standard OPF and the penalty function method should do reconstructing active constraints among the inequality constraints so that the activation of the inequality constraints has been imposing an additional burden to solve OPF problem efficiently. However the proposed algorithm converts active inequality constraints into the equality constraints in order to preclude us from reconstructing the procedures. The effectiveness of the new OPF algorithm is validated by applying the IEEE 14 bus system.

  • PDF

On statistical Computing via EM Algorithm in Logistic Linear Models Involving Non-ignorable Missing data

  • Jun, Yu-Na;Qian, Guoqi;Park, Jeong-Soo
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2005.11a
    • /
    • pp.181-186
    • /
    • 2005
  • Many data sets obtained from surveys or medical trials often include missing observations. When these data sets are analyzed, it is general to use only complete cases. However, it is possible to have big biases or involve inefficiency. In this paper, we consider a method for estimating parameters in logistic linear models involving non-ignorable missing data mechanism. A binomial response and normal exploratory model for the missing data are used. We fit the model using the EM algorithm. The E-step is derived by Metropolis-hastings algorithm to generate a sample for missing data and Monte-carlo technique, and the M-step is by Newton-Raphson to maximize likelihood function. Asymptotic variances of the MLE's are derived and the standard error and estimates of parameters are compared.

  • PDF

A Line to Ground Fault Location Algorithm for Underground Cable System (지중 케이블 계통의 1선지락 고장점 표정 알고리즘)

  • Lee Duck-Su;Yang Xia;Choi Myeon-Song
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.6
    • /
    • pp.267-273
    • /
    • 2005
  • This paper proposes a line-to-ground fault location algorithm for underground cable system. A feature of the proposed method is a new algorithm based on the analytic research which has not been tried until now. The proposed method firstly makes voltage and current equations using analysis of distributed parameter circuit for each of cores and sheathes respectively, and then establishes an equation of the fault distance according to the analysis of the fault conditions. Finally the solution of this equation is calculated by Newton-Raphson iteration method. The effectiveness of this proposed algorithm has been proven through PSCAD/EMTDC(Ver. 4.1) simulations.