• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.8
• /
• pp.1-6
• /
• 2002

In this paper, we considered the CDMA/TDD system suitable for high-speed packet data transmission such as Internet and multimedia services, and a sequential decoding scheme which enables fast decoding and retransmission requirement. In addition, we Proposed an improved FANO algorithm, which adopts the competition path in order to reduce the number of revisit nodes. The conventional FANO algorithm suffered from the drawback of much more revisit nodes. Furthermore, we analyzed the performance of the CDMA/TDD system with the sequential decoding scheme we proposed over multipath channel.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.905-908
• /
• 2008

In this paper, an Adaptive Modulation (AM) system with an efficient turbo-coded Vertical-Bell-lab Layered Space-Time (V-BLAST) technique is proposed. The proposed decoding algorithm adopts iteratively the extrinsic information from a Maximum a Posteriori (MAP) decoder as a priori probability in the two decoding procedures of the V-BLAST scheme of ordering and slicing. In this analysis, each MIMO channel is assumed to be a part of the system of performance improvement.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.465-472
• /
• 2013

This paper presents a low-complexity triple-error-correcting parallel Bose-Chaudhuri-Hocquenghem (BCH) decoder architecture and its efficient design techniques. A novel modified step-by-step (m-SBS) decoding algorithm, which significantly reduces computational complexity, is proposed for the parallel BCH decoder. In addition, a determinant calculator and a error locator are proposed to reduce hardware complexity. Specifically, a sharing syndrome factor calculator and a self-error detection scheme are proposed. The multi-channel multi-parallel BCH decoder using the proposed m-SBS algorithm and design techniques have considerably less hardware complexity and latency than those using a conventional algorithms. For a 16-channel 4-parallel (1020, 990) BCH decoder over GF($2^{12}$), the proposed design can lead to a reduction in complexity of at least 23 % compared to conventional architecttures.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.999-1000
• /
• 2006

The LDPC Code is focusing a powerful FEC(Forward Error Correction) codes for 4G Mobile Communication system. LDPC codes are used minimizing channel errors by modeling AWGN Channel as VDSL system. The performance of LDPC code is better than that of turbo code in long code word on iterative decoding algorithm. LDPC code are encoded by sparse parity check matrix. there are decoding algorithms for a LDPC code, Bit Flipping, Message passing, Sum-Product. Because LDPC Codes use low density parity bit, mathematical complexity is low and relating processing time becomes shorten.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.177-178
• /
• 2007

WiBro system provides reliable broadband communication services for mobile and portable subcribers. It allows interference-free reception under the conditions of multipath propagation and transmission errors. Thus, powerful channel-error correction ability Is required. CC/CTC Decoder which Is mandatory for WiBro system needs lots of computations for real-time operation. So, it is desired to design a CC/CTC Decoder having highly optimized hardware scheme for low latency operation under high data rates. This paper proposes an efficient CC/CTC Decoder structure for high data rate WiBro system. Particularly, the proposed CTC Decoder architecture reduces decoding delay by applying pipelining and multiple decoding blocks. Simulation results show that reduction of about 80% of processing time is enabled with the proposed CC/CTC Decoder despite of increase in are.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.217-217
• /
• 2006

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1290-1298
• /
• 2000

Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics, and uses the information to the next decoding step Turbo Code shows excellent performance, approaching Shannon Limit at the view of BER, when the size of Interleaver is big and iterate decoding is run enough. But it has the problems which are increased complexity and delay and difficulty of real-time processing due to Interleaver and iterate decoding. In this paper, it is analyzed that MAP(maximum a posteriori) algorithm which is used as one of Turbo Code decoding, and the factor which determines its performance. MAP algorithm proceeds iterate decoding by determining soft decision value through the environment and transition probability between all adjacent bits and received symbols. Therefore, to improve the performance of MAP algorithm, the trust between adjacent received symbols must be ensured. However, MAP algorithm itself, can not do any action for ensuring so the conclusion is that it is needed more algorithm, so to decrease iterate decoding. Consequently, MAP algorithm and Turbo Code performance are analyzed in the nongaussian channel applying Robust equalization technique in order to input more trusted information into MAP algorithm for the received symbols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.219-228
• /
• 2010

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved en-or performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.81-89
• /
• 2003

For improving the performance of noise suppression in tactical communication environments, an enhanced MELP vocoder is suggested, in which an acoustic noise suppressor is integrated into the front end of the MELP algorithm, and an FEC code into the channel side of the MELP algorithm. The acoustic noise suppressor is the modified IS-127 EVRC noise suppressor which is adapted for the MELP vocoder. As for FEC, the turbo code, which consists of rate-113 encoding and BCJR-MAP decoding algorithm, is utilized. In acoustic noise environments, the lower the SNR becomes, the more the effects of noise suppression is increased. Moreover, The suggested system has greater noise suppression effects in stationary noise than in non-stationary noise, and shows its superiority by 0.24 in MOS test to the original MELP vocoder. When the interleave size is one MELP frame, BER 10-6 is accomplished at channel bit SNR 4.2 ㏈. The iteration of decoding at 3 times is suboptimal in its complexity vs. performance. Synthetic quality is realized as more than MOS 2.5 at channel bit SNR 2 ㏈ in subjective voice quality test, when the interleave size is one MELP frame and the iteration of decoding is more than 3 times.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.67-74
• /
• 2007

Turbo code, a kind of channel coding technique, has ben used in the field of digital mobile communication system if the number of iterations is increased in the several channel environments, my further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. In this paper, it proposes an efficient stopping rules for the iteration process in turbo decoding. By using absolute mean values for the LLR difference values between the first and second decoder in the present decoding process, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations of proposed algorithm is reduced by about $18.25%{\sim}20.58%$ compared to SDR algerian in the lower SNR region, and is reduced by about $22.96%{\sim}28.74%$ compared to method using variance values of extrinsic information in the upper SNR region.