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

• ETRI Journal
• /
• v.26 no.5
• /
• pp.384-390
• /
• 2004

We propose a new bandwidth-efficient technique that achieves high data rates over a wideband wireless channel. This new scheme is targeted for a multiple-input multiple- output orthogonal frequency-division multiplexing (MIMO-OFDM) system that achieves transmit diversity through a space frequency block code and capacity enhancement through the iterative joint processing of zero-forcing detection and maximum a posteriori (MAP) decoding. Furthermore, the proposed scheme is compared to the coded Bell Labs Layered Space-Time OFDM (BLAST-OFDM) scheme.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6A
• /
• pp.577-586
• /
• 2011

Modem digital communication systems are required to use forward error correction (FEC) codes to combat inevitable channel impairment. Turbo codes or low density parity check (LDPC) codes, using iterative decoding with soft decision detection (SDD) information, are the most common examples. The excellent performance of these codes should be conditioned on accurate estimation of soft decision detection information. In order to use FEC codes with iterative decoding for Multi-Input Multi-Output (MIMO) system, reliable soft decision channel gain should be provided. In this paper, we investigate efficient SDD methods for turbo-coded MIMO system, and derive the corresponding formulas of SDD for various MIMO detection schemes. We present simulation results of the derived SDD schemes for turbo-coded MIMO systems, and show that the presented results almost approximate to maximum likelihood detection performance with much less computational load.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2473-2483
• /
• 2000

In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.61-70
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST(Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP Decoder in decoding Algorithm of V-BLAST: ordering and slicing. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance and SNR has been improved. In addition, we show that the proposed system using STD(Selection Transmit Diversity) scheme results in on improved result, By using simulation and comparing to conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has SNR gain over all SNR range and better throughput gain that is about 350Kbps in 11dB SNR range. Also, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD scheme show that the improvement of maximum throughput is about 1.77Mbps in the same SNR range and the SNR gain is about 5.88dB to satisfy 4Mbps throughput performance.

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

This paper suggests and analyzes the Serially Concatenated Space-Time Code(SCSTC) with the possibility of a efficient high-speed transmission in a band limited channel. The suggested code has a structure that uses the interleaver to connect the space-time code as an inner code and the convolutional code as a outer code serially. This code keeps the advantage of high-speed transmission and also has the high BER performance. The performance of the suggested system is compared with the conventional bandwidth efficient trellis coded modulation, such as a Serially Concatenated Trellis Coded Modulation (SCTCM) and a Turbo-Trellis Coded Modulation(Turbo-TCM). The results show that the suggested system has a 2.8dB and 3dB better BER performance than SCTCM and Turbo-TCM respectively in case of the transmission rate 2b/s/Hz in fading channel.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.175-185
• /
• 2009

In this paper, performance of OFDM systems with turbo code is analyzed and simulated in a satellite broadcasting channel. The performance is evaluated in terms of bit error probability. The satellite channel is modeled as a combination of Rayleigh fading with shadowing and Rician fading channels. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based satellite broadcasting systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.432-438
• /
• 2010

In this paper we study the effect of bit-to-symbol mappings on the convergence behavior of turbo equalizers employing low-density parity-check (LDPC) codes over high order modulations. We analyze the effective SNR of the outputs from linear minimum mean-squared error (MMSE) equalizers and the convergence property of LDPC decoding for different symbol mappings. Numerical results show that the bit-reliability (BR) mapping provides better performance than random mapping in LDPC-coded turbo equalizers over high order modulations. We also verify the effect of symbol mappings through the noise threshold and error performance.