• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.279-280
• /
• 2008

In order to improve the performance and simplify the structure of the conventional detectors in high density magnetic channels, a new equalizer based on bilinear recursive polynomial (BRP) models, which uses the previously estimated sequence, is proposed. The performance is compared with the conventional equalizers and the maximum likelihood sequence detection (MLSD) bound.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.24-31
• /
• 1995

In this paper, the dual-mode burst-error-correcting decoding algorithm is adapted to the multiple trellis-coded .pi./4 shift QPSK in order to achieve the improvement of bit error rate (BER) performance over fading channels. The dual-mode adaptive decoder which combines maximum likelihood decoding with a burst detection scheme usually operates as a Viterbi decoder and switches to time diversity error recovery whenever an uncorrectable error pattern is identified. Rayleigh fading channels and Rician fading channels having the Rician parameter K=5dB are used in computer simulation, and the simulation results are compared with those of interleaving techniques. It is shown that under the constraint of the fixed overall memory quantity, the dual-mode adaptive decoding scheme gains an advantage in the BER performance with respect to interleaving strategies.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.5
• /
• pp.69-76
• /
• 1991

본 논문에서는 통계적 방법에 의한 음소의 자동분할에 관한 알고리즘을 제안하였다. 우선 음성 신호를 AR 모델로 모델링한 후 스펙트럼이 변화하기 전과 변화한 후의 모델에 대해서 likelihood ratio 와 mutual information을 고려한 test statistics 로부터 모델 계수가 변화하는 곳을 예측해 내고 이 곳을 음소의 경계로 판단한다. 이 경우 검파되지 못하는 대부분의 음소는 짧은 자음이었으며 Signed front-to-back maximum area ratio을 이용하여 개선하였다. 또한 false alarm error을 줄이기 위해 두 segment 사이의 distortion 으로부터 smoothing을 하였다. 3명의 화자에 대한 실험 결과 non-detection error는 10%, false alarm error는 20% 정도로 나타났지만 화자간에 알고리즘의 성능 변화가 거의 없으 며 특히 분할된 경계치 분포는 전체 음소의 90% 이상이 이 30ms 이내에 위치하였다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.1-10
• /
• 2012

In this study, software products developed in the course of testing, software managers in the process of testing software test and test tools for effective learning effects perspective has been studied using the NHPP software. The finite failure nonhomogeneous Poisson process models presented and the life distribution applied exponential and log shaped type hazard function. Software error detection techniques known in advance, but influencing factors for considering the errors found automatically and learning factors, by prior experience, to find precisely the error factor setting up the testing manager are presented comparing the problem. As a result, the learning factor is greater than autonomous errors-detected factor that is generally efficient model could be confirmed. This paper, a failure data analysis of applying using time between failures and parameter estimation using maximum likelihood estimation method, after the efficiency of the data through trend analysis model selection were efficient using the mean square error and coefficient of determination.

• Journal of Korean Society for Quality Management
• /
• v.34 no.4
• /
• pp.133-138
• /
• 2006

In this paper, we propose a software reliability growth model (SRGM) based on the testing domain, which is isolated by the executed test cases. This model assumes an imperfect debugging environment in which new faults are introduced in the fault-correction process. We consider that the fault detection rate of NHPP model is changed in the proposed SRGM. We obtain the maximum likelihood estimate, and compare goodness-of-fit with another existing software reliability growth model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.377-380
• /
• 2012

격자 감소 (lattice reduction) 알고리즘은 주어진 기저 벡터를 직교에 가까운 기저 벡터로 바꾸어 준다. 그중 대표적인 알고리즘으로 LLL (Lenstra, Lenstra & Lovasz) 알고리즘이 있다. 격자 감소 알고리즘을 이용하여 다중 안테나 입출력 (MIMO) 통신시스템의 선형 수신기(linear detector)의 성능을 향상 시킬 수 있다. 스피어 복호 알고리즘 (sphere decoding algorithm)은 MIMO 통신 시스템에서 사용되는 복호기중 최대 우도 복호기 (Maximum Likelihood Detector)와 비슷한 BER(bit error rate)성능을 가지고 복잡도를 줄일 수 있어서 많이 연구되어 왔다. 이때 스피어의 반지름의 설정이나 트리 검색 구조 방식 등은 복잡도에 큰 영향을 미친다. 본 논문에서는 LLL 알고리즘에 기반하여 스피어의 반지름 설정 및 트리 검색 노드 수를 제한하는 방식으로 스피어 복호 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오류률 (BER) 성능 열화를 최소한으로 한 알고리즘을 제안하고 전산 실험을 통해 검증한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1583-1591
• /
• 1998

In this paper, we consider the quasi maximum likelihood(quasi-ML) detector which uses antenna arrays in asynchronous time-varing channels. It is shown that the proposed quasi-ml detector can be regarded as a beamformer followed by a decorrelator: a method based on the eigendecomposition of the correlation matrix of the inverse-filtered signal is proposed to estimate the channel vectors. We also show that the proposed algorithm estimates the channel vector within small mismatch loss in severe propagation environment through computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.581-586
• /
• 2010

The holographic data storage system stores multiple data pages by multiplexing. But the inter-page interference(IPI) caused by multiplexing reduces the intensity of the hologram. The simulation of the holographic storage systems has to consider the IPI. Therefore, we introduce a channel modeling that takes care of inter-page interference in the holographic data storage system. We simulate the performance of PRML detection on the hologrpahic data storage system with IPI modeling.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2001.05a
• /
• pp.232-236
• /
• 2001

In this paper, we consider the problem of estimation of average radar cross section (RCS) for Swerling 1 fluctuation model, based on the maximum likelihood (ML) estimation method. In a mathematical development we take into account the event that target strength is lower than detection threshold, or the target is not detected. Our ML estimation for the SWR uses the score function that is the joint probability-pdf of the events and random variables. The solution to the ML estimation reduces to an expression in the from of a contraction mapping. The computational efficiency of the contraction mapping theorem is significant in computing the ML estimation as compared with other root-finding algorithms fur most radar tracking conditions.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.171-172
• /
• 2006

In first-order moving-average Cauchy noise, the maximum likelihood (ML) and suboptimum ML (S-ML) detectors are analyzed in terms of the bit-error-rate in impulsive environment. Despite reduced complexity and simpler structure, the S-ML detector exhibits practically the same performance as the ML detector.