• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.1
• /
• pp.41-51
• /
• 2001

In this paper, we presented that the performance of the TCM(Trellis Coded Modulation) using the Euclidean distance is better than that of the convolutional code using the hamming distance under the same bandwidth efficiency. And the TCM DECODER for next generation mobile communication replacing the using convolutional decoder is implemented. Also, for the implementation of the TCM DECODER, the convolutional decoder and the TCM decoder were made by C-language and simulated under AWGN channel with respect to the hard decision and the soft decision. So we proved that performance of the TCM is better than that of the convolutional code. From this result, TCM DECODER, of which constraint length is 3, 5 or 7 and which use the soft decision method, was implemented using the AHDL(Altera Hardware Description Language) and fortified using the Max+plus H version 8.2 of Altera corporation.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.10
• /
• pp.619-621
• /
• 2014

In this letter, an MMSE based continuous turbo equalizer is proposed for MIMO-HARQ systems. In the proposed scheme, the soft information from the reception process for the previous transmission is reutilized at the initialization of the reception process for the next transmission to enhance the decoding convergence speed. Simulation results verify that the proposed scheme achieves an improved BLER with a significantly accelerated decoding convergence speed.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.1-11
• /
• 1999

In this paper, we proposed a design method of parameterized viterbi decoder, which automatically synthsizes the diverse viterbi deciders used in the digital mobile communication systems. It is designed to synthesize a viterbi decoder specified by user-provided parameters. Those parameters are constraint length, code rate generator polynomials of teh convolutional encoder, data rate and bits/frame of the data transmission, and soft decision bits of viterbi decoder. For the design of the parameterized viterbi decoder, we designed a user interface module C-language, and a viterbi decoder module in a hierarchical atructure using VHDL language and its generic statement. For the verification of the parameterized viterbi decoder, we compared our synthesized viterbi decoder with the conventional viterbi decoder which is designed for the IS-95 CDMA system. The proposed design method of the viterbi decoder will be a new method to obtain a required viterbi decoder in a very short time only by supplying the design parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.127-139
• /
• 2014

In this paper, we present two signal processing techniques for designing binary error correction codes for Multi-Level Cell(MLC) NAND flash memory. MLC NAND flash memory saves the non-binary symbol at each cell and shows asymmetric channel LLR l-density which makes it difficult to design soft-decision binary error correction codes such as LDPC codes and Polar codes. Therefore, we apply density mirroring and EM algorithm for approximating the MLC NAND flash memory channel to the binary-input memoryless channel. The density mirroring processes channel LLRs to satisfy roughly all-zero codeword assumption, and then EM algorithm is applied to l-density after density mirroring for approximating it to mixture of symmetric Gaussian densities. These two signal processing techniques make it possible to use conventional code design algorithms, such as density evolution and EXIT chart, for MLC NAND flash memory channel.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.1020-1023
• /
• 2011

In this paper, we present a symbol remapping method of BRGC M-ary QAM signal by using LLR soft bit decision information which is obtained after iterative decoding process. In order to reconstruct estimated transmitted signal constellation, we have to use exponential or hyperbolic tangent(tanh) function resulting in high implementation complexity. The BRGC mapping rule enables us to use a recursive operation. In addtion, we reduce the implementing complexity by using a curve fitting algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.117-122
• /
• 2006

In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1072-1075
• /
• 2019

In this letter, we propose a new soft decoding method for a Core-Layer(CL) signal in ATSC3.0 Layered-Division-Multiplexing Multiple-Inputs-Multiple-Outputs broadcasting systems. Unlike a conventional Gaussian-Approximation(GA) method, the proposed method decodes the CL signal by reducing a Enhanced-Layer signal simply to a QPSK signal, and thus exhibits greatly improved performance compared to the GA method especially for a lower CL injection-level.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.121-127
• /
• 2006

It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient stop criterion algorithm for turbo codes using the maximum sign change of LLR. It is verifying that the proposal variable iterative decoding controller can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1080-1089
• /
• 1999

The union upper bounds to the bit error probability of maximum likelihood(ML) soft-decoding of parallel concatenated convolutional codes(PCCC) and serially concatenated convolutional codes(SCCC) can be evaluated through the weight enumerating function(WEF). This union upper bounds become the lower bounds of the BER achievable when iterative decoding is used. In this paper, to compute the WEF, an efficient error event search algorithm which is a combination of stack algorithm and bidirectional search algorithm is proposed. By computor simulation, it is shown that the union boounds obtained by using the proposed algorithm become the lower bounds to BER of concatenated convolutional codes with iterative decoding.