• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2C
• /
• pp.161-166
• /
• 2008

In the parallel-architecture turbo codes, the constituent interleaver must avoid memory collision. This paper proposes a collision-free interleaver structure composed of a Latin square matrix and pre-designed interleavers. Our proposed interleavers can be easily optimized for various information block sizes and for various degrees of parallelism. Their performances were evaluated by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.841-847
• /
• 2009

In this paper we propose a high-performance Hybrid ARQ scheme employing Chase combining based on LDPC (Low-Density Parity-Check) codes. The proposed scheme uses symbol mapping diversity and turbo demodulation to improve decoding performance. We analyze the performance of the proposed scheme by EXIT (EXtrinsic Information Transfer) chart and compare its performance with several symbol mappings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1387-1394
• /
• 2004

Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication systems. And it is well known about the fact that turbo code has better the BER performance as the number of decoding iterations increases in the AWGN channel environment. However, as the number of decoding iterations is increased under the several channel environments, any further iteration results in very little improvement, and it requires much delay, computation and power consumption in proportion to the number of decoding iterations. In this paper, it proposes the efficient iterative decoding stop criterion algorithm which can largely reduce the average number of decoding iterations of turbo code. Through simulations, it is verifying that the proposed algorithm can efficiently stop the iterative decoding by using the variance value of error probability for the soft output value, and can largely reduce the average number of decoding iterations without BER performance degradation. As a result of simulation, the average number of decoding iterations for the proposed algorithm is reduced by about 2.25% ~14.31％ and 3.79％ ~14.38% respectively compared to conventional schemes, and power consumption is saved in proportion to the number of decoding iterations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.173-179
• /
• 2002

In this paper, we suggest more precise performance analysis method of turbo interleavers based on two criteria; performance bounds like Union Bound and weight frequency of codewords. In order to present our new method, we employ block pseudo random, and so-called prime interleavers in compliance of 3GPP standard, respectively, We also applied this method to S-random interleavers that have different window size, S. 3GPP complied turbo encoder, decoder, and AWGN channel are implemented by using MATLAB for our performance analysis. According to our analysis, both criteria should be taken into account coincidently to predict the performance of newly designed interleavers.

• Journal of Advanced Navigation Technology
• /
• v.7 no.1
• /
• pp.30-37
• /
• 2003

In this paper, we have analyzed the BER (Bit Error Rate) performance of MC-CDMA systems under indoor wireless environment with class A impulsive noise suggested by Middleton. For the performance evaluation, we considered from strong to weak impulsive noise characteristics. And we have evaluated the degree of performance improvement by using turbo code as a compensation technique to impulsive noise. From the result of analysis, it is found powerful performance improvement scheme must be adopted in the system under impulsive noise environment, and when turbo code scheme is adopted, system BER performance is improved by the $10^{-2}$. As the impulsive noise characteristics approaches AWGN characteristics, the degree of performance improvement by adopting turbo code become larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1633-1641
• /
• 2004

In satellite digital broadcasting and satellite internet, severe burst errors occur in the high-speed return channel from the satellite to mobiles. In this paper, we analyze the performance of the forward error correction (FEC) coding method in the Rayleigh fading return channel. We first investigate the channel model of Loo, LutB, Vucetic and Corazza. We then compare the performance of the convolutional, Reed-Solomon (RS), convolution-RS concatenation, and Turbo codes in rayleigh fading channel.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.646-651
• /
• 2003

In this paper, we investigate the performance comparisons of various turbo interleavers which are adopted as a standard such as IMT-2000 and satellite DVB(digital video broadcasting). The bit error rate performance is calculated by the fixed point computer simulations over Rayleigh fading channels. For a fair comparison, the simulation is performed on the basis of equal the interleaver size as we can. From the results, it is shown that the turbo interleaver in W-CDMA outperforms the turbo interleavers in CDMA2000 and satellite DVB. The performance gains are even larger as the interleaver size is increased.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.107-107
• /
• 2004

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.11a
• /
• pp.61-62
• /
• 2005

In this paper, we investigate the encoding and decoding method of turbo codes that offer a variety of coding rates from 1/3 to 6/7 in Digital Video Broadcast Return Channel via Satellite (DVB-RCS) standard to provide ship-internet service with high-quality.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.273-276
• /
• 2001

In this thesis we propose symbol-based decoding for turbo codes which is used SOVA as a decoding algorithm. The proposed turbo codes that is interleaved on symbol-by-symbol basis and inputted as n-bit symbols to the decoder. This method makes that the stages of the original trellis are merged together and the trellis depth is reduced by 1/n. We research turbo codes with symbol size n=2 in this paper and its performance.