• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.27-32
• /
• 2003

An efficient soft-decision decoding algorithm for binary block codes it proposed. The proposed soft-decision decoding algorithm is implemented by a series of hard-decision decoding process. By the hard-decision decoding result, the candidate codewords are efficiently searched for A new decoding method, which prevents the missing of the candidate codeword, is proposed. Also, the method fir reducing complexity is developed. This method removes the practical complexity increase caused by the improved algorithm. There facts are confirmed by the simulation results for binary (63, 36) BCH code.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.32-39
• /
• 1996

Hybrid decision decoding for the extended hamming codes without retransmission, which is a combination of hard and soft decision decoding, is proposed and its performance is analyzed in this paper. As results, hybsrid decision decoding shows a little bit higher residual bit error rate than soft decision decoding. However, as the size of the extended hamming code increases, the difference of th enumber of comparisons increases further. In addition, hybrid decision decoding shows almost same residual bit error rate as hard decision decoding with retrassmission and shows much lower residual bit error rate than hard decision decoding without retransmission.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.7
• /
• pp.12-18
• /
• 1993

We have proposed a soft-decision decoding method for block codes. With careful examinations of the first hard-decision decoded results, The candidate codewords are efficiently searched for. Thus, we can reduce the decoding complexity (the number of hard-decision decodings) and lower the block error probability. Computer simulation results are presented for the (23,12) Golay code. They show that the decoding complexity is considerably reduced and the block error probability is close to that of the maximum likelihood decoder.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.421-431
• /
• 1998

Error control performance of the (16, 7) minimum-bandwidth binary error cotrol line code (MB-ECLC) according to decoding algorithms is analyzed and compared in this paper. As a result , when retransmission is not allowed or meaningless. to reduce performance degradation ad computational burden. the modified soft decision decoding algorithm using the structure of (16,7) MB-ELEC is proposed. The error cotnrol capability of this modified algorithm is far better than that of a hard decision decoding algorithm, and almost same as that of a full soft decision decoding algorithm. In additino, the number of comparisons for the modified algorithm is decreased more than 5 times as compared with a full soft decision decoding algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.512-521
• /
• 2012

In this paper, we propose feasible combining rules for a decoding scheme of product codes to apply finite soft decision. Since the decoding scheme of product codes are based on complex tanh calculation with infinite soft decision, it requires high decoding complexity and is hard to practically implement. Thus, simple methods to construct look-up tables for finite soft decision are derived by analyzing the operations of the scheme. Moreover, we focus on using convolutional codes, which is popular for easy application of finite soft decision, as the horizontal codes of product codes so that the proposed decoding scheme can be properly implemented. Numerical results show that the performance of the product codes with convolutional codes using 4-bit soft decision approaches to that of same codes using infinite soft decision.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.785-794
• /
• 2013

Soon after Lee and O'Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is proposed.

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

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.73-79
• /
• 2004

In this paper, we propose an efficient soft decision decoding algorithm for linear block codes. A conventional soft decision decoder have to invoke a hard decision decoder several times to estimate its soft decision values. However, in this method, we may not have candidate codewords, thus it is very difficult to produce soft decision values. We solve this problem by introducing an efficient algorithm to search candidate codewords. By using this, we can highly reduce the cases we cannot find candidate codewords. We estimate the performance of the proposed algorithm by using the computer simulations. The simulation is performed for binary (63, 36) BCH code in fading channel.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1895-1902
• /
• 2011

The soft-decision e-BCH decoding algorithm based on the Chase algorithm is adopted in DVB-RCS NG systems. For implementation, it is necessary to decide the number of optimal quantization bits when soft-decision e-BCH decoding algorithm is processed. Also, the performance must be satisfied. Therefore, in this paper, when the soft-decision e-BCH decoder is implemented, we select the number of optimal quantization bits using BER performance.