• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7B
• /
• pp.928-936
• /
• 2001

본 논문은 CDMA 시스템을 근간으로 향후 서비스 될 3세대 이동통신 시스템에 선택적으로 적용될 수 있는 다중 사용자 간섭 제거 기법을 제안한다. 제안 방식은 다단계 간섭 제거기의 각 단계에 직교 다항식의 근사화 기법을 적용하여 제거될 간섭 신호의 양을 결정하고, 이를 상호 보완적으로 제거한다. 사용자 용량의 포화도에 따른 최적해로의 수렴성을 각 방식의 스펙트럼 반경의 분석을 통해 비교하였으며, 제안한 방식이 병렬 간섭 제거 기법(Parallel Interference Cancellation, PIC)을 사용한 방식과 비교하여 2배 이상의 적은 단계를 사용했음에도 거의 같은 정도의 오차 성능을 보였으며, 실험을 통해 비트 오율이 $10^{-5}$을 기준으로 약 30% 정도의 사용자 수용 능력이 증대되었다. 또한 전력 제어의 적용 여부에 대한 시스템의 비트 오율 측면의 성능 비교, 원근 효과의 관점에서 성능을 비교하여 제안된 간섭 제거 기법이 비적응형 가중치를 적용한 병렬 간섭 제거 기법보다 우수함을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1736-1738
• /
• 2016

In modern digital communication systems adapting high-order modulation and high performance channel code, log-likelihood ratios involving the repeated calculations of the logarithm of sum of exponential functions are necessary for demodulation and decoding. In this paper, the approximation methods called Min and MinC are applied to demodulation and decoding together and their complexity and joint performance are analyzed.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.2
• /
• pp.237-247
• /
• 2001

강상판교는 부재수가 많고 구조적 거동이 복잡하여 재래적인 단일수준 (CSL) 알고리즘을 이용하여 최적화하는 것이 매우 어렵기 때문에 본 연구에서는 강상판교를 효율적으로 최적화하기 위해 다단계 최적설계 (MLDS) 알고리즘이 제안되었다. 강상판교를 주형과 강상판으로 나누기 위해 등위법이 사용되었고, 시스템 최적화를 위하여 설계 변수를 줄이는 분해법이 사용되었다. 효율적인 최적설계를 위해 다단계 최적설계 알고리즘은 제약조건 소거기법(Constraint Deletion)과 응력 재해석 같은 근사화 기법을 도입하였다. 변위해석을 위한 제약조건 소거기법은 교량의 최적화에 효율적인 것으로 검증되었고, 제안된 응력 재해석 기법 또한 설계민감도 해석을 필요로 하지 않으므로 매우 효율적이다. MLDS 알고리즘의 적용성과 강건성은 다양한 수치예제를 사용하여 기존의 단일수준 알고리즘과 비교하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1174-1182
• /
• 1999

Recently the shape information of the visual object in the scene is more important, as the completion of the MPEG-4 standard and the progress of the MPEG-7 standard. This paper represents the study of effective coding method of vertices that are used in the polygonal approximation to represent the feature of visual object. In the proposed method, we make the centers of gravity of triangles that are made using the vertices of polygonal approximation and encode them sequentially We can get a coding gain because the centers of the gravity of triangles have narrower dynamic ranges.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.4
• /
• pp.255-262
• /
• 2020

In modern passive sonar systems, a towed array sensor is used to minimize the effects of own ship noise and to get a higher SNR. The thin and long towed array sensor can be guided in a non-linear form according to the maneuvering of tow-ship. If this change of the array shape is not considered, the performance of beamformer may deteriorate. In order to properly beamform the elements in the array, an accurate estimate of the array shape is required. Various techniques exist for estimating the shape of the linear array. In the case of a method using a heading sensor, the estimation performance may be degraded due to the effect of heading sensor noise. As means of removing this potential error, weighted polynomial fitting technique for estimating array shape is developed here. In order to evaluate the performance of proposed method, we conducted computer simulation. From the experiments, it was confirmed that the proposed method is more robust to noise than the conventional method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.8
• /
• pp.921-931
• /
• 2011

This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.259-266
• /
• 2011

We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.1
• /
• pp.118-123
• /
• 2008

This paper proposes a frequency transfer function synthesis for approximating a high-order model with resonance to a low-order model in the frequency domain. The presented model approximation method is based on minimizing the error function weighted by the numerator polynomial of approximated models, which is used of the RLS(Recursive Least Square) technique to estimate the coefficient vector of approximated models. The proposed method provides better fitting in a low frequency and peak resonance. And an example is given to illustrate feasibilities of the suggested schemes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.1
• /
• pp.7-14
• /
• 1983

Linear feature such as lines and curves are one of important features in image processing. In this paper, new method of linear feature detection is suggested. Also, we have studied approximation technique which transforms detected linear feature into data structure for the practical. This method is based on graph theory and principle of this method is based on minimal spanning tree concept which is widely used in edge linking process. By postprocessing, Hairs and inconsistent line segments are removed. To approximate and describe traced linear feature, piecewise linear approximation is adapted. The algorithm is demonstrated through computer simulations.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.902-915
• /
• 2011

Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.