• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1441-1449
• /
• 2001

차세대 멀티미디어 이동통신인 IMT-2000의 규격에서는 3GPP와 3GPP2에서 모두 터보 코드를 채널 코덱으로 채택하고 있다. 그 중 3GPP 에서는 용도에 따라 길쌈부호와, 제한길이 4인 1/3 터보코드를 선택적으로 사용하도록 정의되어 있다. 터보코드는 복호기의 출력으로 경판정 복호 비트에 대한 신뢰도 값을 동시에 생성하여, 이를 이용한 반복복호로 우수한 BER 특성을 얻을 수 있어야 한다. 본 논문에서는 먼저 3GPP 규격의 터보 복호기에 적용할 수 있는 내부 복호기로서 SOVA 복호기를 설계하였다. 또한 터보 복호기에서의 연판정 출력값의 중요성을 감안하여, 누적메트릭 정규화에 있어서 신뢰도 값에 영향을 주지않는 구조를 제안하여 적용하였다. 본 연구에서는 효율적인 구조의 3GPP SOVA 복호기를 설계하기 위하여 C++를 이용하여 알고리즘에 대한 성능을 검증하였으며, 이를 기반으로 VHDL을 이용하여 복호기를 설계하였다. 마지막으로 Altera사의 EPF10K100GC503 FPGA를 이용하여 복호기를 하드웨어로 구현하였다.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.357-359
• /
• 2010

The Viterbi Decoding is one of the most researched areas of the convolutional decoding methods. In this paper, we use various parameters for the substantial Viterbi decoding and discuss some viterbi decoding methods. And, the viterbi algorithms of the methods, we discuss 'Hard Decision' and 'Soft Decision'. So, we compare differences of two methods about decoding methods, performance. Because of having various parameters and decision methods, we discuss the values of various parameter and decision methods in the Gaussian channel about the viterbi decoding methods.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.2
• /
• pp.268-277
• /
• 2001

In this paper, the system performance with the convolution code using a Viterbi decoding and the one tap LMS equalizer applied to the OFDM system, which is suitable for IEEE 802.1la wireless LAN in indoor wireless channel, is analyzed through computer simulation. Indoor wireless channel is modeled as Rician fading channel, and QPSK and 16QAM scheme are used for subchannel modulation. In Rician fading channel with the power ratio of the direct path signal to the scattered signals, K=5 dB, BER of $10^{-4}$ is satisfied if the SNRs of the QPSK/OFDM and the 16QAM/OFDM are 8.6 dB and 19.2 dB in hard decision and 5.3 dB and 9.8 dB in soft decision, respectively. Compared with convolution code scheme, it is observed that 16QAM/OFDM system with the one tap LMS equalizer has the performance improvement of 8.6 dB and 2 dB in hard decision and soft decision, respectively.

• 프린팅코리아
• /
• s.18
• /
• pp.138-142
• /
• 2003

우리나라의 옛 인쇄가 언제부터 시작되었는지는 정확히 알 수 없다. 그러나 삼국시대 인장, 비석, 경판 등을 종이에 베끼거나, 나무나 돌에 조작하던 기술이 집적되어 인쇄술로 발전하면서부터 시작되었을 것으로 보인다. 우리나라의 현존하는 가장 오래된 인쇄물은 나무판본으로 1966년 경주 불국사 석가탑에서 발견된 "무구정광대다라니경"이다. 이것은 석가탑 건립 당시인 751년(신라 경덕왕10년)경에 만든 것으로 판각이 정교하고 고졸한 느낌을 준다.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.3 no.2
• /
• pp.22-29
• /
• 1992

In recent years there has been increased interest in a class of multiple-access techniques known as code division multiple-access(CDMA). As the trend for ever increasing data transmission rate and high error performance continues while conserving bandwidth, the needs arise for good highrate R=b/v convolu- tional codes such as punctured codes. In this paper, the packet error propability has been analyzed in code division multiple-access packet radio system which utilize punctured convolutional code and hard-decision Viterbi decoding.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.252-253
• /
• 2014

최근 채널 효율을 향상시키기 위하여 다중안테나(MIMO, multi-input multi-output) 기술이 연구되고 있다. 다중안테나 기술은 송 수신 안테나 개수를 증가시켜 수신 성능을 향상시키고 대역 효율을 향상시키지만 송신 안테나 개수를 늘려야만 대역 효율을 증가시킬 수 있으므로 기존 방송 시스템에 적용하기에는 비용이 많이 드는 단점이 있다. 이에 본 논문은 방송 시스템에 적합한 SIMO(single-input multi-output) 시스템에 FTN(faster than Nyquist)을 적용하여 대역 효율을 증가시키고 수신 성능을 향상시키고자 한다. 또한 MRC(maximum ratio combining) 및 경판정(hard decision)을 적용하여 수신 안테나 개수에 따른 수신 성능을 컴퓨터 실험을 통하여 알아본다.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.23-27
• /
• 2014

In this paper, we propose a soft demapping method for 64-ary APSK in the DVB-S3 system. The proposed method in this paper uses the hard decision threshold (HDT) line for each constituent bit in a symbol, and calculates the soft bit information with the distance between the HDT line and the detected symbol. If the HDT lines are defined in a simple manner, the complexity to estimate soft information can be largely reduced compared with the maximum likelihood detection (MLD) which has an exponential complexity. By considering this, we first derive HDT lines for each constituent bit for a 64-APSK symbol, and propose a method to calculate soft bit information. We simulate the BER performance of the proposed scheme by using a turbo codes which requires soft-input-soft-output information, and compare it that of the MLD. The result show that the proposed scheme produces approximating performance to MLD with largely reduced complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.180-187
• /
• 2002

The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.