• Title/Summary/Keyword: Trellis

Search Result 277, Processing Time 0.023 seconds

Non-overlapped interleaving for space-frequency trellis coded OFDM systems in frequency selective fading channel

  • Ryu, Jae-Ho;Lee, Yang-Hwan
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.202-205
    • /
    • 2003
  • The performance of space-frequency trellis coded (SFTC) OFDM system is analyzed in frequency selective fading channel. Using a pairwise error probability upper bound expression, we design the code and interleaver that can maximize the diversity and coding gain. To alleviate the performance degradation due to the inter-antenna product terms, we propose a new SFTC scheme that employs non-overlapped interleaving for each antenna A new code is optimized for the non-overlapped interleaving and a practical sub-optimal decoding algorithm is proposed. It is shown that the proposed scheme can substantially improve the performance compared to the conventional scheme that employs identical interleaving for all antennas.

  • PDF

Multi-dimensional DC-free trellis codes based on tow-dimensional constellation (2차원 성상도를 이용한 다차원 무직류 격자형부호)

  • 정창기;황성준;주언경
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.47-53
    • /
    • 1998
  • Multi-dimensional DC-free trellis codes based on two-dimensional constellation which can be omplemented more easily than conventional codes are proposed and their performances are analyzed in this paper. 2N-dimensional constellation of the proposed codes is constructed by concatenating N 2-dimensional constellation. Thus, for the proposed codes, information bits can be assigned easily to each signal point of the 2-dimensional consteellation and DC-free characteristic can be simply obtained by the symmetric structure of the constellation. In addition, since Viterbi decoder can calculate multi-dimensional Euchlidean distance between signals by simple sum of each 2-dimensional Euclidean distanc, decoding complexity can be reduced. The performance analysis shows that the proposed codes have almost same spectral characteristic and error performance as compared with conventional codes. However, the complexity is shown to be reduced further due to the construction method of contellation and the simple decoding algorithm of the proposed codes.

  • PDF

Sliding Multiple Symbol Differential Detection of Trellis-coded MDPSK (트랠리스 부호화된 MDPSK의 흐름 다중심볼 차동검파)

  • 김한종;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.39-46
    • /
    • 1994
  • In this paper, the idea of using a multiple symbol obervation interval to improve error probability performance is applied to differential detection of MTCM(multiple trellis code modulation) with ${\Pi}$/4 shift QPSK, 8DPSK and 16DPSK. We propose two types of sliding multiple symbol differential detection algorithm, type 1 and type 2. The two types of sliding detection scheme are examined and compared with conventional(symbol-by-symbol) detection and bolck detection with these modulation formats in an additive white Gaussian noise(AWGN) using the Monte Carlo simulation. We show that the amount of improvement over conventional and block detection depends on the number of phases and the number of additional symbol intervals added to the observation. Computer simulagtion results are presented for 2,4,8 states in AWGN channel.

  • PDF

A Study on Decoding Algorithm of TCM by Path Back Method (Path Back 방식을 이용한 TCM의 복호 알고리즘에 관한 연구)

  • 정지원;장청룡;이인숙;원동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.12
    • /
    • pp.1401-1412
    • /
    • 1992
  • On band limited channel like satellite communication and voice communication. TCM(Trellis Coded Modulation) is a communication method that has coding gain which combines modulation with channel coding without bandwidth expansion. In this paper, we apply PAM, PSK, QAM to TCM, and propose the extended path back method decoding algorithm which improved drawback of viterbi decoding algorithm and apply to TCM this decoding algorithm. Using Monte Carlo simulation, we analyze performance of each modulation technique and efficiency of decoding algorithm.

  • PDF

Comprehensive Analysis of Turbo TCM over Two Typical Channels

  • Bai, Zhiquan;Yuan, Dongfeng;Kwak, Kyung-Sup
    • Journal of Communications and Networks
    • /
    • v.9 no.1
    • /
    • pp.11-17
    • /
    • 2007
  • In this paper, system performance of turbo trellis coded modulation (turbo TCM) is presented and analyzed through computer simulations over two typical channels, namely additive white Gaussian noise (AWGN) and Rayleigh fading channels. We use and compare different mapping strategies based on Ungerboeck partitioning (UP), block partitioning (BP), mixed partitioning (MP), Gray partitioning (GP), and Ungerboeck-Gray partitioning (UGP) of the signal constellation of the turbo TCM system. Furthermore, taking 8PSK modulation of turbo TCM as an example, our simulation results show that turbo TCM with UP can obtain better performance than turbo TCM with BP, MP, GP, and UGP in both AWGN and Rayleigh fading channels.

TCM Without Constellation Expansion Penalty

  • Kaminsky, Edit J.;Ayo, James
    • Journal of Communications and Networks
    • /
    • v.4 no.2
    • /
    • pp.90-96
    • /
    • 2002
  • We present a family of constant-amplitude constellations of even dimensions 8 and above. These constellations allow trellis coded modulation to be implemented without the usual penalty paid for constellation expansion. The new constellations are generated by concatenating either n QPSK points or n QPSK points rotated by 45 degrees, for any n $\geq$ 4. Our constellations double the number of points available for transmission without decreasing the distance between points and without increasing the average or peak energies, introducing asymmetry, or increasing the modulation level. Effective gains of 2.65 dB with minimum complexity through 6.42 dB with moderate complexity are demonstrated using the 8D constellation.

ATSC Terrestrial Digital Television Broadcasting Using Single Frequency Networks

  • Lee, Yong-Tae;Park, Sung-Ik;Kim, Seung-Won;Ahn, Chie-Teuk;Seo, Jong-Soo
    • ETRI Journal
    • /
    • v.26 no.2
    • /
    • pp.92-100
    • /
    • 2004
  • In this paper, we propose an efficient method to broadcast digital television signals using single frequency networks (SFNs) within the Advanced Television Systems Committee (ATSC) transmission systems. In implementing the SFNs of an 8-vestigial side band (8-VSB) Digital Television (DTV) system, the ambiguity problem of the trellis coder is unavoidable in a conventional ATSC transmission system. We propose a memory initialization of the trellis coder to resolve this ambiguity problem. Since the proposed scheme to synchronize multiple transmitters minimizes the changes from the conventional ATSC system, the hardware complexity for these changes is very low. Our simulation results show that the proposed scheme makes a less than 0.1 dB degradation at the threshold of visibility with a bit error rate of $3{\times}10^{-6}$ in the additive white Gaussian noise (AWGN) channel. It is possible to reduce the performance degradation by increasing the initialization period of the proposed scheme.

  • PDF

Performance Enhancement of Trellis Coded Mary PSK using Minimum Hamming Distance (최소해밍거리를 이용한 트렐리스 부호화된 M- ray PSK의 성능 향상)

  • 은도현;조훈상;이순흠
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.3
    • /
    • pp.417-424
    • /
    • 2001
  • This paper proposes new symbol mapping method that can enhance the performance of trellis coded M-ary PSK compared with conventional symbol mapping methods in AWGN environment. Since the basic criteria of TCM design is Maximum Euclidean distance in AWGN, conventional symbol mapping method keep this basic criteria. In this paper, proposed new symbol mapping method uses both Euclidean distance and Hamming distance to design, while conventional methods make use of only optimal Euclidean distance. New symbol mapping method show the better BER performance than the other through computer simulation and error equations.

  • PDF

Performance of Orthogonal CCK modulation in 802.l1b WLAN (802.11b WLAN의 완전직교 CCK modulation 성능)

  • 정현수;오태원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.766-769
    • /
    • 2002
  • In this paper, we propose new orthogonal modulation method to enhance the performance of CCK adapted in 802.l1b WLAN. To maintain the orthogonality of codewords produced by CCK modulator, we devide 256 codewords into 8 subset by trellis coding and codewords On a subset are orthogonal each other. In result, this method restricts maximum data rate to 9.625Mbps, however, it is better about 1.5dB than original UK modulation at BER 10$^{-5}$ .

  • PDF

A Burst Error Correction Decoding Algorithm in TCM on Mobile Communications (이동통신에서 TCM의 연집에러 정정을 위한 복호방식)

  • 이영천;김종일;이명수;홍대식;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.9
    • /
    • pp.1020-1028
    • /
    • 1992
  • In this paper, a burst-error-correcting adaptive decoding in TCM(Trellis Coded Modulation) is presented that combines maximun-likelihood decoding with a burst error detection scheme. The decoder usually operates as a Viterbi decoder and switches to a burst-error-correcting mode whenever error patterns uncorrectable by Viterbi decoder are detected. It is demonstrated that TCM using adaptive decoding method outperforms a traditional TCM on the multi-path fading channels that are busty in nature, which are like the channel environments of mobile communications.

  • PDF