• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.165-172
• /
• 2002

In the next generation mobile communications, powerful channel coding is essential in order to obtain high quality multimedia services. Turbo code can achieve good error performance by iterative decoding, but more iterations result in additional computational complexity and delay. Thus, a method to reduce the number of iterations without additional performance degradation is needed. Turbo code with CRC is known to be the most efficient method to reduce the number of iterations. In this scheme, the performance may be degraded by the edge-effect like the conventional turbo code without CRC. In this paper, a method to eliminate the edge-effect is proposed by adopting D-parameter to the conventional s-random interleaver. As results of simulation, the edge-effect of the turbo code with CRC is shown to be successfully eliminated by using the new interleaver designed with D-parameter.

• The Magazine of the IEIE
• /
• v.25 no.10
• /
• pp.95-106
• /
• 1998

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.9-11
• /
• 2009

It is well-known that the performance of turbo codes can be improved by allocating different energies per code symbol. In this paper, based on this observation, we propose a joint encoding and modulation scheme for quadrature amplitude modulated turbo code systems. In the proposed scheme, the amount of energy difference between the turbo coded symbols is optimized by optimizing the constellation of quadrature amplitude modulation(QAM). The proposed scheme offers better coding gain compared to the conventional combination of binary turbo code and QAM at the bit error rate of $10^{-5}$.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.116-123
• /
• 2003

In this paper, we address the problem of designing multirate codes for a multiple-input and multiple-output (MIMO) system by restricting the receiver to be a successive decoding and interference cancellation type, when each of the antennas is encoded independently. Furthermore, it is assumed that the receiver knows the instantaneous fading channel states but the transmitter does not have access to them. It is well known that, in theory, minimummean- square error (MMSE) based successive decoding of multiple access (in multi-user communications) and MIMO channels achieves the total channel capacity. However, for this scheme to perform optimally, the optimal rates of each antenna (per-antenna rates) must be known at the transmitter. We show that the optimal per-antenna rates at the transmitter can be estimated using only the statistical characteristics of the MIMO channel in time-varying Rayleigh MIMO channel environments. Based on the results, multirate codes are designed using punctured turbo codes for a horizontal codedMIMOsystem. Simulation results show performances within about one to two dBs of MIMO channel capacity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.999-1021
• /
• 2023

Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.2271-2272
• /
• 2008

Recently, LDPC codes received a lot of attention in 4G. LDPC codes perform good error correction at high SNR. But LDPC codes are complex design and not good at low SNR. At low SNR, convolution codes and turbo codes show more good performance than LDPC codes. The main subject presented in this study is that parallel encoding and decoding according to SNR. The system chooses convolution codes at low SNR and chooses LDPC codes at high SNR.

• ETRI Journal
• /
• v.40 no.3
• /
• pp.309-317
• /
• 2018

Single carrier-frequency-division multiple access (SC-FDMA) has been adopted as the uplink transmission standard in fourth-generation cellular networks to facilitate power efficiency transmission in mobile stations. Because multiuser multiple-input multiple-output (MU-MIMO) is a promising technology employed to fully exploit the channel capacity in mobile radio networks, this study investigates the uplink transmission of MU-MIMO SC-FDMA systems with orthogonal space-frequency block codes (SFBCs). It is preferable to minimize the length of the cyclic prefix (CP). In this study, the chained turbo equalization technique with chained turbo estimation is employed in the designed receiver. Chained turbo estimation employs a short training sequence to improve the spectrum efficiency without compromising the estimation accuracy. In this paper, we propose a novel and spectrally efficient iterative joint-channel estimation, multiuser detection, and turbo equalization for an MU-MIMO SC-FDMA system without CP-insertion and with short TR. Some simulation examples are presented for the uplink scenario to demonstrate the effectiveness of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.442-449
• /
• 2005

In this paper, we introduce three kinds of simplified high-speed decoding algorithms for turbo product decoder. First, A parallel decoder structure, the row and column decoders operate in parallel, is proposed. Second, HAD(Hard Decision Aided) algorithm is used for early-stopping algorithm. Lastly, P-Parallel TPC decoder is a parallel decoding scheme, processing P rows and P columns in parallel instead of decoding one by one as that in the original scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1254-1264
• /
• 2000

In this paper, we propose a new turbo interleaver and an efficient iteration control method with low complexity for turbo decoding. Turbo codes has better performance as the number of iteration and the interleaver size increases. However, as the interleaver size is increased, it require much delay and computation for decoding. Thus we propose a new efficient turbo magic interleaver using the Magic square matrix. Simulation results show that the proposed interleaver realizes a good performance like GF, Mother interleaver proposed to IMT-2000. And as the decoding approaches the performance limit, any further iteration results in very little improvement. Therefore, we propose an efficient algorithm of decoding that can reduce the delay and computation. Just like the conventional stop criterion, it effectively stop the iteration process with very little performance degradation.