• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3749-3768
• /
• 2018

As one of the most potential types of low-density parity-check (LDPC) codes, CPM-QC-LDPC code has considerable advantages but there still exist some limitations in practical application, for example, the existing decoding algorithm has a low convergence rate and a high decoding complexity. According to the structural property of this code, we propose a new method based on a CPM-RID decoding algorithm that decodes block-by-block with weights, which are obtained by neural network training. From the simulation results, we can conclude that our proposed method not only improves the bit error rate and frame error rate performance but also increases the convergence rate, when compared with the original CPM-RID decoding algorithm and scaled MSA algorithm.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.4
• /
• pp.757-764
• /
• 2009

In discriminant analysis, we consider a special pattern which contains a block of missing observations. We assume that the two populations are equally likely and the costs of misclassification are equal. In this situation, we consider the bootstrap confidence intervals of the error rate in the circular models when the covariance matrices are equal and not equal.

• Communications for Statistical Applications and Methods
• /
• v.16 no.4
• /
• pp.675-686
• /
• 2009

In this paper, it will be assumed that there are two distinct populations which are multivariate normal with equal covariance matrix. We also assume that the two populations are equally likely and the costs of misclassification are equal. The classification rule depends on the situation when the training samples include missing values or not. We consider the bootstrap confidence intervals for classification error rate when a block of observation is missing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2411-2429
• /
• 2013

In this paper, we extend the case of information exchange error mitigation for the distributed orthogonal space-time block code (DOSTBC) for two transmit antennas to distributed quasi-orthogonal space-time block code (DQOSTBC) for four transmit antennas. A rate 1 full-diversity DQOSTBC for four transmit antennas is designed. The code matrix changes according to different information exchange error cases, so full diversity is maintained even if not all information exchange is correct. We also perform analysis of the pairwise error probability. The performance analysis indicates that the proposed rate 1 DQOSTBC outperforms rate 1/2 DOSTBC for four transmit antennas at the same transmission rate, which is confirmed by the simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1384-1392
• /
• 1999

A high compression rate is required to transmit video sequences over low bit rate networks such as low bit rate communication channels. When highly compressed videos are transmitted over mobile channels of high error rate, bitstreams corrupted by channel errors are not only difficult to be decoded, but also have fatal effects on the other parts of the bitstreams. In this Paper, we propose an error concealment algorithm for recovering the blocks which can not be decoded due to damaged bitstreams. The proposed error concealment algorithm recovers the damaged blocks using the information of adjacent blocks which are correctly decoded. In the proposed algorithm, the motion vector of the damaged block is estimated using the overlapped block motion compensation(OBMC) and block boundary matching(BBM) techniques. Experiment results show that the proposed algorithm exhibits better performance in PSNR than existing error concealment methods.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.927-928
• /
• 2008

In this paper, a interpolation error concealment algorithm of motion compensated interpolated frame for motion compensated frame rate conversion to reduce the block artifacts caused by failure of conventional motion estimation based on block matching algorithm is proposed. Experimental results show good performance of the proposed scheme with significant reduction of the block artifacts.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.189-200
• /
• 2013

In this paper, it will be assumed that there are two distinct populations which are multivariate normal with equal covariance matrix. We also assume that the two populations are equally likely and the costs of misclassification are equal. The classification rule depends on the situation whether the training samples include missing values or not. We consider the conditional bootstrap confidence intervals for classification error rate when a block of observation is missing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.210-216
• /
• 2000

The features of bit error rate (BER) are discussed, how to analyze statistics of the bit error rate. How many will the BER be improved after correcting one single-error in the block\ulcorner The answer is satisfactory in this paper.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.73-76
• /
• 2000

In the basic continuous ARQ schemes (Go-Back-N or Selective Repeat ARQ), each block is continuously transmitted without interruptions. Only when the transmitter receives NAK from the receiver side, the transmitter stops sending current data block and retransmit the erroneous block (Naked block). When channel error rate increases and become sufficiently high, there exists a point at which each block of message is transmitted, on average, more than once. Under such conditions, it will be more efficient to send continuously two or more copies(generally $\ell$ copies) of each block from the first transmission over noisy channel. A request for repeat will be made again only when none of $\ell$ duplicates are received correctly. By this way, the proposed scheme yields a better throughput efficiency and holds nearly constant throughput as compared to others continuous A.R.Q schemes under wide error rate variations (0 < P < 0.3).

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.138-145
• /
• 1997

This paper proposes an adaptive algorithm for the quantization step size control of MPEG-2, using the information obtained from the previously encoded picture. Before quantizing the DCT coefficients, the properties of reconstruction error of each macro block (MB) is predicted from the previous frame. For the prediction of the error of current MB, a block with the size of MB in the previous frame are chosen by use of the motion vector. Since the original and reconstructed images of the previous frame are available in the encoder, we can calculate the reconstruction error of this block. This error is considered as the expected error of the current MB if it is quantized with the same step size and bit rate. Comparing the error of the MB with the average of overall MBs, if it is larger than the average, small step size is given for this MB, and vice versa. As a result, the error distribution of the MB is more concentrated to the average, giving low variance and improved image quality. Especially for the low bit application, the proposed algorithm gives much smaller error variance and higher PSNR compared to TM5 (test model 5).