• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.1-4
• /
• 2004

We proposed a new type of timing recovery scheme to work with a system that uses BCJR (Bahl-Cocke-Jelinek-Raviv) decoding algorithm and BPSK modulation. The unknown timing offset is estimated by the modified Mueller and $M\ddot{u}ller$ estimator with the aid of the decoder. Timing offset can be acquired as soon as the symbols are received and be updated symbol by symbol. The simulation results for turbo codes whose decoder uses BCJR algorithm show a satisfactory performance even in case of severe timing jitter.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1047-1048
• /
• 2006

In this paper, we present an iterative phase offset estimation algorithm based on a space-time block code and turbo coded system. External single phase estimator receives soft information from the turbo decoder and estimates phase offset with LMS algorithm. The estimated phase offset value is used for space-time decoder. Simulation results show the phase estimation gain in a flat fading channel.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.265-268
• /
• 2003

In this paper, we propose new simple and efficient stopping criteria for W-CDMA turbo decoding. The new criteria are based on the sum of logarithm of absolute extrinsic information values and the count of one-estimations calculated after each component decoder. The calculation of the proposed criteria can be made simpler by summing one of ten values without any penalty. This Proposed method can be implemented with negligible overhead and no extra memory. Simulation results on W-CDMA standard shows that the number of iterations required is reduced compared to the existing stopping criteria without degrading the BER performance. Reduced iterations and simple operations make the proposed criteria desirable for low-power turbo decoder.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.51-55
• /
• 2016

High-capacity, high quality services should be guaranteed in mobile communication environment. Excellent channel coding and compensation techniques are required so as to improve data reliability on fading channels. In this paper, we propose a method using double pilots, estimates and compensates for the fading of information symbols. The proposed method using Log-MAP Turbo decoder through the iterative decoder, improves BER performance under the environment of the frequency selective fading channel. Compared to the existing methods, the suggested methods show functional improvement of approximately 3dB in case that the number of iteration decoding is 5 and BER is $10^{-4}$.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.417-421
• /
• 2005

In the recent digital communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been known as the robust coding methods with the confidence over the fading channel. International Telecommunication Union(ITU) has recently adopted it as the standardization of the channel coding over the third generation mobile communications(IMT-2000). Therefore, in this paper, we proposed the interleaver that has the better performance than existing block interleaver, and modified turbo decoder that has the parallel concatenated structure using MAP algorithm. In the real-time voice and video service over third generation mobile communications, the performance of the proposed two methods was analyzed and compared with the existing methods by computer simulation in terms of reduced decoding delay using the variable decoding method over AWGN and fading channels for CDMA environments.

• Journal of Advanced Marine Engineering and Technology
• /
• v.25 no.2
• /
• pp.375-382
• /
• 2001

In this study, an adapted Turbo Coding Algorithm for reducing communication error of a fire detection system for marine vessels, especially image transmission via power lone. Because it is necessary that this system communicate larger and faster than previous method, this study carried out enhancement a decoding speed by adaptation CRC with Turbo Code Algorithm, improvement of metric method, and reduction of decoding delay by using of Center-to-Top method. And the results are as follows: (1) Confirmed that a Turbo Code is so useful methods for reducing communication error in lots of noise environments. (2)Proposed technology in this study speed increasing method of Turbo Coding Algorithm proves 2 times faster than normal Turbo Code and communication error reducing as well in the board made by VHDL software & chips ALTERA company.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2000.11a
• /
• pp.123-134
• /
• 2000

In this study, adapted Turbo Coding Algorithm for reducing communication error of fire detection system for marine vessels, especially image transmission. and proposed decoding speed increasing method of Turbo Coding Algorithm. The results are as follows : 1) Confirmed that a Turbo Code is so useful methods for reducing communication error in lots of noise environments. 2) Proposed technology in this study of speed increasing method of Turbo Coding Algorithm proved 2 times speed up effect than normal Turbo Code and communication error reducing as well in the board made by VHDL software & chips of ALTER Company.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1026-1035
• /
• 2011

This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.13-16
• /
• 2000

In the recent mobile communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that need great many delay over the reception process. Moreover, Turbo Code has been known as the robust coding methods with the confidence over the fading channel. The International Telecommunication Union(ITU) has recently adopted as the standardization of the channel coding over the third generation mobile communications the same as IMT-2000. Therefore, in this paper, we proposed of that has the better performance than existing Turbo Decoder that has the parallel concatenated four-step structure using MAP algorithm. In the real-time voice and video service over the third generation mobile communications, the performance of the proposed method was analyzed by the reduced decoding delay using the variable decoding method by computer simulation over AWGN and lading channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8A
• /
• pp.785-790
• /
• 2010

This paper proposes new suboptimum, yet very efficient demapping methods for Turbo coded noncoherent MFSK systems under AWGN and Rayleigh fading channels with channel state information. Simulation results show that the proposed methods achieve performance within 0.2 dB of the maximum-likelihood decoder and the previously proposed suboptimum demapping schemes with a fraction of the complexity.