• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Journal of the Korean Statistical Society
• /
• v.34 no.3
• /
• pp.209-218
• /
• 2005

In response surfaces analysis, we often proceed by supposing that, over a limited region of factor space, a polynomial of only first or second degree might adequately approximate the true function. To find the best subset model, all possible quadratic regressions for response surfaces can be very valuable to get optimum solutions under some reasonable experimentations. However, there is a very hard computational burden to get all possible quadratic regressions. In practice, it is sufficient to consider only hierarchical models. In this paper, we propose an algorithm to get all possible hierarchical quadratic regressions for fitting response surfaces.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.10-14
• /
• 2014

Krylov-Schur iteration method has been applied to the 2-Dim. waveguides of the varied geometrical structure. The eigen-equations for them have been constructed from FEM based on the tangential edge vectors of triangular elements. The eigen-values and their modes have been determined from the diagonal components of the Schur matrices and its transforming matrices. The eigen-pairs as the results have been revealed visually in the schematic representations.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.75-78
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.107-110
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. By stacking received symbols from different received symbolduration and applying QR decomposition resulting the special format of upper triangular matrix R, the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.28-35
• /
• 2013

The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.3
• /
• pp.139-170
• /
• 2013

We extend a p-hierarchical decomposition of the second degree finite element space of N$\acute{e}$d$\acute{e}$lec for tetrahedral meshes in three dimensions given in [1] to meshes with hexahedral elements, and derive p-hierarchical decompositions of the second degree finite element space of Raviart-Thomas in two dimensions for triangular and quadrilateral meshes. After having proved stability of these subspace decompositions and requiring certain saturation assumptions to hold, we construct a local a posteriori error estimator for fem and bem coupling of a time-harmonic electromagnetic eddy current problem in $\mathbb{R}^3$. We perform some numerical tests to underline reliability and efficiency of the estimator and test its usefulness in an adaptive refinement scheme.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.222-230
• /
• 2010

In this paper, we present a closed-form approximation of the average sum rate of zero-forcing (ZF) beamforming (BF) with semi-orthogonal user selection (SUS). We first derive the survival probability associated with the SUS that absolute square of the channel correlation between two users is less than the orthogonalization level threshold (OLT).With this result, each distribution for the number of surviving users at each iteration of the SUS and the number of streams for transmission is calculated. Secondly, the received signal power of ZF-BF is represented as a function of the elements of the upper triangular matrix from QR decomposition of the channel matrix. Thirdly, we approximate the received signal power of ZF-BF with the SUS as the maximum of scaled chisquare random variables where the scaling factor is approximated as a function of both OLT and the number of users in the system. Putting all the above derivations and order statistics together, the approximated ergodic sum rate of ZF-BF with the SUS is shown in a closed form. The simulation results verify that the approximation tightly matches with the sample average for any OLT and even for a small number of users.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.1 no.1
• /
• pp.1-10
• /
• 1997

Current seismic design philosophy for reinforced concrete (RC) structures on energy dissipation through large inelastic defomations. A nonlinear dynamic analysis which is used to represent this behavior is time consuming and expensive, particularly if the computations have to be repeated many times. Therefore, the selection of an efficient yet accurate alogorithm becomes important. The main objective of the present study is to propose a new technique herein called the prediction approach with siffness measure (PASM) method in the convetional direct integration methods, the triangular decomposition of matrix is required for solving equations of motion in every time step or every iteration. The PASM method uses a limited number of predetermined decomposed effective matrices obtained from stiffness states of the structure when it is deformed into the nonlinear range by statically applied cyclic loading. The method to be developed herein will reduce the overall numerical effort when compared to approaches which recompute the stiffness in each time step or iteration.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.17-30
• /
• 2000

In this paper, we propose an efficient algorithm to produce 3-D surface model from a set of range data, based on NURBS (Non-Uniform Rational B-Splines) surface fitting technique. It is assumed that the range data is initially unorganized and scattered 3-D points, while their connectivity is also unknown. The proposed algorithm consists of three steps: initial model approximation, hierarchical representation, and construction of the NURBS patch network. The mitral model is approximated by polyhedral and triangular model using K-means clustering technique Then, the initial model is represented by hierarchically decomposed tree structure. Based on this, $G^1$ continuous NURBS patch network is constructed efficiently. The computational complexity as well as the modeling error is much reduced by means of hierarchical decomposition and precise approximation of the NURBS control mesh Experimental results show that the initial model as well as the NURBS patch network are constructed automatically, while the modeling error is observed to be negligible.