• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.2093-2096
• /
• 2003

정보통신 구조의 확산 및 기술이 발전함에 따라 전산 시스템에 대한 침입과 피해가 증가되고 있는 실정이다. 이에 비정상행위 기반 침입탐지 시스템에 대한 연구가 활발히 진행되고 있는 가운데 특히, 시스템 호출 감사자료 척도에 은닉 마르코프 모델(HMM)로 모델링 하는 연구가 많이 이루어지고 있다. 하지만, 이는 일정한 임계값 이하의 비정상행위만을 감지할 뿐, 어떠한 유형의 침입인지를 판별하지 못한다. 본 논문에서는, 이러한 침입탐지 시스템의 맹점을 보완하기 위하여 Viterbi 알고리즘을 이용하여 상태 변화를 분석한 후, 어떤 유형의 침입이 발생하였는지를 판별하는 방법을 제안하고, 실험을 통해 제안한 시스템의 가능성을 보인다.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.69-80
• /
• 2014

The free distance of (n, k, l) convolutional codes has some connection with the memory length, which depends on not only l but also on k. To efficiently obtain a large memory length, we have constructed a new class of (2k, k, l) convolutional codes by (2k, k) block codes and (2, 1, l) convolutional codes, and its encoder and generation function are also given in this paper. With the help of some matrix modules, we designed a single structure Viterbi decoder with a parallel capability, obtained a unified and efficient decoding model for (2k, k, l) convolutional codes, and then give a description of the decoding process in detail. By observing the survivor path memory in a matrix viewer, and testing the role of the max module, we implemented a simulation with (2k, k, l) convolutional codes. The results show that many of them are better than conventional (2, 1, l) convolutional codes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.3
• /
• pp.9-18
• /
• 2001

In this paper, we present the joint symbol detection and channel estimation for an orthogonal frequency division multiplexing (OFDM) system in fading channels. The proposed methods are based on decision-directed channel estimation (DDCE) method and their symbol detection is achieved by using Viterbi algorithm. This Viterbi decision-directed channel estimation (VDDCE) method tracks time-varying channels and detects a maximum likelihood symbol sequence. Recursive Viterbi decision-directed channel estimation (RVDDCE) method based on VDDCE method is proposed to shorten the detecting depth. In this method, channel estimate and Viterbi processing are recursively performed every interval of training symbol. Also, average chann'el estimation (ACE) technique to reduce the effect of additive white Gaussian noise (AWGN) is applied VDDCE method and RVDDCE method. These proposed methods arc demonstrated by computer simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.13-22
• /
• 2005

IEEE 802.11a is a standard for the high-speed wireless local area network (WLAN), supporting from 6 up to 54 Mbps in a 5 GHz band. We propose a channel equalization algerian and a sampling clock recovery algorithm by utilizing the Viterbi decoder output of the IEEE 802.11a WLAN standard. The proposed channel equalizer adaptively compensates channel variations. The proposed system uses re-encoded Viterbi decoder outputs as reference symbols for the adaptation of the channel equalizer. It also extracts sampling phase information with the Viterbi decoder outputs for fine adjustment of the sampling clock. The proposed sampling clock recovery and equalizer are more robust to noise and frequency selective fading environments than conventional systems using only four pilot samples.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.1
• /
• pp.53-60
• /
• 1999

This paper is a study on the korean broadcasting speech recognition. Here we present the methods for the large vocabuary continuous speech recognition. Our main concerns are the language modeling and the search algorithm. The used acoustic model is the uni-phone semi-continuous hidden markov model and the used linguistic model is the N-gram model. The search algorithm consist of three phases in order to utilize all available acoustic and linguistic information. First, we use the forward Viterbi beam search to find word end frames and to estimate related scores. Second, we use the backword Viterbi beam search to find word begin frames and to estimate related scores. Finally, we use A/sup */ search to combine the above two results with the N-grams language model and to get recognition results. Using these methods maximum 96.0% word recognition rate and 99.2% syllable recognition rate are achieved for the speaker-independent continuous speech recognition problem with about 12,000 vocabulary size.

• The Journal of the Acoustical Society of Korea
• /
• v.10 no.3
• /
• pp.31-36
• /
• 1991

We propose an efficient pre-classification algorithm extracting candidate words to reduce the recognition time in a large-vocabulary recognition system and also propose the use of spectral and temporal smoothing of the observation probability to improve its classification performance. The proposed algorithm computes the coarse likelihood score for each word in a lexicon using the observation probabilities of speech spectra and duration information of recognition units. With the proposed approach we could reduce the computational amount by 74% with slight degradation of recognition accuracy in 1160-word recognition system based on the phoneme-level HMM. Also, we observed that the proposed coarse likelihood score computation algorithm is a good estimator of the likelihood score computed by the Viterbi algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.438-443
• /
• 2008

The efficient method to implement the Max-Log-MAP algorithm is proposed by modifying the conventional algorithm. It is called a parallel soft output Viterbi algorithm (SOVA) and the rigorous proof is given for the equivalence between the Max-Log-MAP algorithm and the parallel SOVA. The parallel SOVA is compared with the conventional algorithms and we show that it is an efficient algorithm implementing the modified SOVA in parallel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1419-1426
• /
• 1997

A new SCEE(Syndrome Check Error Estimation) decoding method for convolutional code and concatenated SCEE/RS (Reed-Solomon) conding scheme are proposed. First, we describe the operation of the decoding steps in the proposed algorithm. Then deterministic values on the decoding operation are drived when some combination of predecoder-reencoder is used. Computer simulation results show that the compuatational complexity of the proposed SCEE decoder is significantly reduced compared to that of conventional Viterbi-decoder without degratation of the $P_{e}$ performance. Also, the concatenated SCEE/RS decoder has almost the same complexity of a RS decoder and its coding gain is higher than that of soft decision Viterbi or RS decoder respectively.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.06a
• /
• pp.1017-1020
• /
• 1998

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2766-2770
• /
• 2009

Recently, the Green IT is noticed because of the effects of greenhouse gas emissions, a drain on natural resources and pollution. In this paper, Visible Light Communication (VLC) systems with Turbo Coded scheme using LED is proposed and simulated in an optical wireless channel. As a forward error correction scheme to reduce information losses, turbo coding was employed. To decode the codewords, The Map (Maximum a Posteriori) algorism and SOVA (Soft Output Viterbi Algorithm) is used. The above mentioned schemes are described and simulation results are analyzed. As using turbo codes scheme, BER performance of proposed VLC systems is improved about 5 [dB].