• ETRI Journal
• /
• v.38 no.3
• /
• pp.435-443
• /
• 2016

In this paper, an efficient beam tracking algorithm for a regularized zero-forcing (RZF) approach in slowly fading multiple-input and single-output (MISO) broadcast channels is considered. By modifying an RZF equation, an RZF beam tracking algorithm is proposed using matrix perturbation theory. The proposed algorithm utilizes both beams from the previous time step and channel difference (between the previous and current time steps) to calculate the RZF beams. The tracking performance of the proposed algorithm is analyzed in terms of the mean square error (MSE) between a tracking approach and an exact recomputing approach, and in terms of the additional MSE caused by the beam tracking error at the receiver. Numerical results show that the proposed algorithm has almost the same performance as the exact recomputing approach in terms of the sum rate.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Structural Engineering and Mechanics
• /
• v.30 no.5
• /
• pp.593-602
• /
• 2008

This paper presents a new linearization algorithm to find the periodic solutions of the Duffing equation, under harmonic loads. Since the Duffing equation models a single degree of freedom system with a cubic nonlinear term in the restoring force, finding its periodic solutions using classical harmonic balance (HB) approach requires numerical integration. The algorithm developed in this paper replaces the integrals appearing in the classical HB method with triangular matrices that are evaluated algebraically. The computational cost of using increased number of frequency components in the matrixbased linearization approach is much smaller than its integration-based counterpart. The algorithm is computationally efficient; it only takes a few iterations within the region of convergence. An example comparing the results of the linearization algorithm with the "exact" solutions from a 4th order Runge- Kutta method are presented. The accuracy and speed of the algorithm is compared to the classical HB method, and the limitations of the algorithm are discussed.

• Journal of Mechanical Science and Technology
• /
• v.14 no.7
• /
• pp.705-714
• /
• 2000

The formulation of Smoothed Particle Hydrodynamics (SPH) and a shortcoming of traditional SPH in contact simulation are presented. A contact algorithm is proposed to treat contact phenomenon between two objects. We describe the boundary of the objects with non-mass artificial particles and set vectors normal to the contact surface. Contact criterion using non-mass particles is established in this study. In order to verify the contact algorithm, an algorithm is implemented in to an in-house program; elastic wave propagation is an analysed under low velocity axial impact of two rods. The results show that the contact algorithm eliminates the undesirable phenomena at the contact surface; numerical result with the contact algorithm is compared with theoretical one.

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

A stable algorithm for computing the fundamental matrix (I-Q)$^{-1}$ of a Markov chain is proposed, where Q is a substochastic matrix. The proposed algorithm utilizes the GTH algorithm (Grassmann, Taskar and Heyman, 1985) which is turned out to be stable for finding the steady state distribution of a finite Markov chain. Our algorithm involves no subtractions and therefore loss of significant digits due to concellation is ruled out completely while Gaussian elimination involves subtractions and thus may lead to loss of accuracy due to cancellation. We present numerical evidence to show that our algorithm achieves higher accuracy than the ordinagy Gaussian elimination.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.55 no.4
• /
• pp.166-171
• /
• 2006

In this paper, we have studied for analysis of the partial discharge(PD) signal in underground transmission line. The PD signal has estimated as detected signal accumulation of a PRPDA method by using Labview, and analyzed with fuzzy algorithm. In our algorithm, we developed system configuration that detected accumulating PD signal using by Labview and programmed fuzzy algorithm can be analyzed the PD signal using with Matlab. With practical PD logic implementation of theoretical detected system and hardware implementation, the device for Hipotronics Company's 50kV setup has generated and then has applied with $15k{\sim}17kV$ with 1:1 time probe. It's also used the LDPE 0.27mmt (scratch error 0.05mmt) to sample for making PD. In conclusion, Our new class of PD detected algorithm has also compared with previous PRPDA or Fuzzy algorithm. which has diagnose more conveniently by adding numerical values.

• Communications for Statistical Applications and Methods
• /
• v.9 no.1
• /
• pp.291-304
• /
• 2002

This article is concerned with an effective algorithm for the identification of multiple outliers in linear regression. It proposes a hybrid algorithm which employs the least median of squares estimator, instead of the least squares estimator, to construct an Initial clean subset in the stepwise forward search scheme. The performance of the proposed algorithm is evaluated and compared with the existing competitor via an extensive Monte Carlo simulation. The algorithm appears to be superior to the competitor for the most of scenarios explored in the simulation study. Particularly it copes with the masking problem quite well. In addition, the orthogonal decomposition and Its updating techniques are considered to improve the computational efficiency and numerical stability of the algorithm.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.583-592
• /
• 2007

Given the moments of a symmetric random variable, its density and distribution functions can be accurately approximated by making use of the algorithm proposed in this paper. This algorithm is specially designed for approximating symmetric distributions and comprises of four phases. This approach is essentially based on the transformation of variable technique and moment-based density approximants expressed in terms of the product of an appropriate initial approximant and a polynomial adjustment. Probabilistic quantities such as percentage points and percentiles can also be accurately determined from approximation of the corresponding distribution functions. This algorithm is not only conceptually simple but also easy to implement. As illustrated by the first two numerical examples, the density functions so obtained are in good agreement with the exact values. Moreover, the proposed approximation algorithm can provide the more accurate quantities than direct approximation as shown in the last example.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.81-82
• /
• 2006

Most work on cooperative diversity has assumed that the cooperating group (source and partners) and the associated average channel conditions between terminals (source, partners, and destination) are predetermined. In practical situations, however, it is important to develop the efficient algorithms for assigning the terminals with good inter-user channels for cooperating groups. In this paper, we propose the partner assignment algorithm for cooperative diversity in mobile communication systems. The proposed partner assignment algorithm is investigated by using the path loss model for mobile communication systems. Numerical results show that the proposed partner assignment algorithm provides the comparable probability of cooperative transmission to the partner assignment algorithm using exhaustive search. The probability of cooperative transmission increases with the number of users, which gives potential benefits of practical implementation to user cooperation in mobile communication systems.

• Structural Engineering and Mechanics
• /
• v.52 no.3
• /
• pp.445-468
• /
• 2014

In this paper a new particle swarm ray optimization algorithm is proposed for truss shape and size optimization with natural frequency constraints. These problems are believed to represent nonlinear and non-convex search spaces with several local optima and therefore are suitable for examining the capabilities of new algorithms. The proposed algorithm can be viewed as a hybridization of Particle Swarm Optimization (PSO) and the recently proposed Ray Optimization (RO) algorithms. In fact the exploration capabilities of the PSO are tried to be promoted using some concepts of the RO. Five numerical examples are examined in order to inspect the viability of the proposed algorithm. The results are compared with those of the PSO and some other existing algorithms. It is shown that the proposed algorithm obtains lighter structures in comparison to other methods most of the time. As will be discussed, the algorithm's performance can be attributed to its appropriate exploration/exploitation balance.