• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.470-476
• /
• 2002

This paper presents an analysis of the performance degradation of coefficient approximation and frequency deviation in phase measurement algorithm based on Sliding-DFT. The analytic derivation is based on the statistics of the error dynamic equation that describes the error propagation of the recursion. The analysis result is intended to obtain a closed-form equation of error variance in terms of the number of bits used in coefficient approximation, the length of the DFT data block, and noise. It is verified with data obtained from the computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1156-1162
• /
• 1999

In this paper, the problem of decoding transmitted data sequence with diversity reception in the presence of nondelective fading is studied. The expection maximizaton (EM) algorithm is employed to derive an interactive algorithm. The algorithm performs block-by-block coherent decoding with the aid of pilot symbols. It is shown that the complexity of the algorithm grows linearly as a function of sequence length. The performance of the algorithm is shown to better than that of the conventional pilot symbol aided (PSI) algorithm. Simulation results are presented to assess the performance of the algorithm and the results are compared with that of the conventional PSI alforithm.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.514-519
• /
• 2009

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimates the signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. FE-PAST (Forward-Backward PAST) is one of the results from the improvement studies. In this paper, we propose a new algorithm to improve the orthogonality of the FB-PAST (Forward-Backward PAST).

• Korean Journal of Optics and Photonics
• /
• v.17 no.4
• /
• pp.359-365
• /
• 2006

Wave-front error(WFE) is the main parameter that determines the optical performance of the opto-mechanical system. In the development of opto-mechanics, WFE due to the main loading conditions are set to the important specifications. The deformation of the optical surface can be exactly calculated thanks to the evolution of numerical methods such as the finite element method(FEM). To calculate WFE from the deformation results of FEM, another approximation of the optical surface deformation is required. It needs to construct additional grid or element mesh. To construct additional mesh is troublesomeand leads to transformation error. In this work, the moving least-squares approximation is used to reconstruct wave front error It has the advantage of accurate approximation with only nodal data. There is no need to construct additional mesh for approximation. The proposed method is applied to the examples of GOCI scan mirror in various loading conditions. The validity is demonstrated through examples.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.256-261
• /
• 2007

본 논문은 이미지 완성(Image Completion)을 위한 근사적 에너지 최적화 알고리즘을 제안한다. 이미지 완성이란 이미지의 특정영역이 지워진 상태에서, 그 지워진 부분을 나머지 부분과 시각적으로 어울리도록 완성시키는 기법을 말한다. 본 논문에서 이미지 완성은 유사-확률적(pseudo-probabilistic) 시스템인 Markov Random Field로 모델링된다. MRF로 모델링된 이미지 완성 시스템에서 사후 확률(posterior probability)을 최대로 만드는 MAP(Maximum A Posterior) 문제는 결국 시스템의 전체 에너지를 낮추는 에너지 최적화 문제와 동일하다. 본 논문에서는 MRF의 최적화 알고리즘들 중에서 Belief Propagation 알고리즘을 이용한다. BP 알고리즘이 이미지 완성 분야에 적용될 때 다음 두 가지가 계산시간을 증가시키는 요인이 된다. 첫 번째는 완성시킬 영역이 넓어 MRF를 구성하는 정점의 수가 증가할 때이다. 두 번째는 비교할 후보 이미지 조각의 수가 증가할 때이다. 기존에 제안된 Priority-Belief Propagation 알고리즘은 우선순위가 높은 정점부터 메시지를 전파하고 불필요한 후보 이미지 조각의 수를 제거함으로써 이를 해결하였다. 하지만 우선순위를 정점에 할당하기 위한 최초 메시지 전파의 경우 Belief Propagation의 단점은 그대로 남아있다. 이를 개선하기 위해 본 논문에서는 이미지 완성을 위한 MRF 모델을 피라미드 구조와 같이 층위로 나누어 정점의 수를 줄이고, 계층적으로 메시지를 전파하여 시스템의 적합성(fitness)을 정교화 해나가는 Hierarchical Priority Belief Propagation 알고리즘을 제안한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.336-341
• /
• 2002

본 연구에서는 엔트로피 최적화를 위한 목적함수의 근을 구하기 위해 단순히 함수 값만을 이용하여 계산을 근사화한 할선법에 기초한 고정점 알고리즘의 독립성분분석 기법을 제안하였다. 이렇게 하면 기존의 뉴우턴법에 기초한 고정점 알고리즘에서 요구되는 복잡한 도함수의 계산과정을 간략화 할 수 있어 더 우수한 학습성능의 독립성분분석이 가능하다. 제안된 학습알고리즘의 독립성분분석 기법을 512$\times$512의 픽셀을 가지는 10개의 영상을 대상으로 임의의 혼합행렬에 따라 발생되는 혼합영상들을 실험하였다. 실험결과, 기존의 뉴우턴법에 기초한 고정점 알고리즘의 분석기법보다 빠른 학습속도와 개선된 분리성능이 있음을 확인하였다. 특히 기존의 알고리즘에서 임의로 설정되는 초기값에 덜 의존하는 학습성능이 있음도 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.997-1004
• /
• 2015

In this paper, we study vertical sectorization techniques in multiple-input single-output (MISO) downlink active antenna systems (AAS). In the AAS, antenna beam patterns can be adjusted in each sector and multiple vertical beams can form the vertical sectorization. Since an exhaustive search based vertical sectorization algorithm requires high computational complexity to find the optimal tilt angles, we propose two vertical sectorization algorithms to reduce the complexity. First, we provide an asymptotic sum rate based algorithm which utilizes a large system approximation of the average sum rate based on the random matrix theory. Next, by using the result in the single sector transmission, the single sector based algorithm is proposed. In the simulation results, we confirm that the proposed algorithms are close to the performance of the exhaustive search algorithm with much reduced complexity.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2341-2349
• /
• 2015

The commonly used Goldschmidt's floating-point divider algorithm performs two multiplications in one iteration. In this paper, a tentative error corrected K'th Goldschmidt's floating-point number divider algorithm which performs K times multiplications in one iteration is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation in single precision and double precision divider is derived from many reciprocal tables with varying sizes. In addition, an error correction algorithm, which consists of one multiplication and a decision, to get exact result in divider is proposed. 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 divider unit. Also, it can be used to construct optimized approximate reciprocal tables.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.43-46
• /
• 2005

The detectability of radar depends on RCS(radar cross section). The RCS for complex radar targets may be only approximately calculated by using low-frequency or high-frequency scattering methods, while the RCS for simple rob targets can be exactly obtained by applying an eigen-function method. However, the conventional methods for calculation of RCS are computationally complex. We propose an approximation method for RCS calculation by MUSIC algorithm In this research, it is assumed toot the radar target is considered as a ring of scatterers. The amplitudes of scatterers may be statistically distributed. As the result, the radar signal model is proposed to use MUSIC, and the RCS is calculated by a simple linear algebraic method.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.175-181
• /
• 2014

This paper suggests O(m) polynomial time heuristic algorithm to obtain the solution for the driver scheduling problem, DSP, that has been classified as NP-complete problem. The proposed algorithm gets the initial assignment of n minimum number of drivers from given m schedules. Nextly, this algorithm gets the minimum total time (TC) using 5 rules of swap and insert for decrease of over times (OT) and idle times (IT). Although this algorithm is a heuristic polynomial time algorithm with O(m) time complexity rules to be find a optimal (or approximate) solution, this algorithm is equal to metaheuristic methods for the 5 experimental data. To conclude, this paper shows the DSP is not NP-complete problem but Polynomial time (P)-problem with polynomial time rules.