• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1010-1019
• /
• 2004

In this paper, we represent Nakagami-m fading channel as finite-State Markov Channel (FSMC) and analyze the performance of wireless communication system with varying the fading channel condition. In FSMC model, the received signal's SNR is divided into finite intervals and these intervals are formed into Markov chain states. Each state is modeled by a BSC and the transition probability is dependent upon the physical characterization of the channel. The steady state probability and average symbol error rate of each state and transition probability are derived by numerical analysis and FSMC model is formed with these values. We found that various fading channels can be represented with FSMC by changing state transition index. In fast fading environment in which state transition index is large, the channel can be viewed as i.i.d. channel and on the contrary, in slow fading channel where state transition index is small, the channel can be represented by simple FSMC model in which transitions occur between just adjacent states. And we applied the proposed FSMC model to analyze the coding gain of random error correcting code on various fading channels via computer simulation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.51-51
• /
• 2001

본 논문은 디지털 순서회로 설계시 상태할당 알고리즘 개발에 관한 연구로, 동적 소비전력을 감소시키기 위하여 상태변수의 변화를 최소로 하는 코드를 할당하여 상태코드가 변화하는 스위칭횟수를 줄이도록 하였다. 상태를 할당하는데는 Markov의 확률함수를 이용하여 hamming거리가 최소가 되도록 상태 천이도에서 각 상태를 연결하는 edge에 weight를 정의한 다음, 가중치를 이용하여 각 상태들간의 연결성을 고려하여 인접한 상태들간에는 가능한 적은 비트 천이를 가지도륵 모든 상태를 반복적으로 찾아 계산하였다. 비트 천이의 정도를 나타내기 위하여 cost 함수로 계산한 결과 순서회로의 종류에 따라 Lakshmikant의 알고리즘보다 최고 57.42%를 감소시킬 수 있었다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.855-861
• /
• 2007

In real system application, the IMM-based position tracking algorithm requires robust performance, less computing resources and easy design procedure with respect to the uncertain target maneuvering, To solve these problems, an adaptive fuzzy interacting multiple model (AFIMM) algorithm, which is based on the well-defined basis sub-models and well-adjusted mode transition probabilities (MTPs), is proposed. Simulation results show that the proposed algorithm effectively solves the problems in the real system application of the IMM-based position tracking algorithm.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.381-388
• /
• 2003

This paper presents a method of giving weights to garbage class clustering and Filler model to improve performance of keyword spotting system and a time-saving method of dialogue speech processing system for keyword spotting by calculating keyword transition probability through speech analysis of task domain users. The point of the method is grouping phonemes with phonetic similarities, which is effective in sensing similar phoneme groups rather than individual phonemes, and the paper aims to suggest five groups of phonemes obtained from the analysis of speech sentences in use in Korean morphology and in stock-trading speech processing system. Besides, task-subject Filler model weights are added to the phoneme groups, and keyword transition probability included in consecutive speech sentences is calculated and applied to the system in order to save time for system processing. To evaluate performance of the suggested system, corpus of 4,970 sentences was built to be used in task domains and a test was conducted with subjects of five people in their twenties and thirties. As a result, FOM with the weights on proposed five phoneme groups accounts for 85%, which has better performance than seven phoneme groups of Yapanel [1] with 88.5% and a little bit poorer performance than LVCSR with 89.8%. Even in calculation time, FOM reaches 0.70 seconds than 0.72 of seven phoneme groups. Lastly, it is also confirmed in a time-saving test that time is saved by 0.04 to 0.07 seconds when keyword transition probability is applied.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.40-49
• /
• 1994

In this paper, we propose methods for improving the performance of word recognition system. The ray stratey of the first method is to apply the inertia to the feature vector sequences of speech signal to stabilize the transitions between VQ cdoes. The second method is generating the new observation probabilities using the transition matrix of VQ codes as weights at the observation probability of the output symbol, so as to take into account the time relation between neighboring frames in DHMM. By applying the inertia to the feature vector sequences, we can reduce the overlapping of probability distribution of the response paths for each word and stabilize state transitions in the HMM. By using the transition matrix of VQ codes as weights in conventional DHMM. we can divide the probability distribution of feature vectors more and more, and restrict the feature distribution to a suitable region so that the performance of recognition system can improve. To evaluate the performance of the proposed methods, we carried out experiments for 50 DDD area names. As a result, the proposed methods improved the recognition rate by $4.2\%$ in the speaker-dependent test and $12.45\%$ in the speaker-independent test, respectively, compared with the conventional DHMM.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.145-152
• /
• 2012

Due to the large sizes of streaming media, previous delivery techniques are not providing optimal performance. For this purpose, video proxy server is employed for reducing the bandwidth consumption, network congestion, and network traffic. This paper proposes a fast distributed network file system using state transition model in the media streaming system for efficient utilization of video proxy server. The proposed method is composed of three steps: step 1. Training process using state transition model, step 2. base and decision probability generation, and step 3. storing and deletion based on probability. In addition, storage space of video proxy server is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, the proposed method provides the lowest user start-up latency and the highest bandwidth saving significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1870-1877
• /
• 2012

Transient signals generally have short duration and variable length with time-varying and non-stationary characteristics. Thus frame-based pattern matching method is useful for classification of transient signals. In this paper, we propose a new method for classification of underwater transient signals using a Gaussian mixture model(GMM). We carried out classification experiments for various underwater transient signals depending upon the types of noise, signal-to-noise ratio, and number of mixtures in the GMM. Experimental results have verified that the proposed method works quite well for classification of underwater transient signals.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.642-651
• /
• 2014

This paper proposes three probabilistic models for syllable-based Korean morphological analysis, and presents the performance of proposed probabilistic models. Probabilities for the models are acquired from POS-tagged corpus. The result of 10-fold cross-validation experiments shows that 98.3% answer inclusion rate is achieved when trained with Sejong POS-tagged corpus of 10 million eojeols. In our models, POS tags are assigned to each syllable before spelling recovery and morpheme generation, which enables more efficient morphological analysis than the previous probabilistic models where spelling recovery is performed at the first stage. This efficiency gains the speed-up of morphological analysis. Experiments show that morphological analysis is performed at the rate of 147K eojeols per second, which is almost 174 times faster than the previous probabilistic models for Korean morphology.

• Journal of Korean Society of Forest Science
• /
• v.94 no.6
• /
• pp.387-396
• /
• 2005

Having employed the transitional probability model based on Markov chain, the study was carried out to examine successional trends for community types in the natural deciduous forest of Mt. Jumbong. The species composition of oncoming generation in overstory was estimated from that of mid-story, and the species composition in mid-story was based upon that of understory. Successional trend for each community was predicted from the reorganized probability matrix of tree replacement by the square of climax index, which was evaluated by the factors of light absorption, reproduction, and wood quality. As the result of analysis, following table shows the oncoming generation of steady state and dominant species in overstory and mid-story by community types. Even though Acer pseudo-sieboldianum and Carpinus cordata could hardly reach the canopy layer due to the intrinsic growth form, these species were predicted to maintain high compositional ratio so as to play an important ecological role in the study forest ecosystem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.540-543
• /
• 2012

최근에 녹색 IT의 일환으로 IT 장비에서 소비하는 에너지 크기를 감소시킴으로써 발생하는 탄소발생률을 줄이고, 장비 운용 비용을 낮추는 연구가 각광을 받고 있다. 그에 따라 본 논문에서는 차세대 통신망의 강력한 후보로 예상되는 광 버스트 스위칭 망에서 에너지 절감 기법 중 하나인 저 전력대기 방식을 사용할 때 발생하는 에너지 소비량에 대한 수식 모델을 제안한다. 제안된 수식 모델에서는 입력되는 트래픽 패턴을 고려하여 가져갈 수 있는 상태천이확률을 구하고 이에 따른 에너지 소비량을 예측해 볼 수 있다.