• Information and Communications Magazine
• /
• v.18 no.6
• /
• pp.119-125
• /
• 2001

1990년 초반부터 송신 다이버시티에 대한 연구가 있어 왔다. 1990년 후반부터는 송수신 다이버시티에 대한 실용적인 결과가 부호 이론과 접목이 되면서 나오기 시작한다. 그 중에서 매우 유용한 결과인 Space-Time 부호에 대하여 다룬다. 본 논문에서는 직교 Space-Time block code. Layered Space-Time processing, 그리고 Space-Time trellis Coding의 세 가지로 분류하여 내용을 정리한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.141-148
• /
• 2009

Space-time block codes (STBC) have no coding gain but they provide a full diversity gain with relatively low encoder/decoder complexity. Therefore, STBC should be concatenated with an outer code which provides an additional coding gain. In this paper, we consider the concatenation of multiple trellis-coded modulation (MTCM) codes with STBC for achieving significant coding gain with full antenna diversity. Using criteria of equal transmit power, spectral efficiency and the number of trellis states, the performance of concatenated scheme is compared to that of previously known space-time trellis codes (STTC) in terms of frame error rate (FER). Simulation results show that MTCM codes concatenated with STBC offer better performance on fast Rayleigh fading channels, than previously known STTC with two transmit antennas and one receive antenna.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.105-114
• /
• 2000

In this paper, we propose a bandwidth-efficient channel coding scheme using the turbo trellis-coded modulation with multiple symbol detection. The turbo code can achieve good bit error rates (BER) at low SNR. That comprises two binary component codes and an interleaver. TCM codes combine modulation and coding by optimizing the euclidean distance between codewords. This can be decoded with the Viterbi or the symbol-by- symbol MAP algorithm. But we present the MAP algorithm with branch metrics of the Euclidean distance of the first phase difference as well as the Lth phase difference. The study shows that the turbo trellis-coded modulation with multiple symbol detection can improve the BER performance at the same SNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1976-1988
• /
• 1996

This paper describes TCM(trellis coded modulation) schemes using 32VSB signal for digital CATV system. First we design optimum encoder with code rate 4/5 for 32VSB by using one dimenstional signal constellation and obtain 0.75-4.38 dB coding gains over the existing uncoded 16VSB. Second by using two dimensional signal constellation we design TCM encoders with code rate 9/10, which are better in the power efficienty (0.5-2.27 dB) and the transmission rate(12.5%), and we also design TCM encoders which have more coding gains than one dimensional TCM encoders for the larger number of states(more than 8 states).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1068-1073
• /
• 2000

In this paper, we propose a serially concatenated turbo bode/turbo equalizer scheme for optical storage systems. Without modulation coding, a random data sequence is directly passed through the optical channel. In simulation, the channel includes jitter of 15% and AWGN. The densities of the channel are S=4.6 and S=7.0. The code rates of turbo code are 4/5, 8/9 and 16/17. All code rates, the bit error probability is less than 10-5 at 24dB when we and jitter of 15%.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.174-183
• /
• 2003

Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.971-976
• /
• 2010

We introduce an error correcting 4/6 modulation codes for holographic data storage, and simulate under adding mis-alignment noise. The holographic data storage has two-dimensional intersymbol interference. To increase the channel performance, it is necessary to use modulation code. Furthermore, if the modulation code has trellis structure, error correcting capability is added. The error correcting 4/6 modulation code shows better performance than conventional modulation codes with and without mis-alignment noise.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.135-140
• /
• 2003

In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.588-595
• /
• 2010

This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N-dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well-known nonlinear Nordstrom-Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of $10^{-6}$ when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom-Robinson codes has an effective gain of about 0.7 dB at a BER of $10^{-5}$ when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi-cyclic codes.