• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.843-850
• /
• 2003

Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.316-320
• /
• 1987

This paper deals with expert system for power system fault restoration and accompanying numerical data processing. Nowadays, expert system which is a branch or artificial intelligence expands its application area to many fields. And it requires computer language for A.I. to be versatile. Expert system for power system handles numerous numerical data and language for A.I. has its deficiency in numerical data processing. However some recent version of the A.I. language rind ways of overcoming this dilemma by giving the way or linking conventional algorithmic languages to them. This study presents numerical data processing routines described in Turbo prolog which is run in IBM PC and linking numerical data processing routines written in Turbo C to Turbo prolog.

• 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.28 no.10C
• /
• pp.923-929
• /
• 2003

Turbo processing have been known as methods close to Shannon limit in the aspect of wireless multi-input multi-output (MIMO) communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but LDPC coding has not been used for turbo processing because of the inherent decoding process delay. This paper suggests a LDPC coded MIMO system with turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and proposes a average soft-output syndrome (ASS) check scheme at low signal to noise ratio (SNR) for the Turbo-PAST system to decide the reliability of decoded frame. Simulation results show that the suggested system outperforms conventional system and the proposed ASS scheme effectively reduces the amount of turbo processing iterations without performance degradation from the point of average number of iterations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.379-388
• /
• 2007

In this paper, we propose an adaptive turbo decoding algorithm for high order modulation scheme combined with originally design for a standard rate-1/2 turbo decoder for B/QPSK modulation. A transformation applied to the incoming I-channel and Q-channel symbols allows the use of an off-the-shelf B/QPSK turbo decoder without any modifications. Adaptive turbo decoder process the received symbols recursively to improve the performance. As the number of iterations increase, the execution time and power consumption also increase as well. The source of the latency and power consumption reduction is from the combination of the radix-4, dual-path processing, parallel decoding, and early-stop algorithms. We implemented the proposed scheme on a field-programmable gate array (FPGA) and compared its decoding speed with that of a conventional decoder. From the result of implementation, we confirm that the decoding speed of proposed adaptive decoding is faster than conventional scheme by 6.4 times.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.12 s.115
• /
• pp.1164-1171
• /
• 2006

In this paper, a simple and nonlinear MMSE detector is derived from the conventional linear MMSE detector to improve the system performance in turbo processing MIMO system and a new turbo processing MIMO system with nonlinear MMSE detector and Gaussian approximation is proposed. In turbo coded turbo processing MIMO system, the proposed system of M=N=4 performs about 0.5 dB better than the conventional system and the proposed system of M=N=8 performs about 0.4 dB better than conventional system at 1 % FER. In addition, the average number of outer iterations of proposed system shows lower than that of conventional system. This is caused by the fact that the nonlinear MMSE detector of proposed system decides soft-outputs of coded bits based on the observation of received signals, so that it can reduce the uncertainty region in estimating the coded bits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.537-543
• /
• 2007

In this paper, we propose a new stopping criterion for the turbo processing (Turbo-BLAST) of MIMO-OFDM system. To reduce the high computational complexity of turbo-BLAST, it is desirable to lessen the outer-loop iteration number. In a system such as IEEE 802.16e Mobile WiMax, no CRC bits are available except the last encoding packet of a transmitted burst, so early stopping criteria without the help of CRC bits are needed. The proposed criterion counts the sign differences between received parity bits and the re-encoded parity bits from received information bits. With the tail-biting code which is accepted for IEEE 802.16e, a method that the re-encoder operates at half complexity is also proposed. Computer simulations show that the proposed stopping criterion approaches the performance of GENIE aided criterion with less average number of iterations than the other early stopping criteria.

• Journal of electromagnetic engineering and science
• /
• v.6 no.3
• /
• pp.147-154
• /
• 2006

In this paper, we propose and present implementation results of a high-speed turbo decoding algorithm. The latency caused by (de) interleaving and iterative decoding in a conventional maximum a posteriori(MAP) turbo decoder can be dramatically reduced with the proposed design. The source of the latency reduction is come from the combination of the radix-4, dual-path processing, parallel decoding, and rearly-stop algorithms. This reduced latency enables the use of the turbo decoder as a forward error correction scheme in real-time wireless communication services. The proposed scheme results in a slight degradation in bit-error rate(BER) performance for large block sizes because the effective interleaver size in a radix-4 implementation is reduced to half, relative to the conventional method. Fixed on the parameters of N=212, iteration=3, 8-states, 3 iterations, and QPSK modulation scheme, we designed the adaptive high-speed turbo decoder using the Xilinx chip (VIRTEX2P (XC2VP30-5FG676)) with the speed of 17.78 Mb/s. From the results, we confirmed that the decoding speed of the proposed decoder is faster than conventional algorithms by 8 times.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1135-1138
• /
• 2011

안드로이드 시장이 급성장함에 따라 안드로이드 기반 어플리케이션에 대한 수요가 많아지고 있다. 그로 인해 3D 그래픽적 기능을 요구하는 어플리케이션에 대한 요구도 늘어났다. 그러나 안드로이드 단말기에서는 3D 처리능력이 데스크 탑과 비교하여 성능과 서비스에 한계가 있다. 그렇기 때문에 VNC(Virtual Network Computing)를 사용하여 고성능의 그래픽을 요구하는 프로그램을 실행할 수 있게 된다. VNC 란 클라이언트에서 데스크 탑으로 접속하여 원격으로 제어하고 그 결과를 그래픽으로 확인하는 프로그램이다. 그러나 기존의 Android VNC 는 해상도가 낮고, 이미지 전송 속도가 느리기 때문에 3D 렌더링 이미지 처리가 불가능했다. 또한 Android VNC 는 인터페이스가 불편하여 입력 오류가 많아 사용이 불편했다는 단점 등이 지적되어 왔다. 본 논문에서는 이를 개선하기 위한 Android Turbo VNC 를 제안한다. Android Turbo VNC는 libjpeg-turbo 코덱을 적용하여 3D 이미지 부분에서 기존의 Android VNC 에 비하여 약 80~120%의 이미지 개선과 이미지 압축률을 4 배정도 높여 CAD 와 같은 고성능의 그래픽을 요구하는 프로그램의 사용을 가능하게 한다. 그리고 Android Turbo VNC 에서는 기존 Android VNC 의 불편한 UI 를 개선하였다. 클라우드 서버에서는 CAD, Document, Game, Video, General 총 5 가지의 프로그램을 서비스하여 그에 맞는 테마 별 UI 를 제공한다. libjpeg-turbo 코덱의 적용을 통해 Android-Turbo VNC 는 수십 장의 설계 도면을 굳이 들고 다니지 않더라도 하나의 테블릿 PC 안에서 보는 것이 가능하게 된다. 테마별 UI 중 CAD 테마는 3D CAD 를 사용하는 산업현장에서 적극적으로 활용될 것으로 기대된다.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.363-370
• /
• 2007

In this paper, we propose a flexible turbo decoding algorithm for a high order modulation scheme that uses a standard half-rate turbo decoder designed for binary quadrature phase-shift keying (B/QPSK) modulation. A transformation applied to the incoming I-channel and Q-channel symbols allows the use of an off-the-shelf B/QPSK turbo decoder without any modifications. Iterative codes such as turbo codes process the received symbols recursively to improve performance. As the number of iterations increases, the execution time and power consumption also increase. The proposed algorithm reduces the latency and power consumption by combination of the radix-4, dual-path processing, parallel decoding, and early-stop algorithms. We implement the proposed scheme on a field-programmable gate array and compare its decoding speed with that of a conventional decoder. The results show that the proposed flexible decoding algorithm is 6.4 times faster than the conventional scheme.