• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.1-7
• /
• 2008

This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.475-488
• /
• 2003

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.3
• /
• pp.1-8
• /
• 2003

In this paper, I proposed a sort algorithm named Information Block Sort Algorithm(IBSAl which is not influenced on distribution of data in the list and has time complexity of O(NlogN). Also I evaluated the IBSA using a simulator. Performance analysis shows that, in case of sorting randomly generated two millions data, the number of actual comparisons has taken place about 36% of the number of comparisons in the improved Quick sort algorithm and 22% in Quick sort algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.782-787
• /
• 2007

This paper presents the D(Diagonal)-QR-RLS algorithm which normalizes the fast algorithm minimizes the MSE by using Givens rotated inputs and analyzes its characteristic. This proposed one has computational complexity of O(N) and the merit that it obtains the coefficients of TDL filter directly. Although this proposed normalized algorithm has the similar form to NLMS algorithm, we can see that D-QR-RLS has superior convergence characteristic to NLMS by computer simulation.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.85-89
• /
• 2010

This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.

• Proceedings of the KIPE Conference
• /
• 2004.07a
• /
• pp.117-120
• /
• 2004

As the maximum power operating point (MPOP) of photovoltaic (PV) power generation systems changes with varying atmospheric conditions such as solar radiation and temperature, an important consideration in the design of efficient PV system is to track the MPOP correctly. Although the efficiency of these Maximum Power Point Tracking algorithms is usually high, it drops noticeably in case of rapidly changing atmospheric conditions. This paper describes common MPPT control algorithm: Constant Voltage Control, Perturbation and Observation(P&O), Incremental Conductance (IncCnd) and proposes a new MPPT algorithm based on P&O algorithm. The conception and control principles of the proposed MPPT method are explained in detail and its validity of the proposed method is verified through several simulated results. As it doesn't use digital signal processor, this MPPT method has the merits of both a cost efficiency and a simple control circuit design. Therefore, it is considered that the proposed MPPT method is proper to low power, low cost PV applications.

• Bulletin of the Korean Chemical Society
• /
• v.27 no.12
• /
• pp.1976-1980
• /
• 2006

We have calculated the reaction probability and the reaction cross-section of the $N(^4S)+O_2(X^3\sum_{g}^{-})\;\rightarrow\;NO(X^2\Pi)+O(^3P)$ reaction by the quasiclassical trajectory method with the 6th-order explicit symplectic algorithm, based on a new ground potential energy surface. The advantage of the 6th-order explicit symplectic algorithm, conserving both the total energy and the total angular momentum of the reaction system during the numerical integration of canonical equations, has firstly analyzed in this work, which make the calculation of the reaction probability more reliable. The variation of the reaction probability with the impact parameter and the influence of the relative translational energy on the reaction cross-section of the reaction have been discussed in detail. And the fact is found by the comparison that the reaction probability and the reaction cross-section of the reaction estimated in this work are more reasonable than the theoretical ones determined by Gilibert et al.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.8
• /
• pp.1097-1101
• /
• 2003

The cubic and quartic anharmonic force field of malonaldehyde is calculated using density functional theory at the B3LYP/6-31G(d,p) level, and used to simulate coherent infrared vibrational spectra. 12 normal modes are included in the simulation, and the Arnoldi method is employed for the diagonalization of the Hamiltonian. The calculated three pulse infrared signals in the k1 + k2 - k3 direction show signatures of the intramolecular hydrogen bond couplings between the C=O stretch, H-O-C bend and O-H stretch vibrations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.1-9
• /
• 1997

We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Communications of the Korean Mathematical Society
• /
• v.28 no.4
• /
• pp.833-850
• /
• 2013

We present an algorithm for computing the Hausdorff distance between two parametric curves in $\mathbb{R}^n$, or more generally between two sets of parametric curves in $\mathbb{R}^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.