• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.553-557
• /
• 2000

It is known that turbo codes have an error-floor bound according to the effective free distance at high SNR. But the performance for turbo codes in the water-fall area at low SHR has not been studied yet. In this paper, asymmetric turbo codes that consist of RSC(recursive systematic convolutional) codes with different constraint length are proposed and their performance is analysed for SOVA decoding algorithm.

• Journal of Navigation and Port Research
• /
• v.37 no.5
• /
• pp.487-492
• /
• 2013

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes, LDPC codes and convolutional code based on BCJR algorithm are dominant channel coding schemes in recent. Therefore this paper analyzed the performance of iterative codes based on turbo equalizer with the same coding rate and similar codeword length. The performances of three kinds of iterative codes were evaluated in the environment of underwater acoustic communication channel that are real data collected in Korean east sea. The distance of transmitter and receiver was 5Km and data rate was 1Kbps. As a result, convolutional code based on BCJR algorithm has better performance in underwater channel than turbo codes and LDPC codes.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Journal of Navigation and Port Research
• /
• v.36 no.10
• /
• pp.845-849
• /
• 2012

The next-generation wireless communication requires fast transmission speeds with various services and high reliability. In order to satisfy these needs we study MIMO system used layered space time coded system (LST) combining space time trellis codes (STTC) with turbo codes. In LST, two codes that are inner and outer codes are concatenated in the serial fashion. The inner codes are turbo Pi codes suggested in DVB-RCS NG system, and outer codes are STTC codes proposed by Blum. The interleaver technique is used to efficiently combine two codes. And we proposed and simulated that a full iteration method between turbo decoder and BCJR decoder to improve the performance instead of only processing inner-iteration turbo decoder. The simulation results of proposed effective layered method show improving BER performance about 1.3~1.5dB than conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.86-95
• /
• 2003

With the advent of future mobile communication systems, the wireless transmission of the huge amount of multimedia data over the error-prone multipath fading channel has to overcome the inherent sensitivity to channel errors. To alleviate the effect of the channel errors, hosts of techniques based on the forward error correction(FEC) has been proposed at the cost of overhead rate. Among the FEC techniques, turbo code, whose performance has been shown to be very close to the Shannon limit, can be classified as a block-based error correction code. In this paper, considering the variable packet size of the multimedia data, we analyzed turbo codes employing the variable-sized interleaver. The effect of the various parameters on the BER performance is analyzed. We show that the turbo codes can be used as efficient error correction codes of multimedia data.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.117-118
• /
• 2008

The low latency encoder for high data rate duo-binary turbo codes with tail biting trellises is considered. Encoder hardware architecture is proposed using inherent encoding property of duo-binary turbo codes. And we showed that half of execution time as well as the energy can be reduced with the proposed architecture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1525-1530
• /
• 2015

In this paper, We analyzed the performance of turbo equalizer using turbo codes thorough the under water experiment. To compensate the distorted signal induced by multipath effect, we apply the iterative turbo codes that iteratively exchange probabilistic information between LMS-DFE and turbo decoder, thereby reducing the error rates significantly. We showed the successful of turbo decoding of iterative turbo equalizer is 93%.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.2
• /
• pp.47-51
• /
• 2009

The low latency encoder for high data rate duo-binary turbo codes with tail biting trellises is considered. Encoder hardware architecture is proposed using inherent encoding property of duo-binary turbo codes. And we showed that half of execution time as well as the energy can be reduced with the proposed architecture.

• Journal of Advanced Marine Engineering and Technology
• /
• v.33 no.5
• /
• pp.738-745
• /
• 2009

Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes receive signal to make error floor. In this paper, we propose the underwater communication system using various channel coding schemes such as RS coding, convolutional code, turbo code and concatenated code for overcoming the multipath effect in underwater channel. As shown in simulation results, characteristic of multipath error is similar to that of random error. So interleaver has not effect on error correcting. For correcting of error floor by multipath, it is necessary to use strong channel codes like turbo code. Turbo code is one of the iterative codes. And the performance of concatenated codes including RS code has better performance than using singular channel codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.139-147
• /
• 2010

A novel turbo coded modulation scheme, called turbo-APPM, for deep space optical communications is constructed. The constructed turbo-APPM is a serial concatenations of turbo codes, an accumulator and a pulse position modulation (PPM), where turbo codes act as an outer code while the accumulator and the PPM act together as an inner code. The generator polynomial and the puncturing rule for generating turbo codes are chosen to show the low bit error rate. At the receiver, the joint decoding is performed by exchanging soft information iteratively between the inner decoder and the outer decoder. In the outer decoder, a local iterative decoding for turbo codes is conducted before transferring soft information to the inner decoder. Poisson distribution is used to model the deep space optical channel. It is shown by simulations that the constructed turbo-APPM provides coding gains over all previously proposed schemes such as LDPC-APPM, RS-PPM and SCPPM.