• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.165-171
• /
• 2014

The rate of the channel code can be controlled by various methods. Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (n,k) convolutional code is obtainable by puncturing some mother codes, and the process of finding the mother code is necessary for designing the optimum channel decoder. In this paper, we proved that any (n,n-1) convolutional code has (2,1) mother codes regardless of the puncturing pattern and showed that they must be equivalent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1014-1020
• /
• 2008

Storage devices such as memories are widely used in various electronic products. They require high-density memory and currently the data has been stored in multi-level format, that results in high error rate. In this paper, we apply error correction schemes that are widely used in communication system to the storage devices for satisfying low bit error rate and high code rate. In A WGN channel with average BER $10^{-5}$ and $5{\times}10^{-6}$, we study error correction schemes for 4-1evel cell to achieve target code rate 0.99 and target BER $10^{-11}$ and $10^{-13}$, respectively. Since block codes may perform better than the concatenated codes for high code rate, and it is important to use less degraded inner code even when many bits are punctured. The performance of concatenated codes using general feedforward systematic convolutional codes are worse than the block code only scheme. The simulation results show that RSC codes must be used as inner codes to achieve good performance of punctured convolutional codes for high code rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.337-346
• /
• 2004

Punctured convolutional codes increase transmission efficiency without increasing hardware complexity. However, Viterbi decoder supporting punctured codes requires long decoding length and large survivor memory to achieve sifficiently low bit error rate (BER), when compared to the Viterbi decoder for a rate 1/2 convolutional code. This Paper presents novel architecture adopting a pipelined trace-forward unit reducing survivor memory requirements in the Viterbi decoder. The proposed survivor path architecture reduces the memory requirements by removing the initial decoding delay needed to perform trace-back operation and by accelerating the trace-forward process to identify the survivor path in the Viterbi decoder. Experimental results show that the area of survivor path unit has been reduced by 16％ compared to that of conventional hybrid survivor path unit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.260-268
• /
• 2012

The use of an error-correcting code is essential in communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, we propose two algorithms for reconstructing convolutional codes: one for general convolutional codes and the other for punctured convolutional codes. And we also verify the algorithms by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.53-68
• /
• 2013

We investigate the rate-compatible punctured convolutional (RCPC) codes concatenated with hierarchical QAM for designing a cross-layer unequal error protection scheme for H.264 coded sequences. We first divide the H.264 encoded video slices into three priority classes based on their relative importance. We investigate the system constraints and propose an optimization formulation to compute the optimal parameters of the proposed system for the given source significance information. An upper bound to the significance-weighted bit error rate in the proposed system is derived as a function of system parameters, including the code rate and geometry of the constellation. An example is given with design rules for H.264 video communications and 3.5-4 dB PSNR improvement over existing RCPC based techniques for AWGN wireless channels is shown through simulations.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.88-96
• /
• 2010

We propose the efficient channel coding method combined with a 2.4kbps speech coder. The code rate of a channel coder is given by 1/2 and 1/2 rate convolutional coder is obtained from the punctured convolutional coder with rate of 1/3. The punctured convolutional coder is used for a variable rate allocation. The puncturing method according to the importance of the output data of the source encoder is applied for the convolutional coder. The importance of output data is analyzed by evaluating the bit error sensitivity of speech parameter bits. The performance of proposed coder is analyzed and simulated in Rayleigh fading channel and AWGN channel. The experimental results with 2.4kbps EHSX coder show that the variable rate channel coding method is superior to non-variable channel coding method from the subjective speech quality.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.649-652
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,2D2) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of $10^{-3}$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.17-22
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,202) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of 10/sup -3/.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.492-501
• /
• 2004

The performance of mobile communication systems depends on the state of the time-varying multi-path fading channel. To effectively prevent the corruption of video stream and its propagation in spatial and temporal domain, proactive error controls are widely being deployed. Among possible candidates, the rate compatible punctured convolutional (RCPC) code has been widely used for multimedia data, since its rate can be determined flexibly. In this paper, the adaptive channel estimation and the adaptive error correction techniques over the time-varying mobile channel have been proposed. Extensive computer simulations show that the proposed techniques yield the superior performance than the fixed rate system.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.19-22
• /
• 1998

In this study, the efficient channel coding method combined with CS-ACELP is proposed. The same convolutional coder and Viterbi decoder of COMA mobile communication system is used as channel coder. To make the best available use of limited channel coding redundancy, unequal error protection of punctured convolutional coder is used for variable reate allocation. But, the overall code rate is given by 2. The performance of proposed coder is analyzed and simulated in a Rayleigh fading channel. Experimental results show that the objective and subjective speech quality of variable rate channel coding methods are superior to those of non-variable channel coding method.