• Title/Summary/Keyword: Viterbi algorithm

Search Result 195, Processing Time 0.025 seconds

Design of Viterbi Decoder for IMT-2000 (IMT-2000용 비터비 복호기의 효율적인 설계)

  • 정인택;송상섭
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.1
    • /
    • pp.67-72
    • /
    • 2001
  • Convolutional code and turbo code are used in the forward and backward link of IMT-2000. In this research, we will be in consideration of Viterbi algorithm In this paper, we design Viterbi decoder with 3-bits soft decision and SMT for the convolutional code in the forward link and backward link of IMT-2000 system. The major parameters of 3-bits Viterbi decoder is determined by simulation to have identical performance with the 4-bit soft decision Viterbi decoder.

  • PDF

Sound Model Generation using Most Frequent Model Search for Recognizing Animal Vocalization (최대 빈도모델 탐색을 이용한 동물소리 인식용 소리모델생성)

  • Ko, Youjung;Kim, Yoonjoong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.1
    • /
    • pp.85-94
    • /
    • 2017
  • In this paper, I proposed a sound model generation and a most frequent model search algorithm for recognizing animal vocalization. The sound model generation algorithm generates a optimal set of models through repeating processes such as the training process, the Viterbi Search process, and the most frequent model search process while adjusting HMM(Hidden Markov Model) structure to improve global recognition rate. The most frequent model search algorithm searches the list of models produced by Viterbi Search Algorithm for the most frequent model and makes it be the final decision of recognition process. It is implemented using MFCC(Mel Frequency Cepstral Coefficient) for the sound feature, HMM for the model, and C# programming language. To evaluate the algorithm, a set of animal sounds for 27 species were prepared and the experiment showed that the sound model generation algorithm generates 27 HMM models with 97.29 percent of recognition rate.

Performance Analysis of STBC System Combined with Convolution Code fot Improvement of Transmission Reliability (전송신뢰성의 향상을 위해 STBC에 컨볼루션 코드를 연계한 시스템의 성능분석)

  • Shin, Hyun-Jun;Kang, Chul-Gyu;Oh, Chang-Heon
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.6
    • /
    • pp.1068-1074
    • /
    • 2011
  • In this paper, the proposed scheme is STBC(space-time block codes) system combined with convolution code which is the most popular channel coding to ensure the reliability of data transmission for a high data rate wireless communication. The STBC is one of MIMO(multi-input multi-output) techniques. In addition, this scheme uses a modified viterbi algorithm in order to get a high system gain when data is transmitted. Because we combine STBC and convolution code, the proposed scheme has a little high quantity of computation but it can get a maximal diversity gain of STBC and a high coding gain of convolution code at the same time. Unlike existing viterbi docoding algorithm using Hamming distance in order to calculate branch matrix, the modified viterbi algorithm uses Euclidean distance value between received symbol and reference symbol. Simulation results show that the modified viterbi algorithm improved gain 7.5 dB on STBC 2Tx-2Rx at $BER=10^{-2}$. Therefore the proposed scheme using STBC combined with convolution code can improve the transmission reliability and transmission efficiency.

A Two-Step Soft Output Viterbi Algorithm with Algebraic Structure (대수적 구조를 가진 2단 연판정 출력 비터비 알고리듬)

  • 김우태;배상재;주언경
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12A
    • /
    • pp.1983-1989
    • /
    • 2001
  • A new two-step soft output Viterbi algorithm (SOVA) for turbo decoder is proposed and analyzed in 7his paper. Due to the algebraic structure of the proposed algorithm, slate and branch metrics can be obtained wish parallel processing using matrix arithmetic. As a result, the number of multiplications to calculate state metrics of each stage and total memory size can be decreased tremendously. Therefore, it can be expected that the proposed algebraic two-step SOVA is suitable for applications in which low computational complexity and memory size are essential.

  • PDF

A Study on the Aprpication of DAMA-SCPC System Using Convolutional Codes and Bviterbi Algorithm (길쌈부호(Convolutional Codes)와 Viterbi 알고 리듬을 이용한 FEC CODE의 DAMA-SCPC 시스템에의 적용에 관한 고찰)

  • 김정호
    • Journal of the Korean Professional Engineers Association
    • /
    • v.26 no.3
    • /
    • pp.26-33
    • /
    • 1993
  • 위성을 이용한 DAMA-SCPC 지구국시스템의 경우 대체적으로 전송경로상에서 발생되는 에러를 제어하는 방법으로 FEC 기법을 채택하고 있다. 본 고에서는 DAMA -SCPC 지구국 시스템의 설계에 적용할 수 있도록 길쌈부호와 Viterbi 복호법, 그리고 (m-1)/m의 부호율을 위한 소기식 길쌈부호에 대해 살펴보고, 상용화 FEC CODEC 제품 중 가격이 비교적 저렴하고 다양한 기능을 제공하는 QUALCOM사의 Q0256 CODEC의 구성 및 제공 기능에 대해 분석한 후, 이 FEC CODEC을 DAMA-SCPC 지구국 시스템의 채널부에 적용시킬 때의 내장 부가 장치와 제공 기능들의 설계 및 이용 방안에 대해 고찰하였다.

  • PDF

Design of A Turbo-code Decoder for Speech Transmission in IMT-2000 (IMT-2000에서 음성 전송을 위한 터보 코드 복호기 설계)

  • 강태환;박성모
    • Proceedings of the IEEK Conference
    • /
    • 2000.11b
    • /
    • pp.273-276
    • /
    • 2000
  • Recently, Turbo code has been considered for channel coding in IMT-2000(International Mobile Telecommunication-2000) system, because it offers better error correcting capability than the traditional convolution/viterbi coding . In this paper, a turbo code decoder for speech transmission in IMT-2000 system with frame size 192 bits, constrait length K=3, generator polynomials G(5,7) and code rate R=1/3 is designed using SOVA(Soft Output Viterbi Algorithm) and block interleaver

  • PDF

Hidden Markov Model-based Extraction of Internet Information (은닉 마코브 모델을 이용한 인터넷 정보 추출)

  • Park, Dong-Chul
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.8-14
    • /
    • 2009
  • A Hidden Markov Model(HMM)-based information extraction method is proposed in this paper. The proposed extraction method is applied to extraction of products' prices. The input of the proposed IESHMM is the URLs of a search engine's interface, which contains the names of the product types. The output of the system is the list of extracted slots of each product: name, price, image, and URL. With the observation data set Maximum Likelihood algorithm and Baum-Welch algorithm are used for the training of HMM and The Viterbi algorithm is then applied to find the state sequence of the maximal probability that matches the observation block sequence. When applied to practical problems, the proposed HMM-based system shows improved results over a conventional method, PEWEB, in terms of recall ration and accuracy.

A SPEC-T Viterbi decoder implementation with reduced-comparison operation (비교 연산을 개선한 SPEC-T 비터비 복호기의 구현)

  • Bang, Seung-Hwa;Rim, Chong-Suck
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.81-89
    • /
    • 2007
  • The Viterbi decoder, which employs the maximum likelihood decoding method, is a critical component in forward error correction for digital communication system. However, lowering power consumption on the Viterbi decoder is a difficult task since the number of paths calculated equals the number of distinctive states of the decoder and the Viterbi decoder utilizes trace-back method. In this paper, we propose a method which minimizes the number of operations performed on the comparator, deployed in the SPEC-T Viterbi decoder implementation. The proposed comparator was applied to the ACSU(Add-Compare-Select Unit) and MPMSU(Minimum Path Metric Search Unit) modules on the decoder. The proposed ACS scheme and MPMS scheme shows reduced power consumption by 10.7% and 11.5% each, compared to the conventional schemes. When compared to the SPEC-T schemes, the proposed ACS and MPMS schemes show 6% and 1.5% less power consumption. In both of the above experiments, the threshold value of 26 was applied.

Trellis-coded .pi./4 shift QPSK with sliding multiple symbol detection흐름 다중심벌검파를 적용한 트렐리스 부호화된 .pi./4 shift QPSK

  • 전찬우;박이홍;김종일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.2
    • /
    • pp.483-494
    • /
    • 1996
  • In this paper, we proposed the receive decoder and Virterbi algorithm with sliding multiple symbol detection using MLSE. the informationis transmitted by the phase difference of the adjacent channel signal at the .pi./4 shift QPSK. In order to apply the .pi./4 shift QPSK to TCM, we use the signal set expansion and the signal set partition by the phase differences. And the Viterbi decoder containing branch mertrice of the squared Euclidean distance of the first, second and Lth order phase difference is introduced in order to extract the information in the differential detection of the Trellis-Coded .pi./4 shift QPSK. The proposed Viterbi decoder and receiver are conceptually same to the sliding multiple symbol detection method using the MLSE. By uisng this method, the study shows that the Trellis-Coded .pi./4 shift QPSK is an attractive scheme for the power and the bandimited systems while also improving the BER performance when the Viterbi decoder is employed to the Lth order phase difference metrics.

  • PDF

Stochastic approximation to an optimal performance o fthe neural convolutional decoders (신경회로망 콘볼루션 복호기의 최적 성능에 대한 확률적 근사화)

  • 유철우;강창언;홍대식
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.4
    • /
    • pp.27-36
    • /
    • 1996
  • It is well known that the viterbi algorithm proposed as a mthod of decoding convolutional codes is in fact maximum likelihood (ML) and therefore optimal. But, because hardware complexity grows exponentially with the constraint length, there will be severe constraints on the implementation of the viterbi decoders. In this paper, the three-layered backpropagation neural networks are proposed as an alternative in order to get sufficiently useful performance and deal successfully with the problems of the viterbi decoder. This paper shows that the neural convolutional decoder (NCD) can make a decision in the point of ML in decoding and describes simulation results. The cause of the difference between stochastic results and simulation results is discussed, and then thefuture prospect of the NCD is described on the basis of the characteristic of the transfer function.

  • PDF