• Title/Summary/Keyword: Viterbi algorithm

Search Result 195, Processing Time 0.027 seconds

Large Vocabulary Continuous Speech Recognition Based on Language Model Network (언어 모델 네트워크에 기반한 대어휘 연속 음성 인식)

  • 안동훈;정민화
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.6
    • /
    • pp.543-551
    • /
    • 2002
  • In this paper, we present an efficient decoding method that performs in real time for 20k word continuous speech recognition task. Basic search method is a one-pass Viterbi decoder on the search space constructed from the novel language model network. With the consistent search space representation derived from various language models by the LM network, we incorporate basic pruning strategies, from which tokens alive constitute a dynamic search space. To facilitate post-processing, it produces a word graph and a N-best list subsequently. The decoder is tested on the database of 20k words and evaluated with respect to accuracy and RTF.

Performance of analysis UWB system using Vterbi decoding (Vterbi decoding을 적용한 UWB 시스템이 성능분석)

  • Choi, Jung-Hun;Han, Tae-Young;Park, Sung-Kyung;Kim, Nam
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.303-307
    • /
    • 2003
  • In this paper, the W(ultra widebend) system is used for high speed transmission applying BPSK(Binary Phase Shift Keying) and QPSK (Quadrature Phase Shift Keying), and utilizing the convolution coding with code rate, 1/2 and constraint length, K=7 in order to reduce the bit error rate. And the performance of system is analyzed in the AWGN(Additive White Gaussian Noise) channel environment by using the Viterbi decoding algorithm and adopting the time-hopping sequence as a multiple access method in order to avoid the multiuser interference.

  • PDF

Implementation of Spread Spectrum FTS Encoder/Decoder (대역확산방식 FTS 인코더/디코더 구현)

  • Lim, You-Chol;Ma, Keun-Soo;Kim, Myung-Hwan;Lee, Jae-Deuk
    • Aerospace Engineering and Technology
    • /
    • v.8 no.1
    • /
    • pp.179-186
    • /
    • 2009
  • This paper describes the design and implementation for spread spectrum FTS encoder and decoder. The FTS command format is defined by 64 bit encrypted packet that contains all required information relayed between the ground and the vehicle. Encryption is accomplished using the Tripple-DES encryption algorithm in block encryption form. The proposed FTS encoder and decoder is using the Convolution Encoding and Viterbi Decoding for forward error correction. The Spread Spectrum Modulation is done using a PN code, which is 256 bit gold code. The simulation result shows that the designed FTS decoder is compatible with the designed FTS encoder.

  • PDF

Nonbinary Convolutional Codes and Modified M-FSK Detectors for Power-Line Communications Channel

  • Ouahada, Khmaies
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.270-279
    • /
    • 2014
  • The Viterbi decoding algorithm, which provides maximum - likelihood decoding, is currently considered the most widely used technique for the decoding of codes having a state description, including the class of linear error-correcting convolutional codes. Two classes of nonbinary convolutional codes are presented. Distance preserving mapping convolutional codes and M-ary convolutional codes are designed, respectively, from the distance-preserving mappings technique and the implementation of the conventional convolutional codes in Galois fields of order higher than two. We also investigated the performance of these codes when combined with a multiple frequency-shift keying (M-FSK) modulation scheme to correct narrowband interference (NBI) in power-line communications channel. Themodification of certain detectors of the M-FSK demodulator to refine the selection and the detection at the decoder is also presented. M-FSK detectors used in our simulations are discussed, and their chosen values are justified. Interesting and promising obtained results have shown a very strong link between the designed codes and the selected detector for M-FSK modulation. An important improvement in gain for certain values of the modified detectors was also observed. The paper also shows that the newly designed codes outperform the conventional convolutional codes in a NBI environment.

Experimental Results on an Underwater Acoustic Digital Transceiver Based on DSP (수중 음향 디지털 송수신기의 DSP 구현 및 실험적 고찰)

  • 박종원;최영철;이덕환;김시문;김승근;임용곤
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.296-299
    • /
    • 2003
  • In this paper, an underwater acoustic digital transceiver is designed and implemented by a multiple DSPs system. We have designed a QPSK transmitter based on look-up table and 13-symbols Barker code is used for frame synchronization. Channel distortions are compensated by a wide-band beamformer based on FIR filter and an adaptive equalize. with RLS algorithm. Uniform linear array (ULA) with four elements is used for the spartial signal processing. 1/2 convolutional code and Viterbi decoder are implemented to overcome time-varying multi-path fading. Also, we show experimental results in the underwater anechoic basin at KRISO/KORDl and Goseong, Donghae and Soyang lake of Kangwon-do.

  • PDF

CONTINUOUS DIGIT RECOGNITION FOR A REAL-TIME VOICE DIALING SYSTEM USING DISCRETE HIDDEN MARKOV MODELS

  • Choi, S.H.;Hong, H.J.;Lee, S.W.;Kim, H.K.;Oh, K.C.;Kim, K.C.;Lee, H.S.
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.1027-1032
    • /
    • 1994
  • This paper introduces a interword modeling and a Viterbi search method for continuous speech recognition. We also describe a development of a real-time voice dialing system which can recognize around one hundred words and continuous digits in speaker independent mode. For continuous digit recognition, between-word units have been proposed to provide a more precise representation of word junctures. The best path in HMM is found by the Viterbi search algorithm, from which digit sequences are recognized. The simulation results show that a interword modeling using the context-dependent between-word units provide better recognition rates than a pause modeling using the context-independent pause unit. The voice dialing system is implemented on a DSP board with a telephone interface plugged in an IBM PC AT/486.

  • PDF

A Watermarking Method Based on the Trellis Code with Multi-layer (다층구조를 갖는 trellis부호를 이용한 워터마킹)

  • Lee, Jeong Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.949-952
    • /
    • 2009
  • In this paper, a watermarking method based on the trellis code with multi-layer is proposed. An image is divided $8{\times}8$ block with no overlapping, and compute the discrete cosine transform(DCT) of each block, and the 12 medium-frequency AC terms from each block are extracted. Next it is compared with gaussian random vectors with zero mean and unit variance. As these processing, the embedding vectors with minimum linear correlation can be obtained by Viterbi algorithm at each layer of trellis coding. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images.

  • PDF

Performance Analysis of Asymmetric Turbo Codes Using SOVA Decoding Algorithm (SOVA 복호방법을 이용한 비대칭구조 터보부호의 성능분석)

  • 신한균;강수훈;최회동;노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.553-557
    • /
    • 2000
  • It is known that turbo codes have an error-floor bound according to the effective free distance at high SNR. But the performance for turbo codes in the water-fall area at low SHR has not been studied yet. In this paper, asymmetric turbo codes that consist of RSC(recursive systematic convolutional) codes with different constraint length are proposed and their performance is analysed for SOVA decoding algorithm.

  • PDF

Reduced-State MLSD Based on Volterra Kernels for Square-Law Detected Multipath Channels

  • Ha, Young-Sun;Chung, Won-Zoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.12
    • /
    • pp.2315-2325
    • /
    • 2011
  • We propose a novel reduced-state maximum-likelihood sequence detection (MLSD) structure using the Viterbi algorithm based on the second-order Volterra kernel modeling nonlinear distortion due to square law detection of multipath channels commonly occurring in chromatic dispersion (CD) or polarization mode dispersion (PMD) in optical communication systems. While all existing MLSD methods for square-law detection receivers are based on direct computation of branch metrics, the proposed algorithm provides an efficient and structured way to implement reduced-state MLSD with almost the same complexity of a MLSD for linear channels. As a result, the proposed algorithm reduces the number of parameters to be estimated and the complexity of computation.

Vehicle trajectory prediction based on Hidden Markov Model

  • Ye, Ning;Zhang, Yingya;Wang, Ruchuan;Malekian, Reza
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3150-3170
    • /
    • 2016
  • In Intelligent Transportation Systems (ITS), logistics distribution and mobile e-commerce, the real-time, accurate and reliable vehicle trajectory prediction has significant application value. Vehicle trajectory prediction can not only provide accurate location-based services, but also can monitor and predict traffic situation in advance, and then further recommend the optimal route for users. In this paper, firstly, we mine the double layers of hidden states of vehicle historical trajectories, and then determine the parameters of HMM (hidden Markov model) by historical data. Secondly, we adopt Viterbi algorithm to seek the double layers hidden states sequences corresponding to the just driven trajectory. Finally, we propose a new algorithm (DHMTP) for vehicle trajectory prediction based on the hidden Markov model of double layers hidden states, and predict the nearest neighbor unit of location information of the next k stages. The experimental results demonstrate that the prediction accuracy of the proposed algorithm is increased by 18.3% compared with TPMO algorithm and increased by 23.1% compared with Naive algorithm in aspect of predicting the next k phases' trajectories, especially when traffic flow is greater, such as this time from weekday morning to evening. Moreover, the time performance of DHMTP algorithm is also clearly improved compared with TPMO algorithm.