• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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
• /
• 제20권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
• /
• 제16권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)
• /
• 제7권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.

• 한국통신학회논문지
• /
• 제24권7B호
• /
• pp.1384-1392
• /
• 1999

저속 이동 통신 채널과 같은 저속 통신망에서 비디오 전송을 위해서는 시스템에서 요구하는 비디오 전송율을 보장하기 위하여 높은 압축율을 갖는 부호화 방법들이 사용된다. 이러한 부호화 방법들에 의하여 부호화된 비디오가 오류율이 높은 이동 채널로 전송될 때, 비트열에 오류가 발생하면 복호되기 어려울 뿐 아니라 비트열의 다른 부분에도 치명적인 영향을 미치게 된다. 본 논문에서는 비디오 전송 중에 비트열이 손상되어 복호가 불가능한 블록을 복구하기 위한 오류 은폐 알고리듬을 제안한다. 제안하는 오류 은폐 알고리듬은 정상적으로 복호된 주변 블록들의 정보를 이용하여 손실된 블록을 복구한다. 즉, 공간적으로 이웃하는 블록과 손실된 블록간에는 높은 움직임 벡터의 상관성이 있다는 성질을 바탕으로, 중복 블록 움직임 보상(overlapped block motion compensation: OBMC)과 블록 경계 정합(block boundary matching : BBM)을 통하여 손상된 블록의 움직임 벡터를 정확히 추정하는 알고리듬이다. 제안하는 알고리듬은 기존의 오류 은폐 방법들에 비하여 복구된 영상의 PSNR과 시각적인 면에서 우수한 성능을 보임을 실험을 통하여 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• 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
• /
• 제24권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 춘계종합학술대회
• /
• pp.210-216
• /
• 2000

bit error 확률의 특징과 bit error의 통계를 어떻게 분석할 것인가를 다루었다. Block에서 one single-error를 보정한 후 bit error 확률 이 얼마나 개선될 수 있을 것인가\ulcorner 본 논문에서 이에 대한 해답을 만족시킬 것이다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• 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
• /
• 제2권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).