• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.280-283
• /
• 2009

To improve coding performance of scalable video coding which is an emerging video coding standard as an extension of H.264/AVC, SVC uses not only intra prediction and inter prediction but inter-layer prediction. This causes a problem that computational complexity is increased. In this paper, we propose an efficient intra prediction mode decision method in spatial enhancement layer to reduce the computational complexity. The proposed method selects Inra_BL mode using RD cost of Intra_BL in advance. After that, intra mode is decided by only comparing DC modes. Experimental results show that the proposed method reduces 59% of the computation complexity of intra prediction coding, while the degradation in video quality is negligible.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.880-887
• /
• 2015

In this paper, frame rate up conversion (FRUC) algorithm considering the direction and magnitude of identical motion vectors is proposed. extended bilateral motion estimation (EBME) has higher complexity than bilateral motion estimation (BME). By using average magnitude of motion vector with x and y direction respectively, dynamic frame and static frame are decided. We reduce complexity to decide EBME. also, After we compare the direction and magnitude of identical motion vectors, We reduce complexity to decide motion vector smoothing(MVS). Experimental results show that this proposed algorithm has fast computation and better peak singnal to noise ratio(PSNR) results compared with EBME.

• Journal of Broadcast Engineering
• /
• v.26 no.5
• /
• pp.652-655
• /
• 2021

Among various inter prediction techniques of Versatile Video Coding (VVC), adaptive motion vector resolution (AMVR) technology has been adopted. However, for AMVR, various MVs should be tested per each coding unit, which needs a computation of rate-distortion cost and results in an increase in encoding complexity. Therefore, in order to reduce the encoding complexity of AMVR, it is necessary to effectively find an optimal AMVR mode. In this paper, we propose a lightweight neural network-based AMVR decision algorithm based on more diverse datasets.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.1
• /
• pp.9-16
• /
• 2011

In this paper, we propose an efficience transcoder architecture to support a simutaneous multibitrate output. First, we discuss about some architectures to realize this feature. Next, we explain the proposed architecture, it shares not only VLD-IQ but alse Q-VlD which have the same quantization step sizes each other. We anlyze the numbers of Q-VLC times per on Macroblock to the investigate an effect of sharing, and evaluate its computation complexity. The result of simulation, that complexity has an upper limit and it cn support any numbers of bitstream by about 3~6 times complexity than single output.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.562-567
• /
• 2002

Noise predictive maximum likelihood(NPML) detector embeds noise predictions/ whitening process in branch metric calculation of Viterbi detector and improves the reliability of branch metric computation. Therefore, PRML detector with a noise predictor achieves some performance improvement and has an advantage of low complexity. This paper shows that NP(1221)ML system through noise predictive PR-equalized signal has less complexity and better performance than high order PR(12321)ML system in high density perpendicular magnetic recording. The simulation results are evaluated using (1) random sequence and (2) run length limited (1,7) sequence, and they are applied to linear channel and nonlinear channel with normalized linear density $1.0{\leq}K_p{\leq}3.0$.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.136-140
• /
• 2006

In this paper, we consider the detection of orthogonal space-time block codes (OSTBCs) without channel state information (CSI) at the receiver. Based on the conventional blind cyclic decoder, we propose an enhanced blind cyclic decoder which has higher system performance than the conventional one. Furthermore, the proposed decoder offers low complexity since it does not require the computation of singular value decomposition.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.672-679
• /
• 2021

We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.757-760
• /
• 1998

A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, by considering the relation between neighboring blocks, the searching area in the algorithm is adjustable according to mean absolute difference of the block. By the computer simulation the computation amount of the proposed than that of the FBMA and the good result of the PSNR can be attained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1715-1721
• /
• 1997

Wavelet transform is not applicable to arbitrarily-shaped region (or object) in images, due to the nature of its global decomposition. In this paper, the arbitrarily-shaped wavelet transform(ASWT) is proposed in order to solve this problem and its properties are investigated. Computation complexity of the ASWT is also examined and it is shown that the ASWT requires significantly fewer computations than conventional wavelet transform, since the ASWT processes only the object region in the original image. Experimental resutls show that any arbitrarily-shaped image segment can be decomposed using the ASWT and perfectly reconstructed using the inverse ASWT.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.215-218
• /
• 1998

This paper proposes a blind multi-user detector using Code-Constrained Minimum Variance (CCMV) method which directly detects the DS-CDMA signals in a multipath fading channel without estimating the channels. This algorithm reduces the complexity of computation by making a small size data matrix with the order of the channel length. Advantageously it requires to know the spreading code and the time delay of only the desired user.