• Journal of Broadcast Engineering
• /
• v.17 no.1
• /
• pp.122-128
• /
• 2012

Because of the system delay caused by the number of feedback retransmission in Distributed Video Coding (DVC) scheme, it is difficult to realize practical DVC in many cases. In this paper low feedback retransmission Distributed Source Coding (DSC) scheme is proposed for practical DVC scheme based on Low-Density Parity-Check (LDPC) codes because DVC system is an specific application of DSC system. This DSC scheme is achieved by using different LDPC codes optimized in each different compression rate and using source revealing scheme. Optimized LDPC codes provide us much better decoding performance which causes the 57% reduced number of iteration. Consequently, the number of feedback retransmission is decreased by 50%.

• Honam Mathematical Journal
• /
• v.30 no.1
• /
• pp.33-45
• /
• 2008

Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, we obtain a sufficient condition over the number of parity check digits for codes correcting random errors and simultaneously detecting burst errors with Lee weight consideration.

• Communications of Mathematical Education
• /
• v.6
• /
• pp.371-381
• /
• 1997

Let p be an odd prime number. We introduce simple and useful decoding algorithm for orthogonal Latin square codes of order p. Let H be the parity check matrix of orthogonal Latin square code. For any x ${\in}$ GF(p)$^{n}$, we call xH$^{T}$ the syndrome of x. This method is based on the syndrome decoding for linear codes. In L$_{p}$, we need to find the first and the second coordinates of codeword in order to correct the errored received vector.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.335-338
• /
• 2002

For high data rate transmission over wireless fading channels, space-time trellis ceding techniques can be employed to increase the Information capacity of the communication system dramatically. In this paper, we consider the concatenated space time LDPC (Low Density Parity Check) codes. Extra ceding gains In addition to the diversity advantage is shown to be achieved for certain space-time trellis codes transmitted over quasi-static lading channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.942-949
• /
• 2007

In this paper, we propose a new rate-control scheme, called splining, to construct low-rate codes from high-rate codes by splitting rows of the parity-check matrices of LDPC codes, which can construct rate-compatible LDPC codes having good initial transmission performance. Good low-rate codes can be constructed by making the number of distinct check node degrees as small as possible after splitting. The proposed scheme achieves good cycle property, low decoding complexity, and fast convergence speed, especially compared to the puncturing. Especially, rate-compatible repeat accumulate-type LDPC (RA-Type LDPC) code is constructed using splitting, which covers the code rates from 1/3 to 4/5. Through simulation it is shown that this code outperforms other rate-compatible RA-Type LDPC codes for all rates and can be decoded conveniently and efficiently.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1149-1154
• /
• 2013

In this paper, an algorithm having new edge growth with depth constraints for constructing Tanner graph of LDPC(Low density parity check) codes is proposed. This algorithm reduces effectively the number of small stoping set in the graph and has lower complexity than other algorithm. The simulation results shows the improved performance of the LDPC codes constructed by this algorithm.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.432-436
• /
• 2004

In this paper, we propose the modified uniformly most powerful (UMP) belief-propagation (BP)-based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP-based algorithm. This modified UMP BP-based algorithm shows better performance than that of the normalized UMP BP-based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP-based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP-based algorithm.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.1
• /
• pp.76-84
• /
• 2007

The goal of this paper is to improve the watermarking performance using the following two methods; watermark estimation and low density parity check (LDPC) codes. For a blind watermark decoding, the power of a host image, which is hundreds times greater than the watermark power, is the main noise source. Therefore, a technique that can reduce the effect of the power of the host image to the detector is required. To this end, we need to estimate watermark from the watermarked image. In this paper, the watermark estimation is done by an adaptive estimation method with the generalized Gaussian distribution modeling of sub-band coefficients in the wavelet domain. Since the watermark capacity as well as the error rate can be improved by adopting optimum decoding principles and error correcting codes (ECC), we employ the LDPC codes for the decoding of the estimated watermark. Also, in LDPC codes, the knowledge about the noise power can improve the error correction capability. Simulation results demonstrate the superior performance of the proposed algorithm comparing to LDPC decoding with other estimation-based watermarking algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.611-617
• /
• 2010

In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.