• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5B
• /
• pp.545-553
• /
• 2001

다중 사용자 DS-CDMA 시스템에서 더 나은 성능을 얻고자 컨볼루션 코드와 차등 코드의 직렬 연쇄 구조를 제안한다. 시스템은 접속 간섭 (MAI: Multiple-access Interference)를 억제하기 위해 다른 사용자의 확산 코드, 동기, 그리고 전력 정보 등을 필요로 하지 않는 단일 사용자 검파기(SUD: Single User Detection)로 이루어진다. 채널 부호로 사용된 부호화율 1과 메모리 수 1을 가지는 차등 부호는 부호화로 인한 효율 저하를 가져오지 않으며 최소 상태수를 가지게 된다. 이러한 차등 부호와 컨볼루션 부호를 복호함에 있어서 서로간의 정보를 교환하는 반복 복호 처리를 이용한다. AWGN 채널에서의 분석 결과로부터 본 연쇄 부호 기법이 DS-CDMA 시스템에서 기존의 컨볼루션 코드보다 유사한 복잡도에서 더 나은 성능과 유연성을 제공함을 알 수 있다. 또한 제안한 기법이 SUD를 하는 DS-CDMA 시스템에 적용될 때, 처리 이득(Processing Gain)이나 간섭 억제 여파기의 탭 개수를 증가시킴으로써 성능 향상이 일어나며, 원근 간섭 전력 문제가 심한 경우에 성능 저하가 일어남을 알 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.721-728
• /
• 2010

CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.62-67
• /
• 2001

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 a large time delay over the reception process. Moreover, Turbo Code has been known as the robust ending method 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 such as IMT-2000. Therefore, in this paper, we proposed of the method to improve the conventional performance with the parallel concatenated 4-New Turbo Decoder using MAP a1gorithm in spite of complexity increasement. In the real-time video 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 fading channels.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1067-1075
• /
• 2000

In this paper, the performance of turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.1
• /
• pp.39-49
• /
• 2011

Turbo code needs long decoding time because of iterative decoding. To communicate with high speed, we have to shorten decoding time and it is possible with parallel process. But memory contention can cause from parallel process, and it reduces performance of decoder. To avoid memory contention, QPP interleaver is proposed in 2006. In this paper, we propose MDF method which is fit to QPP interleaver, and has relatively short decoding time and reduced logic. And introduce the design of MAP decode module using MDF method. Designed decoder is targetted to FPGA of Xilinx, and its throughput is 80Mbps maximum.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.73-80
• /
• 2003

In this paper, we propose a ETD-turbo code(Enhanced Time Diversity turbo code) which is a novel turbo code configuration to increase the time diversity effect and analyze the performance of ETD-turbo coded MC-CDMA system. The ETD-turbo code, which is added another interleaver to the conventional turbo code structure, is consisted. Time diversity effect of the ETD-turbo code is improved by every parity bits converted into interleaver pattern. In order to the performance of the ETD-turbo code, we conduct a computer simulation about interleaver type. And we make comparison between the performance of ETD-turbo coded MC-CDMA system and the conventional turbo coded MC-CDMA system. By the simulation results, ETD-turbo code has less BER than the conventional turbo code and time delay is decreased by reducing iteration numbers. Therefore, it is defined that the performance of ETD-turbo coded MC-CDMA system is improved than the conventional turbo coded MC-CDMA system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.20-25
• /
• 2006

In this paper, the performance of Tree-LDPC code is presented based on the min-sum algorithm with scaling and the asymptotic performance in the water fall region is shown by density evolution. We presents that the Tree-LDPC code show a significant performance gain by scaling with the optimal scaling factor which is obtained by density evolution methods. We also show that the performance of min-sum with scaling is as good as the performance of sum-product while the decoding complexity of min-sum algorithm is much lower than that of sum-product algorithm. The Tree-LDPC decoder is implemented on a FPGA chip with a small interleaver size.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1854-1863
• /
• 2003

In the recent digital communication systems, the performance of Turbo Code using the mr correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the huh decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been blown 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 preposed 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 the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.36-42
• /
• 2010

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.

• Journal of Satellite, Information and Communications
• /
• v.6 no.2
• /
• pp.78-83
• /
• 2011

In this paper, we propose a computationally efficient early stopping method to reduce the average number of iterations. The conventional early stopping methods have too much computational complexity to compute the stopping criterion. Thus, only the hard decision based early stopping method is suitable to realize the hardware of LDPC decoder. However, this method also can increase the computational complexity of LDPC decoder. The proposed method can effectively reduce the computational complexity of stopping criterion as we do not compute hard decision, and we combine the stopping criterion with horizontal shuffling scheduling decoding scheme. The simulation results show that a new early stopping method achieves acceptable bit error rate performance also reduces the average number of iterations.