• Title/Summary/Keyword: Viterbi Decoding

Search Result 128, Processing Time 0.023 seconds

Reduced-state sequence estimation for trellis-coded 8PSK/cyclic prefixed single carrier (트렐리스 부호화된 8PSK/CPSC를 위한 RSSE 방식)

  • 고상보;강훈철;좌정우
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.20-23
    • /
    • 2003
  • A reduced-state sequence estimation(RSSE) for trellis-coded (TC) 8PSK/cyclic prefixed single carrier(CPSC) with minimum mean-square error-liner equalization(MMSE-LE) on frequency-selective Rayleigh fading channels is proposed. The Viterbi algorithm (VA) is used to search for the best path through the reduced-state trellis combined equalization and TCM decoding. The symbol error probability of the proposed scheme is confirmed by computer simulation.

  • PDF

Symbol Decoding Schemes Combined with Channel Estimations for Coded OFDM Systems in Fading Channels. (페이딩 채널환경에서 CDFDM 시스템에 대한 채널 추정과 결합된 심볼검출 방법)

  • Cho, Jin-Woong;Kang, Cheol-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.9
    • /
    • pp.1-10
    • /
    • 2000
  • This paper proposes symbol decoding schemes combined with channel estimation techniques for coded orthogonal frequency division multiplexing (COFDM) systems in fading channels. sThe proposed symbol decoding schemes are consisted of a symbol decoding technique and channel estimation techniques. The symbol decoding based on Viterbi algorithm is achieved by matching the length of branch word from encoder trellis to the codeword length of symbol candidate on decoder trellis. Three combination schemes are described and their error performances are compared. The first scheme is to combine a symbol decoding technique with a training channel estimation technique. The second scheme joins a decision directed channel estimation technique to the first scheme. The time varying channel transfer functions are tracked by the decision directed channel estimation technique and the channel transfer functions used in the symbol decoder are updated every COFDM symbol. Finally, In order to reduce the effect of additive white Gaussian noise (AWGN) between adjacent subchannels, deinterleaved average channel estimation technique is combined. The error performances of the three schemes are significantly improved being compared with that of zero forcing equalizing schemes.

  • PDF

A Study of Efficient Viterbi Equalizer in FTN Channel (FTN 채널에서의 효율적인 비터비 등화기 연구)

  • Kim, Tae-Hun;Lee, In-Ki;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1323-1329
    • /
    • 2014
  • In this paper, we analyzed efficient decoding scheme with FTN (Faster than Nyquist) method that is transmission method faster than Nyquist theory and increase the throughput. we proposed viterbi equalizer model to minimize ISI (Inter-Symbol Interference) when FTN signal is transmitted. the proposed model utilized interference as branch information. In this paper, to decode FTN singal, we used turbo equalization algorithms that iteratively exchange probabilistic information between soft Viterbi equalizer (BCJR method) and LDPC decoder. By changing the trellis diagram in order to maximize Euclidean distance, we confirmed that performance was improved compared to conventional methods as increasing throughput of FTN signal.

Realization of Forward Real-time Decoder using Sliding-Window with decoding length of 6 (복호길이 6인 Sliding-Window를 적용한 순방향 실시간 복호기 구현)

  • Park Ji woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4C
    • /
    • pp.185-190
    • /
    • 2005
  • In IS-95 and IMT-2000 systems using variable code rates and constraint lengths, this paper limits code rate 1/2 and constraint length 3 and realizes forward real-time decoder using Sliding-Window with decoding length 6 and PVSL(Prototype Vector Selecting Logic), LVQ(Learning Vector Quantization) in Neural Network. In comparison condition to theoretically constrained AWGN channel environment at $S/(N_{0}/2)=1$ I verified the superiority of forward real-time decoder through hard-decision and soft-decision comparison between Viterbi decoder and forward real-time decoder such as BER and Secure Communication and H/W Structure.

An Efficient CPM Adaptive Decoding Technique over the Burst Error Channel (연집 오류 채널에 효율적인 CPM 적응복호 방식)

  • 정종문;김대중;정호영;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.8
    • /
    • pp.1548-1557
    • /
    • 1994
  • In this paper, the dual mode error correcting adaptive decoding algorithm which is adapted to the continuous phase frequency shift keying(CPFSK) modulation is presented as a technique for overcoming the distortion that reveals from the Rayleigh fading channel. The dual mode adaptive decoder nominally operates as a Viterbi decoder and switches to the burst error correcting mode, whenever the decoder detects an uncorrectable burst error pattern. Under the fading channel environment and when the usable memory quantity is restricted, the dual mode adaptive decoding algorithm shows an advantage in the BER performance over the interleaving technique, and also obtains the merit of not needing the large time delay that the interleaving technique requires. The experimental results from the computer simulation demonstrate the performance of the algorithm and verify the theoretical results.

  • PDF

Finite Soft Decision Data Combining for Decoding of Product Codes With Convolutional Codes as Horizontal Codes (길쌈부호를 수평부호로 가지는 곱부호의 복호를 위한 유한 연판정 데이터 결합)

  • Yang, Pil-Woong;Park, Ho-Sung;Hong, Seok-Beom;Jun, Bo-Hwan;No, Jong-Seon;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7A
    • /
    • pp.512-521
    • /
    • 2012
  • In this paper, we propose feasible combining rules for a decoding scheme of product codes to apply finite soft decision. Since the decoding scheme of product codes are based on complex tanh calculation with infinite soft decision, it requires high decoding complexity and is hard to practically implement. Thus, simple methods to construct look-up tables for finite soft decision are derived by analyzing the operations of the scheme. Moreover, we focus on using convolutional codes, which is popular for easy application of finite soft decision, as the horizontal codes of product codes so that the proposed decoding scheme can be properly implemented. Numerical results show that the performance of the product codes with convolutional codes using 4-bit soft decision approaches to that of same codes using infinite soft decision.

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.

Iterative Decoding Algorithm for VLC Systems (가시광 통신 시스템을 위한 반복 복호 알고리즘)

  • Koo, Sung-Wan;Kim, Jin-Young
    • 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].

Implementation-Friendly QRM-MLD Using Trellis-Structure Based on Viterbi Algorithm

  • Choi, Sang-Ho;Heo, Jun;Ko, Young-Chai
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.20-25
    • /
    • 2009
  • The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.