• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.268-271
• /
• 2011

본 논문에서는 지상파 3D HDTV 방송 서비스를 제공하기 위하여 기존의 유럽형 HDTV 방송 서비스인 DVB-T2 전송 시스템의 채널 부호군을 연구하고, 이 시스템의 외부 부호(Outer Code)로 쓰이는 BCH 부호의 경판정(Hard Decision)을 통한 복호를 연판정(Soft Decision)을 통한 복호로 수정함으로써 성능에 미치는 영향에 대해 살펴보았다. 또한 기존의 DVB-T2 전송시스템의 성능을 살펴보고, 이를 바탕으로 기존의 외부 부호(Outer Code)인 BCH 부호와 내부 부호(Inner Code)인 LDPC 부호의 조합을 연판정이 가능하고 복호하는 블록(Block)의 길이가 더 짧아진 BTC(Block Turbo Code)부호와 LDPC 부호와의 조합으로 바꿈으로써 기존의 DVB-T2 전송 시스템보다 블록 오류율이 낮아짐을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11C
• /
• pp.1045-1051
• /
• 2003

The SOVA, which produces the soft decision value, can be used as a sub-optimum solution for concatenated codes such as turbo codes, since it is computationally efficient compared with the optimum MAP algorithm. In this paper, we propose an efficient implementation of the SOVA used for decoding turbo codes, by reducing the number of calculations for soft decision values and trace-back operations. In order to utilize the memory efficiently, the whole block of turbo codes is divided into several sub-blocks in the proposed algorithm. It is demonstrated that the proposed algorithm requires less computation than the conventional algorithm, while providing the same overall performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.61-66
• /
• 2013

In this paper, we propose an iterative soft dimension reduction based multi-input multi-output (MIMO) detection for coded spatial multiplexing system. In spite of better performance of iterative MIMO detection, its computational complexity gives a significant burden to the receivers. To mitigate this problem, we propose a scheme employing all ordering successive interference cancellation (AOSIC) for hard-decision detection and dimension reduction soft demodulator (DRSD) with iterative decoding for soft-decision detectors, respectively. This scheme can reduce complexity of iterative soft MIMO detection and provide better performance than other conventional detectors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.185-190
• /
• 2005

In IS-95 and IMT-2000 systems using variable code rates and constraint lengths, this paper limits code rate 1/2 and constraint length 3 and realizes forward real-time decoder using Sliding-Window with decoding length 6 and PVSL(Prototype Vector Selecting Logic), LVQ(Learning Vector Quantization) in Neural Network. In comparison condition to theoretically constrained AWGN channel environment at $S/(N_{0}/2)=1$ I verified the superiority of forward real-time decoder through hard-decision and soft-decision comparison between Viterbi decoder and forward real-time decoder such as BER and Secure Communication and H/W Structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.905-912
• /
• 1999

In this paper we explain a trellis representation of block codes and derive their MAP decoding algorithm based on it. We also analyze the performance of block codes and concatenated codes with block codes as components by computer simulations, which were performed by changing the structures and constituent codes of concatenated codes. Computer simulations show that soft decision decoding of block codes get an extra coding gain than their hard decision decoding and that concatenated codes using block codes have good performance in the case of high code rate.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.4 no.2
• /
• pp.369-378
• /
• 2014

The Reed-Muller code is one of the efficient algorithms for multiple bit error correction, however, its high-computation requirement inherent in the decoding process prohibits its use in practical applications. To solve this problem, this paper proposes a graphics processing unit (GPU)-based parallel error control approach using Reed-Muller R(r, m) coding for real-time wireless communication systems. GPU offers a high-throughput parallel computing platform that can achieve the desired high-performance decoding by exploiting massive parallelism inherent in the algorithm. In addition, we compare the performance of the GPU-based approach with the equivalent sequential approach that runs on the traditional CPU. The experimental results indicate that the proposed GPU-based approach exceedingly outperforms the sequential approach in terms of execution time, yielding over 70× speedup.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.1
• /
• pp.21-28
• /
• 2004

In this paper we apply block turbo coding at the transmitter and iterative decoding algorithm at the receiver for different operating modes, based on the 5 ㎓ IEEE 802.1 la WLAN system, instead of convolutional coding and soft decision viterbi algorithm to improve forward error correcting performance. Experimental results showed that each coding scheme outperforms coding gains of up to 3.5 ㏈ at the BER of 10$\^$-3/.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.738-745
• /
• 2012

This paper proposes an approximated soft decision demapping algorithm with low computational complexity for coded 4+12+16 amplitude phase shift keying (APSK) in an additive white Gaussian noise (AWGN) channel. To derive the proposed algorithm, we approximate the decision boundaries for 4+12+16 APSK symbols, and then decide the log likelihood ratio (LLR) value for each bit from the approximated decision boundaries. Although the proposed algorithm shows about 0.6~1.1dB degradation on the error performance compared with the conventional max-log algorithm, it gives a significant result in terms of the computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7C
• /
• pp.616-626
• /
• 2007

In spatially multiplexed MIMO systems that enable high data rate transmission over wireless communication channels, the spatial demultiplexing at the receiver is a challenging task, and various demultiplexing methods have been developed recently by many researchers. Among the previous methods, maximum likelihood detection with QR decomposition and M-algorithm (QRM-MM)), and sphere decoding (SD) schemes have been reported to achieve a (near) maximum likelihood (ML) performance. In this paper, we propose a novel signal detection method that achieves a near ML performance in a computationally efficient manner. The proposed method is demonstrated via a set of computer simulations that the proposed method achieves a near ML performance while requiring a complexity that is comparable to that of the conventional MMSE-OSIC. We also show that the log likelihood ratio (LLR) values for all bits are obtained without additional calculation but as byproduct in the proposed detection method, while in the previous QRM-MLD, SD, additional computation is necessary after the hard decision for LLR calculation.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.7
• /
• pp.79-81
• /
• 1998

2진 BCH 부호에 대한 새로운 연판정 복호법을 제안하였다. 후보부호어가 선출되지 않을 때의 성능 저하를 방지할 수 있는 개선된 알고리듬을 개발하여 오정정 확률과 정정 불 능 확률이 낮아지게 하였다. 또한, 복잡도를 줄이는 방안도 개발하여 알고리듬 개선으로 인 한 복잡도 증가가 거의 나타나지 않도록 하였다. (31,16) BCH 부호에 대한 시뮬레이션 결과 로 이러한 사실들을 확인할 수 있었다.