• Title/Summary/Keyword: trellis codes

Search Result 68, Processing Time 0.019 seconds

An Optimal Space Time Coding Algorithm with Zero Forcing Method in Underwater Channel (수중통신에서 Zero Forcing기법을 이용한 최적의 시공간 부호화 알고리즘)

  • Kwon, Hae-Chan;Park, Tae-Doo;Chun, Seung-Yong;Lee, Sang-Kook;Jung, Ji-Won
    • Journal of Navigation and Port Research
    • /
    • v.38 no.4
    • /
    • pp.349-356
    • /
    • 2014
  • In the underwater communication, the performance of system is reduced because of the inter-symbol interference occur by the multi-path. In the recent years, to deal with poor channel environment and improve the throughput, the efficient concatenated structure of equalization, channel codes and Space Time Codes has been studied as MIMO system in the underwater communication. Space Time Codes include Space Time Block Codes and Space Time Trellis Codes in underwater communication. Space Time Trellis Codes are optimum for equalization and channel codes among the Space Time Codes to apply in the MIMO environment. Therefore, in this paper, turbo pi codes are used for the outer code to efficiently transmit in the multi-path channel environment. The inner codes consist of Space Time Trellis Codes with transmission diversity and coding gain in the MIMO system. And Zero Forcing method is used to remove inter-symbol interference. Finally, the performance of this model is simulated in the underwater channel.

Performance Analysis of MAP Algorithm and Concatenated Codes Using Trellis of Block Codes (블록부호의 트렐리스를 이용한 MAP 알고리즘 및 연접부호의 성능분석)

  • 백동철;양경철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6A
    • /
    • pp.905-912
    • /
    • 1999
  • In this paper we explain a trellis representation of block codes and derive their MAP decoding algorithm based on it. We also analyze the performance of block codes and concatenated codes with block codes as components by computer simulations, which were performed by changing the structures and constituent codes of concatenated codes. Computer simulations show that soft decision decoding of block codes get an extra coding gain than their hard decision decoding and that concatenated codes using block codes have good performance in the case of high code rate.

  • PDF

Rotationally Invariant Space-Time Trellis Codes with 4-D Rectangular Constellations for High Data Rate Wireless Communications

  • Sterian, Corneliu Eugen D.;Wang, Cheng-Xiang;Johnsen, Ragnar;Patzold, Matthias
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.258-268
    • /
    • 2004
  • We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

Trellis-Based Decoding of High-Dimensional Block Turbo Codes

  • Kim, Soo-Young;Yang, Woo-Seok;Lee, Ho-Jin
    • ETRI Journal
    • /
    • v.25 no.1
    • /
    • pp.1-8
    • /
    • 2003
  • This paper introduces an efficient iterative decoding method for high-dimensional block turbo codes. To improve the decoding performance, we modified the soft decision Viterbi decoding algorithm, which is a trellis-based method. The iteration number can be significantly reduced in the soft output decoding process by applying multiple usage of extrinsic reliability information from all available axes and appropriately normalizing them. Our simulation results reveal that the proposed decoding process needs only about 30% of the iterations required to obtain the same performance with the conventional method at a bit error rate range of $10^{-5}\;to\;10^{-6}$.

  • PDF

Radix-trellis Viterbi Decoding of TCM/PSK using Metric Quantization (TCM/PSK의 양지화 Radix-trellis Viterbi 복호)

    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.5
    • /
    • pp.731-737
    • /
    • 2000
  • In this paper we propose a decoding algorithm of Ungerboeck TCM/PSK in the concept of Radix-trellis, which has been applied to the decoding of convolutional codes for the high speed decoding. As an example we choose 16-state trellis coded 8-ary PSK. For Radix-4 and Radix-16 trellis decoding, we explain the path metric(PM) and the branch metric(BM) calculation. By using the simulation, we evaluate the bit error rate(BER) performance according to the number of binary digits for I-Q value, PM and BM registers. The proper number of binary digits of each register has been derived.

  • PDF

Improved Design Criterion for Space-Frequency Trellis Codes over MIMO-OFDM Systems

  • Liu, Shou-Yin;Chong, Jong-Wha
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.622-634
    • /
    • 2004
  • In this paper, we discuss the design problem and the robustness of space-frequency trellis codes (SFTCs) for multiple input multiple output, orthogonal frequency division multiplexing (MIMO-OFDM) systems. We find that the channel constructed by the consecutive subcarriers of an OFDM block is a correlated fading channel with the regular correlation function of the number and time delay of the multipaths. By introducing the first-order auto-regressive model, we decompose the correlated fading channel into two independent components: a slow fading channel and a fast fading channel. Therefore, the design problem of SFTCs is converted into the joint design in both slow fading and fast fading channels. We present an improved design criterion for SFTCs. We also show that the SFTCs designed according to our criterion are robust against the multipath time delays. Simulation results are provided to confirm our theoretic analysis.

  • PDF

The Encoder Design of Punctured Turbo Trellis Coded Modulation applied to MPSK

  • Seon, Wang-Seok;Kim, Youn-Hyoung;Lee, Ho-Kyung
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.2071-2074
    • /
    • 2002
  • This paper introduces an encoder design method of Turbo TCM (Trellis Coded Modulation) with symbol puncturing. TTCM consists of two simple trellis codes in parallel and modulator. To obtain an good encoder, we calculate the free distance by the assumption that the punctured symbol is transmitted from the subset that consist of signals with the same systematic bit at random. We develop a search program to find the component encoder which maximize the free distance. Especially, for 8-PSK with code rate 2/3, we search for the component codes. We find a new encoder which has better BER performance than that of Robertson′s encoder. We verify the results through the simulation."

  • PDF

4-Level 4/6 Modulation Code with Trellis Encoding on Holographic Data Storage (홀로그래픽 데이터 저장장치에서 트렐리스 인코딩을 이용한 4-레벨 4/6 변조부호)

  • Jeong, Seongkwon;Lee, Jaejin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.6
    • /
    • pp.11-16
    • /
    • 2017
  • Multi-level holographic data storage requires modulation codes for avoiding two dimensional inter-symbol interference (2D-ISI). Modulation codes can remove the fatal ISI pattern of neighboring the largest and the smallest symbols. In this paper, we propose a 4-level 4/6 modulation code and its trellis encoding for error correction. The proposed 4/6 modulation code prevents that the symbol 0 and 3 are not adjacent in any direction. Also, we compare the proposed modulation code with the same code rate modulation codes for four-level holographic data storage.

An Analysis of Bit Error Probability of Reed-Solomon/Trellis concatenated Coded-Modulation System (Reed-Solomon/Trellis 연접 부호변조 시스템의 비트오율 해석)

  • 김형락;이상곤;문상재
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.9
    • /
    • pp.34-43
    • /
    • 1994
  • The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

  • PDF

Optimum and Sub-optimum Decoding Methods of Space-Time Trellis Coded Code Division Multiple Access Systems (시공간 트렐리스 부호화 CDMA 시스템의 최적, 준최적 복호 방식과 성능 연구)

  • Ki, Young Min;Kim, Dong Ku
    • Journal of Advanced Navigation Technology
    • /
    • v.6 no.2
    • /
    • pp.130-137
    • /
    • 2002
  • We present Space-Time Trellis Coded Code Division Multiple Access systems, which maintain the full diversity and coding gain of Space-Time Trellis Codes(STTC) and have the immunity to performance degradation caused by multipath fading. These STTC CDMA systems are constructed by adding the spreading and despreading processes of PN codes to STTC systems. In multipath fading channels, delay spreaded signals are detected and combined, then decoded. According to the combining and decoding methods, there are four decoding methods. There are optimum ML decoding without combining, adding multipath signals in each receive antenna before decoding, combining multi path signals in each antenna before decoding, and combining all received signals before decoding. Performance of these methods is proportional to complexity. Besides, all methods are shown to compensate the irreducible error rate which appears in multipath fading channels.

  • PDF