• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.285-286
• /
• 2006

H.264 provide good coding efficiency compared with existing video coding standards as H.263, MPEG-4, etc. However, H.264 require the increase of encoder complexity. In this paper, fast mode decision algorithm by skipping variable block size motion estimation and spatial-predictive coding, which occupies most encoder complexity, is proposed. Experimental results show that the proposed approach can save encoding time to 55% compared with the H.264 standard.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.3
• /
• pp.40-50
• /
• 2012

In this paper we propose the fast CU (Coding Unit) mode decision method. To reduce computational complexity and save encoding time of HEVC, we divided CU, PU (Prediction Unit) and TU (Transform Unit) decision process into two stages. In the first stage, because $2N{\times}2N$ PU mode is mostly selected among $2N{\times}2N$, $N{\times}2N$, $2N{\times}N$, $N{\times}N$ PU modes, proposed algorithm uses only $2N{\times}2N$ PU mode deciding depth of each CU in the LCU (Largest CU). And then, proposed method decides exact PU and TU modes at the depth level which is decided in the first stage. In addition, early skip decision rule is applied to the proposed method to obtain more efficient computational complexity reduction. The proposed method reduces computational complexity of the HEVC encoder by simplifying a CU depth decision method. We could obtain about 50% computational complexity reduction in comparison with HM 3.3 HEVC reference software while bitrate compressed by the proposed algorithm increases only 2%.

• Journal of Broadcast Engineering
• /
• v.20 no.1
• /
• pp.171-182
• /
• 2015

HEVC can increase the coding efficiency significantly compared with H.264/AVC however it requires much larger computational complexities in both encoder and decoder. In this paper, the decision process of inter-prediction modes in the HEVC reference software has been studied and a fast algorithm to reduce the computational complexity of encoder and decoder is introduced. The proposed scheme introduces a early decision criteria using the outputs of uni-directional predictions to skip the bi-directional prediction estimation. From the experimental results, it was proven that the proposed method can reduce the encoding complexity by 12.0%, 14.6% and 17.2% with 0.6%, 1.0% and 1.5% of coding efficiency penalty, respectively. In addition, the ratio of bi-directional prediction mode was reduced by 6.3%, 11.8% and 16.6% at the same level of coding efficiency penalty, respectively, which should lead to the decoder complexity reduction. Finally, the effects of the proposed scheme are maintained regardless of the use of the early skip decision algorithm which is implemented in the HEVC reference software.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.588-594
• /
• 2021

SIMON, a lightweight block cipher developed by the US National Security Agency, is a family of block ciphers optimized for hardware implementation. It supports many kinds of standards to operate in various environments. The counter mode of operation is one of the operational modes. It provides to encrypt plaintext which is longer than the original size. The counter mode uses a constant(Nonce) and Counter value as an input value. Since Nonce is the identical for all blocks, so it always has same result when operates with other constant values. With this feature, it is possible to skip some instructions of round function by pre-computation. In general, the input value of SIMON is affected by the counter. However in an 8-bit environment, it is calculated in 8-bit units, so there is a part that can be pre-computed. In this paper, we focus the part that can be pre-calculated, and compare with previous works.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.110-113
• /
• 2012

We propose a very-low-complexity lattice-reduction (LR) algorithm for multi-input multi-output detection in time-varying channels. The proposed scheme reduces the complexity by performing LR in a block-wise manner. The proposed scheme takes advantage of the temporal correlation of the channel matrices in a block and its impact on the lattice transformation matrices during the LR process. From this, the proposed scheme can skip a number of redundant LR processes for consecutive channel matrices and performs a single LR in a block. As the Doppler frequency decreases, the complexity reduction efficiency becomes more significant.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.86-89
• /
• 2008

본 논문에서는 H.264/AVC 비디오의 고속 부호화를 구현 하기 위하여 인터 프레임 상에서 움직임 벡터의 상관관계를 이용한 빠른 인트라 모드 스킵 알고리즘을 보인다. 제안한 인트라 모드 스킵은 이웃 블록 사이의 움직임 벡터간의 상관관계와 이전 프레임의 매크로블록(Macroblock)의 모드를 이용하여 인트라 예측을 생략함으로써 계산량을 줄이는 방법이다. 새로운 물체가 나타나거나 복잡한 움직임을 보이는 매크로블록들이 인트라 모드로 결정될 확률이 높기 때문에, 주변블록의 분산을 이용하여 임계값을 계산하고, 현재 매크로블록의 분산값과 비교하여 조건에 맞는 매크로블록에 대해 인트라 예측을 생략한다. 또한 시간적 상관관계가 높은 이전 프레임의 같은 위치의 매크로블록의 모드가 인트라 모드로 선택 되었을 경우, 인트라 예측을 실행한다. 제안한 방법으로 실험하였을 때, 기존의 논문과 비교하여 부호화 시간이 평균 26.02% 정도 감소하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.41-47
• /
• 2016

High efficiency video coding (HEVC) employs a coding tree unit (CTU) to improve the coding efficiency. A CTU consists of coding units (CU), prediction units (PU), and transform units (TU). All possible block partitions should be performed on each depth level to obtain the best combination of CUs, PUs, and TUs. To reduce the complexity of block partitioning process, this paper proposes the PU mode skip algorithm with region of interest (RoI) selection using motion vector. In addition, this paper presents the CU depth level skip algorithm using the co-located block information in the previously encoded frames. First, the RoI selection algorithm distinguishes between dynamic CTUs and static CTUs and then, asymmetric motion partitioning (AMP) blocks are skipped in the static CTUs. Second, the depth level skip algorithm predicts the most probable target depth level from average depth in one CTU. The experimental results show that the proposed fast CU decision algorithm can reduce the total encoding time up to 44.8% compared to the HEVC test model (HM) 14.0 reference software encoder. Moreover, the proposed algorithm shows only 2.5% Bjontegaard delta bit rate (BDBR) loss.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.343-345
• /
• 2010

H.264/AVC는 율-왜곡 계산에 기반한 화면 내 예측과 화면 간 예측을 통하여 높은 압축효율을 나타낸다. 그러나 모든 예측 모드의 율-왜곡 값을 계산하여 하나의 최적의 모드를 구하는 기존의 방법은 높은 계산량을 가지며 부호화에 걸리는 시간을 현저히 증가시킨다. 이러한 높은 계산량을 갖는 모든 예측모드의 율-왜곡 계산을 보완하기 위하여, 본 논문에서는 매크로블록의 움직임 특성 을 고려한 고속 부호화 모드 결정 방법을 제안한다. 각각의 매크로블록을 부호화하기 위해 미리 계산되는 SKIP모드에 대한 율-왜곡 값을 바탕으로 두 가지 문턱 값을 사용하여 움직임의 특성을 판단한다. 움직임의 특성에 따라 매크로블록은 3가지 분류로 나뉘게 되며, 각 분류에 따라 경쟁 모드를 적응적으로 선별하여 최적의 모드를 선택한다. 이러한 움직임 특성을 고려한 선택적 부호화 모드 결정을 통하여 부호화 효율의 큰 손실 없이 계산량을 감소시킴으로서 H.264/AVC의 고속 부호화가 가능한 x.264 대비 MMX를 사용하였을 때 16%, MMX를 사용하지 않았을 때 22%의 속도향상을 가져왔다.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.77-82
• /
• 2005

We propose a highly Integrated motion estimation processor (MEP) for efficient video compression in an SoC platform. When compressing video by the standards like MPEG-4 and H.263, the macroblock related functions motion compensation. mode decision, motion vector prediction, and motion vector difference calculation require the frequent intervention of MCU. Thus the proposed MEP incorporates those functions with the motion estimation capability to reduce the number of interrupts to MCU, which can lead to a highly efficient SoC system. For low-power consumption, the proposed MEP can prevent the temporally static area from motion estimation or can skip the half-pel motion estimation for those macroblocks whose modes are decided as INTRA.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.640-655
• /
• 2014

Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.