• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.63-72
• /
• 2005

In this paper, we propose the bit-rate control algorithm for the block based image compression like H.263, H.263+ or MPEG-4. The proposed algorithm is designed to identify the quantization parameter set through the Lagrangian optimization technique based on the well-known linear source model. We set the Lagrangian cost function with the rates and distortion calculated from the linear source model. We calculate the quantization parameter set using the Vitervi algorithm to solve the Lagrangian optimization problem considering the Dquant method of H.263 and MPEG-4. The proposed algorithm improves the video quality by up to 1.5 dB compared with the TMN8 scheme, and is more effective in the video sources with dynamic activities than the consistent quality approaches.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.311-318
• /
• 2013

This paper deals with a noise reduction algorithm which uses the binary masking in the time-frequency domain. To improve speech intelligibility in noise, noise-masked speech is decomposed into time-frequency units and mask "0" is assigned to masker-dominant region removing time-frequency units where noise is dominant compared to speech. In the previous research, Gaussian mixture models were used to classify the speech-dominant region and noise-dominant region which correspond to mask "1" and mask "0", respectively. In each frequency band, data were collected and trained to build the Gaussian mixture models and detection procedure is performed to the test data where each time-frequency unit belongs to speech-dominant region or noise-dominant region. In this paper, we consider the correlation of masks in the frequency domain and propose a post-processing method which exploits the Viterbi algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.81-84
• /
• 2001

본 논문은 중규모 단어급의 핵심어 검출 시스템에서 인식률 향상을 위해 미등록어 거절(Out-of-Vocabulary rejection) 기능을 제어하기 위한 연구이다. 이것은 핵심어 검출기에서 인식된 결과를 확인하는 과정으로 검증시스템이 구현되기 위해서는 매 음소마다 검증 기능이 필요하고, 이를 위해서 반음소(anti-phoneme model) 모델을 사용하였다. 검증의 역할은 인식기에서 인식된 단어가 등록어인지 미등록어인지 판별하는 것이다. 단어인식기는 비터비 탐색을 하므로, 기본적으로 단어단위로 인식을 하지만 그 인식된 단어는 내부적으로 음소단위로 인식된다. 따라서, 최소 검증 오류를 갖는 반음소 모델을 사용하고, 이를 이용하여 인식된 음소 단위들을 각각의 반음소 모델과 비교하여 통계적인 방법에 의해 신뢰도를 구한다 이 음소단위의 신뢰도를 단어 단위의 신뢰도로 환산하기 위해서 음소단위를 평균 내는 방식 을 취한다. 이렇게 함으로서, 등록어와 미등록어 사이의 분별력을 크게 하여 향상된 인식 성능을 얻었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2077-2089
• /
• 1996

In this paper, a memory organization and its control method are proposed for the implementation of parallel Virterbi decoders. The design is mainly focused on lowering the hardware complexity of a parallel Viterbi decoder which is to reduce the decoding speed. The memories requeired in a Viterbi decoder are the SMM(State Metric Memory) and the TBM(Traceback Memory);the SMM for storing the path metrics of states and the TBM for storing the survial path information. A general parallel Viterbi decoder for high datarate usually consists of multiple ACS (Add-Compare-Select) units and their corresponding memeory modules.for parallel ACS units, SMMs and TBMs are partitioned into smaller independent pairs of memory modules which are separately interleaved to provide the maximum processing speed. In this design SMMs are controlled with addrss generators which can simultaneously compute addresses of the new path metrics. A bit shuffle technique is employed to provide a parallel access to the TBMs to store the survivor path informations from multiple ACS modules.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.5
• /
• pp.731-737
• /
• 2000

In this paper we propose a decoding algorithm of Ungerboeck TCM/PSK in the concept of Radix-trellis, which has been applied to the decoding of convolutional codes for the high speed decoding. As an example we choose 16-state trellis coded 8-ary PSK. For Radix-4 and Radix-16 trellis decoding, we explain the path metric(PM) and the branch metric(BM) calculation. By using the simulation, we evaluate the bit error rate(BER) performance according to the number of binary digits for I-Q value, PM and BM registers. The proper number of binary digits of each register has been derived.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.1E
• /
• pp.21-26
• /
• 2007

In this paper, we propose a modified Viterbi algorithm to compensate for endpoint detection error during the decoding phase of an isolated word recognition task. Since the conventional Viterbi algorithm explores only the search space whose boundaries are fixed to the endpoints of the segmented utterance by the endpoint detector, the recognition performance is highly dependent on the accuracy level of endpoint detection. Inaccurately segmented word boundaries lead directly to recognition error. In order to relax the degradation of recognition accuracy due to endpoint detection error, we describe an unconstrained search of word boundaries and present an algorithm to explore the search space with efficiency. The proposed algorithm was evaluated by performing a variety of simulated endpoint detection error cases on an isolated word recognition task. The proposed algorithm reduced the Word Error Rate (WER) considerably, from 84.4% to 10.6%, while consuming only a little more computation power.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2511-2512
• /
• 2001

디스크의 탄젠셜 성분의 틸트가 생긴 경우 발생하는 체널의 변화에 대해 적응형 부분 응답 신호처리 과정인 비터비 디코더를 적용하게 되면 비트오율에 상당한 효과를 가져온다. 이러한 적응 과정을 효과적으로 진행하기 위한 간략화된 오류 발생 알고리즘을 제안한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.1
• /
• pp.21-28
• /
• 2004

In this paper we apply block turbo coding at the transmitter and iterative decoding algorithm at the receiver for different operating modes, based on the 5 ㎓ IEEE 802.1 la WLAN system, instead of convolutional coding and soft decision viterbi algorithm to improve forward error correcting performance. Experimental results showed that each coding scheme outperforms coding gains of up to 3.5 ㏈ at the BER of 10$\^$-3/.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.11a
• /
• pp.152-153
• /
• 2023

해상 무선 통신에서 신호 다중 경로로 인하여 장거리 데이터 통신에 어려움이 있을 수 있다. 이를 해소하기 위하여 채널 등화 기술을 사용할 수 있다. 제안하는 채널 등화 기술은 비터비 알고리즘을 이용한 시퀀스 신호 검출로 구현의 복잡도를 낮추기 위하여 결정 피드백 방식을 이용하여 트랠리스 상태의 개수를 줄였다. 16QAM과 심볼 속도 76.8kHz의 신호에 대하여 10usec와 30usec 지연 시간 차이를 갖는 2-way 신호 경로의 채널 모델에 대한 컴퓨터 모의 시험을 수행하였다. 제안한 등화 기술을 사용할 경우 고려한 다중 신호 경로에 대하여 수신 오류율에서 error flow가 관찰되지 않는 것을 확인하였다.