• Title/Summary/Keyword: 트렐리스

Search Result 90, Processing Time 0.031 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

Performance of Space-Time Trellis Codes with Minimum Hamming Distance Mapping on Fast Fading Channels (빠른 페이딩 채널에서 MHD 매핑을 응용한 STTC 부호의 성능평가)

  • Jin, Ik-Soo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.2
    • /
    • pp.96-103
    • /
    • 2010
  • This paper studies the performance of STTC with minimum Hamming distance (MHD) mapping in order to improve the bit error rate (BER) performance. Unfortunately, the MHD mapping used in trellis coded modulation (TCM) or multiple trellis coded modulation (MTCM) cannot be directly applied to STTC because the trellis structure of STTC is generally different from that of TCM or MTCM. Therefore, we need a simple modification to apply the MHD mapping concept in STTC. The core of the modification assigns information bits with a Hamming distance in proportion to the sum of the Euclidean distance to trellis branch of STTC. To the best knowledge, this combination has not been considered yet. The BER performance is examined with simulations and the performance of MHD mapping is compared to that of well known natural mapping and Gray mapping on both fast Rayleigh as well as fast Rician fading channels. It is shown that the performance of MHD mapping is much better than that of natural mapping or Gray mapping over fast Rician fading channels, especially.

An Equalization Technique of Dual-Feedback Structure in ATSC DTV Receivers (ATSC DTV 수신기를 위한 이중 후방필터 구조의 결정 궤환 등화기)

  • Oh, Young-Ho;Kim, Dae-Jin
    • Journal of Broadcast Engineering
    • /
    • v.10 no.4 s.29
    • /
    • pp.540-547
    • /
    • 2005
  • In the DFE(Decision Feedback Equalizer) for ATSC DTV receivers, there are decision errors in the slicer or. the simplified trellis decoder, and these decided false data comes to the feedback filter to make the error propagation phenomenon. The error propagation degrades the equalizer performance by increasing residual errors as well as slowing down the convergence rate. In this paper we propose a dual-feedback equalization structure. There are two feedback filters. One is the decision feedback filter which uses the simplified trellis decoder output data, the other is non-decision feedback filter which uses the equalizer output data. The additional non-decision feedback filter doesn't introduce the error propagation, so it can compensate the error propagation. The proposed structure accelerates the convergence rate as well as reduces output men-square error(MSE). We analyzed the performance enhancement of DTV receiver using dual-feedback equalization structure.

Generalized Sub-optimum Decoding for Space-Time Trellis Codes in Quasistatic Flat Fading Channel (준정적 플랫 페이딩 채널에서 시공간 트렐리스 부호의 일반화된 부최적 복호법)

  • Kim Young Ju;Shin Sang Sup;Kang Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.1 s.343
    • /
    • pp.89-94
    • /
    • 2006
  • We present a generalized version of principal ratio combining (PRC)[1], which is a near-optimum decoding scheme for space-time trellis codes in quasi-static flat fading environments. In [1], the performance penalty increases as the number of receive antennas increases. In the proposed scheme, receive antennas are divided into K groups, and the PRC decoding method is applied to each group. This shows a flexible tradeoff between performance and decoding complexity by choosing the appropriate K. Moreover, we also propose the performance index(PI) to easily predict the decoding performance among the possible different(receive antenna) configurations.

An Adaptive Receiver Using Reduced-state Sequence Detection for the Trellis-coded CPFSK (트렐리스 부호화된 CPFSK의 적응 수신기)

  • 송형규
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.6
    • /
    • pp.746-760
    • /
    • 1998
  • In this paper, an adaptive RSSD(reduced-state sequence detection) receiver is proposed for the purpose of reducing the complexity and decision delay of the adaptive MLSD(maximum-likelihood sequence detection) receiver in the mobile satellite channel. The RSSD receiver reconstructs the trellis with a reduced number of states. The performance degradation due to the reduced states is compensated by modifying the branch metric calculation which uses the symbols in each path memory to estimate the residual ISI(intersymbol interference) terms. The structure of the proposed adaptive RSSD is a modified RSSD utilizing a per-survivor processing as well as the symbol-aided method and a channel estimation using the tentative data sequences. The complexity and performance of the proposed adaptive RSSD are controlled by the number of system states and ISI cancelers and the inserting period of the known symbols. In spite of a suboptimal alternative receiver compared to the adaptive MLSD receiver, the proposed adaptive RSSD receiver is able to reduce the complexity significantly and track the time-varying channel fast and reliably.

  • PDF

Performance Evaluation of the M-algorithm for Decoding Convolutional Codes (M-알고리듬을 이용한 컨벌루셔널 부호의 복호 성능 평가)

  • 천진영;최규호;성원진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.188-195
    • /
    • 2002
  • The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K=7 to K=9, 11, 15 is respectively 0.6, 0.75, and 08dB, when the frame of length L=100 has the frame error rate of 0.01%.

A Study on the Performance Improvement of the Detection of Trellis-Coded 8-PSK in AWGN Channel (AWGN 환경에서 트렐리스 부호화된 8-PSK의 검파성능 개선에 관한 연구)

  • 이종석
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06e
    • /
    • pp.211-214
    • /
    • 1998
  • TCM(Trellis-Coded Modulation)은 대역폭과 전력이 제한된 채널환경에서 채널부호화 기술과 변조기술을 결합시켜 대역폭의 증가없이 에러정정능력을 개선시키는 통신 기술이다. 본 논문에서는 TCM 신호의 복호시 사용되는 Viterbi decoder에서 traceback depth의 감소에 따른 BER(Bit Error Rate)의 증가를 개선하기 위해 수신부에서 설정하는 traceback depth를 주기로 blocking하여 TCM encoder의 입력시퀀스에 zero padding bits를 추가시키는 새로운 알고리듬을 제안한다. 모의실험결과, traceback depth가 50인 hard decision의 경우 약 2~2.5dB, 4-level soft decision과 8-level soft decision의 경우 약 0.3~2dB의 coding gain을 얻을 수 있었다.

  • PDF

A trellis shaping on multi-dimensional constellation (다차원 신호집합에서의 트렐리스 쉐이핑)

  • 윤석현;이영조;문태현;고영훈;홍대식;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.10
    • /
    • pp.12-21
    • /
    • 1996
  • The trellis shaping is the method of selecting a minimum weight sequence from an equivalent class of possible transmitted sequences. It is perforemed by searching through the trellis diagram of a shaping convolutional code Cs. A shaping gain of the order of 1dB may be obtained with a simple 4-state shaping code. But when the rellis shaping is applied to multi-dimensional constellation, the shaping gain is decreased and the transmission delay is increased, which make it difficult to apply the trellis shaping to multi-dimensional constellation. In this paper, in order to solve these problems, the shell mapping algorithm is used for the mapper in the proposed trellis shaping. The simulatio result shows that the proposed trellis shaping is better than coventional trellis shaping to multi-dimensional constellation. In this paper, in order to solve these problems, the shell mapping on multi-dimensional costellation with respect to shaping gain and transmission delay. And the constellation expansion ratio (CER) and the capacity of transmitted injformation are identical to those of conventional trellis shaping on multi-dimensional constellation.

  • PDF

A burst-error-correcting decoding scheme of multiple trellis-coded $\pi$/4 shift QPSK for mobile communication channels (이동 통신 채널에서 다중 트렐리스 부호화된 $\pi$/4 shift QPSK의 연집 에러 정정 복호 방식)

  • 이정규;송왕철;홍대식;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.24-31
    • /
    • 1995
  • In this paper, the dual-mode burst-error-correcting decoding algorithm is adapted to the multiple trellis-coded .pi./4 shift QPSK in order to achieve the improvement of bit error rate (BER) performance over fading channels. The dual-mode adaptive decoder which combines maximum likelihood decoding with a burst detection scheme usually operates as a Viterbi decoder and switches to time diversity error recovery whenever an uncorrectable error pattern is identified. Rayleigh fading channels and Rician fading channels having the Rician parameter K=5dB are used in computer simulation, and the simulation results are compared with those of interleaving techniques. It is shown that under the constraint of the fixed overall memory quantity, the dual-mode adaptive decoding scheme gains an advantage in the BER performance with respect to interleaving strategies.

  • PDF

Cherent Detection of the Trellis Coded CPFSK on Phase Jitter Channels (위상 지터 채널하에서 트렐리스 부호화된 CPFSK의 동기 검파)

  • 김대중;김한종;정호영;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.9
    • /
    • pp.26-33
    • /
    • 1994
  • In this paper, the performance of the trellis coded CPFSK with the coherent detection over mobile communication channels is calculated. The characteristics of channels, including phase jitter effects and fading effects, are examined and modeled. The phase jitter channel is modeled to have a nonzero mean and a gaussian distribution. The fading channel has a Rayleigh distribution in the multipath. For the optimal decoding method(MLSE), the Viterbi algorithm is used for the trellis structure of trellis coded CPFSK. The results indicate that the trellis coded CPFSK with a small moulation indes gets more sensitive, as the index gets smaller, to the phase noise under the phase jitter channel. Using the interleaving method. It gives considerable improvements in the error rate under the fading channel.

  • PDF