• Journal of applied mathematics & informatics
• /
• 제32권5_6호
• /
• pp.747-760
• /
• 2014

In this paper a higher order iterative algorithm is developed for an unconstrained multivariate optimization problem. Taylor expansion of matrix valued function is used to prove the cubic order convergence of the proposed algorithm. The methodology is supported with numerical and graphical illustration.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.489-492
• /
• 2003

In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized l$_2$ norm functional and the regularized l$_4$ functional is proposed. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized l$_2$ functional and the regularized l$_4$ functional. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed.

• 대한전자공학회논문지
• /
• 제24권4호
• /
• pp.713-718
• /
• 1987

In this paper, an iterative restoration algorithm from power spectral density with 1 bit sign information of real part of two dimensional Fourier transform of image corrupted by additive white Gaussian noise is proposed. This method is a modified version of image reconstruction algorithm from power spectral density. From the results of computer simulation with original 32 gray level imgae of 64x64 pixels, we can find that restorated image after each iteration converge to original image very fast, and SNR gain be at least 8[dB] after 10th iteration for corrupted image with additive white Gaussian noise.

• 대한전자공학회논문지
• /
• 제21권2호
• /
• pp.1-7
• /
• 1984

전산기 단층영상(C.T) 장치에서 발생되는 불완전 투영군으로부터 단층상을 재구성할 수 있게한 하나의 알고리즘이 제안되고 있다. 알고리즘은 실측의 불완전 투영군, 물휴의 윤곽 정보등으로 부터 재구성-투영 과정속에서 회복 수정의 단순 조작에 의해 이루어지고, 그 유효성이 전산기 모의실험을 통해 검증되고 있다.

• 한국멀티미디어학회논문지
• /
• 제17권8호
• /
• pp.961-967
• /
• 2014

Raptor codes are a class of rateless codes originally designed for binary erasure channels. This paper presents a compact set of mathematical expressions for iterative soft decoding of raptor codes. In addition, an early termination scheme is employed, and it is embedded in a single algorithm with the formula. In the proposed algorithm, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination scheme. Simulation results show that our proposed method can achieve better performance with reduced decoding complexity compared to the conventional schemes.

• International journal of advanced smart convergence
• /
• 제7권2호
• /
• pp.33-37
• /
• 2018

In this study, we propose an iterative clustering algorithm that automatically clusters a set of voice signal data without a label into an optimal number of clusters and generates hmm model for each cluster. In the clustering process, the likelihood calculations of the clusters are performed using iterative hmm learning and testing while varying the number of clusters for given data, and the maximum likelihood estimation method is used to determine the optimal number of clusters. We tested the effectiveness of this clustering algorithm on a small-vocabulary digit clustering task by mapping the unsupervised decoded output of the optimal cluster to the ground-truth transcription, we found out that they were highly correlated.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.235-240
• /
• 2009

This paper combines various detection techniques and analyzes their performances in detecting the transmission information of the D-STTD scheme that uses, in parallel, the STTD scheme known as the Alamouti code. The D-STTD scheme adopts one of the STTD schemes for transmission to acquire diverse effects and uses another form of STTD for multiplexing effects. Due to the multiplexing effect that transmits different data, it is difficult to apply D-STTD to the conventional STTD combining technique. This paper combines the D-STTD system with linear algorithm, SIC algorithm and OSIC algorithm known as multiplexing detection scheme based on MMSE scheme. And we propose the detection scheme of the D-STTD using MAP algorithm and analyze the performance of each system. The simulation results showed that the detector using iterative algorithm has better performance than Linear MMSE Detector. Especially, we can show that the detector using MAP algorithm outperforms conventional detector.

• Journal of information and communication convergence engineering
• /
• 제6권1호
• /
• pp.1-5
• /
• 2008

In this paper, we propose and analyze the AMC (Adaptive Modulation and Coding) system with efficient turbo coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique. The proposed algorithm adopts extrinsic information from a MAP (Maximum A Posteriori) decoder with iterative decoding as a priori probability in two decoding procedures of V-BLAST scheme; the ordering and the slicing. Also, we consider the AMC system using the conventional turbo coded V-BLAST technique that simply combines the V-BLAST scheme with the turbo coding scheme. And we compare the proposed decoding algorithm to a conventional V-BLAST decoding algorithm and a ML (Maximum Likelihood) decoding algorithm. In addition, we apply a STD (Selection Transmit Diversity) scheme to the systems for better performance improvement. Results indicate that the proposed systems achieve better throughput performance than the conventional systems over the entire SNR range. In terms of transmission rate performance, the suggested system is close in proximity to the conventional system using the ML decoding algorithm.

• 한국통신학회논문지
• /
• 제31권8A호
• /
• pp.784-789
• /
• 2006

본 논문에서는 Max-Log-MAP 알고리듬을 바탕으로 Gray 부호화된 M-PSK(phase shift keying) 신호를 위한 비트 정보 분할 알고리듬을 제안한다. 제안한 알고리듬은 M-PSK 신호 공간을 M-PAM(pulse amplitude modulation) 신호 공간으로 변환하여 M-PAM의 비트 정보 분할 방법을 응용한다. 제안한 알고리듬을 이용하여 M-PSK 신호의 비트별 정보 분할 값을 계산하고 이 값을 입력으로 하여 터보 반복 복호 기법의 성능을 분석하였다. 따라서 Gray 부호화된 M-PSK 신호는 M-PAM 신호 공간에서 비트 정보 분할을 수행하기 때문에 PAM과 PSK 신호의 비트정보 분할 알고리듬 중 일부의 연산 기능을 공유할 수 있어 PSK와 반복 복호 방식을 채택한 통신 시스템뿐만이 아니라 적응 변조/부호화(adaptive modulation/coding)에 효과적으로 응용이 가능하다.

• 제어로봇시스템학회논문지
• /
• 제18권6호
• /
• pp.579-583
• /
• 2012

The purpose of this paper is to suggest IDE (Incremental Displacement Estimation) algorithm for the previously proposed visually servoed paired structured light system. The system is composed of two sides facing with each other, each with one or two lasers with a 2-DOF manipulator, a camera, and a screen. The 6-DOF displacement between two sides can be estimated by calculating the positions of the projected laser beams and rotation angles of the manipulators. In the previous study, Newton-Raphson or EKF (Extended Kalman Filter) has been used as an estimation algorithm. Although the various experimental tests have validated the performance of the system and estimation algorithms, the computation time is relatively long since aforementioned algorithms are iterative methods. Therefore, in this paper, a non-iterative incremental displacement estimation algorithm which updates the previously estimated displacement with a difference of the previous and the current observed data is introduced. To verify the performance of the algorithm, experimental tests have been performed. The results show that the proposed non-iterative algorithm estimates the displacement with the same level of accuracy compared to the EKF with multiple iterations with significantly less computation time.