• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1068-1073
• /
• 2000

In this paper, we propose a serially concatenated turbo bode/turbo equalizer scheme for optical storage systems. Without modulation coding, a random data sequence is directly passed through the optical channel. In simulation, the channel includes jitter of 15% and AWGN. The densities of the channel are S=4.6 and S=7.0. The code rates of turbo code are 4/5, 8/9 and 16/17. All code rates, the bit error probability is less than 10-5 at 24dB when we and jitter of 15%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.311-314
• /
• 2001

본 논문에서는 다중 경로 레일리 페이딩 채널에서 MC (Multi-Carrier) CDMA 시스템의 BER 성능을 분석하였고, 최근에 가장 강력한 부호화 기법으로 급부상하고 있는 터보 코드를 MC CDMA 시스템에 적용하여 성능 개선 정도를 평가하였다. 성능 해석 결과, 레일리 페이딩 채널에서는 강력한 성능 개선 기법을 적용하지 않는 한 사용자수와 E$_{b}$/N$_{o}$ 값에 관계없이 음성 서비스를 지원하지 못함을 알 수 있었다. 한편, 터보 코드를 성능 개선 기법으로 적용하면 BER 성능이 매우 개선되고, 사용자 수와 E$_{b}$/N$_{o}$ 값에 관계없이 음성 서비스를 충분히 지원할 수 있음을 알 수 있었다. 예를 들어 E$_{b}$/N$_{o}$ 가 10 dB이고 사용자 수가 10명인 경우, 터보 코드를 적용함에 의해 BER 성능이 약 5$\times$$10^{-3}$ 정도 개선됨을 알 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.11B
• /
• pp.1879-1883
• /
• 2000

디지털 자기 기록 저장기기에서 채널 밀도가 증가하면 심각한 인접심볼 간섭과 비선형 왜곡이 야기된다. 본 논문에서는 심각한 비선형 인접심볼 간섭과 비선형 왜곡을 극복하기 위한 방법으로 기존의 등화기 대신 NLTE(neural linear transversal equalizer)를 등화기로 사용하고 검출기로는 터보 코드를 사용한 NLTE/TC 구조를 제안한다. 채널 밀도 S=2.5에서 부분 삭제가 0.7 정도 존재할 때, 코드율이 8/9일 때는 $10^{-5}$의 비트 에러율을 18dB 이후에서 만족하며, 코드율이 16/17일 때는 20dB 이후에서 만족함을 알 수 있었다. 채널 밀도 S=3에서 부분 삭제가 0.6 정도 존재할 때 코드율이 8/9일 때는 $10^{-5}$의 비트 에러율을 22dB 이후에서 만족하고, 코드율이 16/17일 때는 24dB 이후에서 만족함을 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.3B
• /
• pp.369-374
• /
• 2001

본 논문에서는 터보코드의 설계를 위한 새로운 일터리버 방식(3차원 블록 인터리버)을 소개한다. 3차원 블록 인터리버는 같은 블록크기를 가지는 2차원의 블록 인터리버보다 최소 비트간의 거리를 크게 할 수 있는 방버븡로, 3 차원 인터리빙 알고리즘에 의해 계산된 주소 값을 이용하여 입/출력 데이터의 순서를 조절함으로서 데이터의 비트 거리 특성을 향상시킨 것이다. 터보코드는 데이터 율, 부호기의 구속장의 길이, 복호방식, 순환복호의 횟수 등 여러 가지 요소들에 의해 성능이 좌우되며, 특히 인터리버의 종류 및 크기의 선택에 따라서 성느의 차이를 보인다. 컴퓨터 시뮬레이션을 이용하여 3차원 블록 인터리버의 성능을 분석하였으며, 전송 환경을 가우시안 및 비가우시간 채널로 설정하였다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.2
• /
• pp.47-51
• /
• 2009

The low latency encoder for high data rate duo-binary turbo codes with tail biting trellises is considered. Encoder hardware architecture is proposed using inherent encoding property of duo-binary turbo codes. And we showed that half of execution time as well as the energy can be reduced with the proposed architecture.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.105-114
• /
• 2000

In this paper, we propose a bandwidth-efficient channel coding scheme using the turbo trellis-coded modulation with multiple symbol detection. The turbo code can achieve good bit error rates (BER) at low SNR. That comprises two binary component codes and an interleaver. TCM codes combine modulation and coding by optimizing the euclidean distance between codewords. This can be decoded with the Viterbi or the symbol-by- symbol MAP algorithm. But we present the MAP algorithm with branch metrics of the Euclidean distance of the first phase difference as well as the Lth phase difference. The study shows that the turbo trellis-coded modulation with multiple symbol detection can improve the BER performance at the same SNR.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.295-300
• /
• 2002

In this paper, we apply the 3-dimension algorithm to the random interleaver and s-random interleaver and analyze the performance of the turbo code system with random interleaver (or s-random interleaver). In general, the performance of interleaver is determined by minimum distance between neighbor data, thus we could improve the performance of interleaver by increasing the distance of the nearest data. The interleaver using 3-dimension algorithm has longer minimum distance and average distance compared to existing random-interleaver (s-random interleaver) because the output data is generated randomly from 3-dimension storage. To verify and compare the performance of our proposed system, the computer simulations have been performed in turbo code system under gaussian noise environment.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.7
• /
• pp.97-103
• /
• 2004

In this paper, we propose a high speed block turbo code decoding algorithm and an efficient hardware architecture. The multimedia wireless data communication systems need channel codes which have the high-performance error correcting capabilities. Block turbo codes support variable code rates and packet sizes, and show a high performance due to a soft decision iteration decoding of turbo codes. However, block turbo codes have a long decoding time because of the iteration decoding and a complicated extrinsic information operation. The proposed algorithm using the threshold that represents a channel information reduces the long decoding time. After the threshold is decided by a simulation result, the proposed algorithm eliminates the calculation for the bits which have a good channel information and assigns a high reliability value to the bits. The threshold is decided by the absolute mean and the standard deviation of a LLR(Log Likelihood Ratio) in consideration that the LLR distribution is a gaussian one. Also, the proposed algorithm assigns '1', the highest reliable value, to those bits. The hardware design result using verilog HDL reduces a decoding time about 30% in comparison with conventional algorithm, and includes about 20K logic gate and 32Kbit memory sizes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.333-340
• /
• 2003

In this paper, we propose a new turbo-coded orthogonal frequency division multiplexing (OFDM) transmission scheme that can improve greatly the performance by making all the turbo-coded symbols have the same reliability for OFDM transmission over a frequency selective fading channel. The same reliability, that is, the same fading can be accomplished through multiplexing of turbo-coded symbols using distinct orthogonal codes and spreading over the whole effective subcarriers (hereafter, called as the orthogonal code multiplexing (OCM)). As for the orthogonal code selection, we choose the set of the discrete Fourier transform (DFT) basis sequences, since the code set holds the orthogonality irrespective of the length and also has the equal energy property. We perform computer simulations using the Log-maximum-a-posteriori (Log-MAP) algorithm for iterative decoding in order to assess the performance of the proposed transmission scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.921-930
• /
• 2004

In this paper, a robust video transmission system is proposed. To effectively prevent the corruption of video stream and its propagation in spatial and temporal domains, a version of turbo code, so-called as byte-aligned variable-length turbo code, is applied. Protection performance of the proposed turbo code is first evaluated by applying it to GOB-based variable-size ITU-T H.263+ video packets, where the protection level is statically controlled based on the joint source-channel criteria. This protection is then extended to support the adaptation of code ratio to best match the time-varying channel condition. The time-varying Rayleigh fading channel is modelled considering the correlation of the fading channel. The resulting performance comparison with the static turbo code as well as the conventional RCPC code clearly demonstrates the possibility of the proposed adaptation approach for the time-varying correlated Rayleigh-fading channel.