• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1654-1665
• /
• 2008

This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to soft decision symbols using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and to implement hardware due to exponential and logarithm calculation. Therefore this paper presents Euclidean, MAX, sector and center focusing method to reduce the high complexity of LLR method. Also, this paper proposes optimal soft symbol split method for three kind of iterative codes. Futhermore, 16-APSK modulator method with double ring structure for applying DVB-S2 system and 16-QAM modulator method with lattice structure for T-DMB system are also analyzed.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.433-435
• /
• 1998

본 논문은 비선형 시스템에서 시스템의 출력이 원하는 궤적을 따라가도록 하기 위한 반복제어 이론을 소개한다. 본 논문에서는 전체 시스템의 안정화를 위해서 추적오차의 부호에 따라 부호가 결정되는 부호전환 제어(switching control) 입력을 사용하고 있다. 그러나 본 논문에서 사용하는 제어 입력은 크기가 추적오차의 크기에 비례하게 되어 있어서 정상상태에서 발생할 수 있는 고속의 부호전환 문제(chattering problem)를 크게 완화시켜서 정상상태에서의 성능을 개선시키고 있다. 또한, 오차가 어떤 범위를 벗어나 있으면 그 범위 안으로 지수적으로 수렴하여 그 안에 계속 머물도록 하는 제어 기법도 소개하였다.

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

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.37-43
• /
• 2008

The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.366-372
• /
• 2003

Multilevel coded modulation (MCM) with serial concatenated convolutional code (SCCC) is proposed and the performance is analyzed in this paper. Both high coding gain and bandwidth efficiency can be obtained if SCCC is adopted as a component code at the first level of MCM. Simulation results show that the performance of MCM with Ambroze's SCCC is saturated like that of MCM with PCCC. But MCM with Benedetto's SCCC shows no performance saturation and better performance than MCM with PCCC or Ambroze's SCCC. Thus MCM with Benedetto's SCCC may be a good choice for high quality system with limited bandwidth.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.11
• /
• pp.1311-1319
• /
• 1992

In the partial-band interference and Rayleigh fading environments, the bit error probability equation of FH/MFSK signal has been derived and the error rate has been evaluated. And the results are shown in graphs and discussed. Here, to improve the error rate performance the repeated diversity and the error-correction coding techniques are adopted. The degree of improvement of error rate performance has been found out in diversity and coding techniques respectively. In diversity case, repetition number is taken as a parameter and in coding case, as the error-correction codes Hamming code, BCH code, and convolutional code are introduced. From the obtained results, we have known that the increase of the number of repetition in diversity technique has been brought a little improvement of performance but the coding technique considerable improvement and in particular, convolutional code is very effective. Therefore, coding technique is considered to be better than repeated diversity to cope with Rayleigh fading and partial-band interference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2C
• /
• pp.155-160
• /
• 2008

In this letter, we propose a new design of recursive systematic convolutional (RSC) codes based on the distance spectrum properties which can maximize the performance. Good constituent RSC codes of code rate 1/2 are searched by computer and presented in a table. Their performances are shown by computer simulation. New designed codes shows faster convergences according to iterative decoding and good performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7B
• /
• pp.1301-1312
• /
• 2000

본 논문에서는 트렐리스 복호 방식을 이용한 블록 터보 부호의 이로적인 성능 바운드와 함께 내부 구성 부호의 변형 및 내부 구성 부호의 연결 방법에 따른 성능의 변화를 살펴본다. 또한 효율적인 복잡도 감소 기법을 적용한 반복 복호 기법을 소개하고 시뮬레이션을 통하여 성능을 분석한 결과를 제시한다. 가우시안 채널에서의 시뮬레이션 결과에 따르면 본 논문에서 제시한 기법은 약 1/10정도의 복잡도를 가지고서도 전체 트렐리스를 탐색한 기법에 거의 근접하는 성능을 얻을 수 있음이 보여졌다.

• Journal of Satellite, Information and Communications
• /
• v.10 no.3
• /
• pp.73-77
• /
• 2015

In this paper, we present two simulation methods to investigate the effect of excluding bit errors on generating the extrinsic information transfer (EXIT) chart for low density parity check (LDPC) and turbo codes. We utilized the simulation methods including and excluding bit errors to generate EXIT chart which was originally proposed for turbo codes. The generated EXIT charts for LDPC and turbo codes shows that the presented methods appropriately demonstrates the performance behaviours of iterative decoding for LDPC and turbo codes. Analysis on the simulation results demonstrates that the EXIT chart excluding the bit errors shows only a small part of the curves where the amount of information is too large.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1256-1265
• /
• 1996

Soft-decision detectors are used in many FEC and ARQ schemes to enhance the bit-error-probability and system throughput. Also, the hybrid-ARQ protocol is a very efficient schemeto achieve overall performance improvement. In this paper, we propose a new hybrid-ARQ protocol based on the first-order Reed-Muller codes employing soft-decision detectors. The Reed-Muller codes have the virtue of being able to use the fast Green machine decoder that is simple to implement. As the performance measures, the bit-error-probability and system throughput are evaluted for the proposed hybrid-ARQ procol, and compared with those of other hybrid-ARQ schemes. It is shown that the use of the proposed hybrid-ARQ protocol results in significant performance improvement without causing much loss in view of system complexity.