• Title/Summary/Keyword: encoding complexity

Search Result 329, Processing Time 0.025 seconds

An Efficient DCT Calculation Method Based on SAD (SAD 정보를 이용한 효율적인 DCT 계산 방식)

  • 문용호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6C
    • /
    • pp.602-608
    • /
    • 2003
  • In this paper, we propose an efficient DCT calculation method for fast video encoding. We show that the SAD obtained in the motion estimation and compensation process is decomposed into the positive and negative terms. Based on a theoretical analysis, it is shown that the DCT calculation is classified into 4 cases - DCT Skip, Reduced_DCT1 , Reduced_DCT2, and original DCT- according to the positive and negative terms. In the proposed algorithm, one of 4 cases is used for DCT in order to reduce the computational complexity. The simulation results show that the proposed algorithm achieves computational saving approximately 25.2% without image degradation and computational overhead.

Video Transmission Method for Constant Video Quality in Next-Generation Wireless Networks (차세대 이동망에서 영상 품질을 보장하기 위한 전송 방법)

  • Park, Sang-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.175-178
    • /
    • 2007
  • According to recently presented QoS architecture by 3GPP, a traffic conditioner may be deployed to provide conformance of the negotiated QoS. A real-time frame-layer rate control method which can be applied to the traffic conditioner is proposed. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. The proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder.

  • PDF

A Fast Intra-Prediction Method in HEVC Using Rate-Distortion Estimation Based on Hadamard Transform

  • Kim, Younhee;Jun, DongSan;Jung, Soon-Heung;Choi, Jin Soo;Kim, Jinwoong
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.270-280
    • /
    • 2013
  • A fast intra-prediction method is proposed for High Efficiency Video Coding (HEVC) using a fast intra-mode decision and fast coding unit (CU) size decision. HEVC supports very sophisticated intra modes and a recursive quadtree-based CU structure. To provide a high coding efficiency, the mode and CU size are selected in a rate-distortion optimized manner. This causes a high computational complexity in the encoder, and, for practical applications, the complexity should be significantly reduced. In this paper, among the many predefined modes, the intra-prediction mode is chosen without rate-distortion optimization processes, instead using the difference between the minimum and second minimum of the rate-distortion cost estimation based on the Hadamard transform. The experiment results show that the proposed method achieves a 49.04% reduction in the intra-prediction time and a 32.74% reduction in the total encoding time with a nearly similar coding performance to that of HEVC test model 2.1.

Efficient Intra Modes for Fast Intra Mode Decision of H.264/AVC (H.264/AVC의 고속 인트라 모드 결정을 위한 효과적인 인트라 모드)

  • Lee Woong-ho;Lee Jung-ho;Cho Ik-Hwan;Jeong Dong-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1144-1152
    • /
    • 2005
  • Intra prediction coding is one of the many coding-efficiency oriented tools of H.264/AVC, but it requires high computational complexity. Many fast intra coding algorithms have been proposed to reduce the computational complexity of intra prediction. While most of them have been focused on the mode decision methods themselves, we propose a fast algorithm in which new intra modes are substituted for the conventional intra modes so that the number of intra modes can be reduced. The simulation results show that the proposed method could reduce the encoding time of the overall sequence by $49\%$ without any noticeable degradation of the coding efficiency.

A Study on Inter Prediction Mode Determination using the Variance in the Motion Vectors (움직임 벡터의 변화량을 이용한 인터 예측 모드 결정에 관한 연구)

  • Kim, June;Kim, Youngseop
    • Journal of the Semiconductor & Display Technology
    • /
    • v.13 no.1
    • /
    • pp.109-112
    • /
    • 2014
  • H.264/AVC is an international video coding standard that is established in cooperation with ITU-T VCEG and ISO/IEC MPEG, which shows improved code and efficiency than the previous video standards. Motion estimation using various macroblock from 44 to 1616 among the compression techniques of H.264/AVC contributes much to high compression efficiency. Generally, in the case of small motion vector or low complexity about P slice is decided $P16{\times}16$ mode encoding method. But according to circumstances, macroblock is decided $P16{\times}16$ mode despite large motion vector. If the motion vector variance is more than threshold and final select mode is $P16{\times}16$ mode, it is switched to $P8{\times}8$ mode, so this paper shows that the storage capacity is reduced. The results of experiment show that the proposed algorithm increases the compression efficiency of the H.264/AVC algorithm to 0.4%, even reducing the time and without increasing complexity.

The MSDD Diversity Receiver Algorithm for a High Speed Burst Modem (고속 버스트 모뎀을 위한 MSDD Diversity 수신 알고리즘)

  • 김재형;이영철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.281-288
    • /
    • 2004
  • In this paper, we consider the diversity combining method for multiple symbol differential detection (MSDD) over the slow fading diversity channel. Though the performance of the optimum maximum-likelihood sequence estimator for MSDD approaches the performance of maximal-ratio combining with differential encoding, the complexity increases exponentially as the size of MSDD block is increased. This new pre-combining method can make use of the efficient MSDD algorithm that has a complexity increasing linearly with the block length or MSDD. Thus, in many wireless scenarios where it is not possible to perform coherent detection. this pre-combined diversity MSDD can be applied to obtain substantial gain compare to conventional differential detection.

Video Quality Variation Minimizing for Real-Time Low Bit Rate Video (영상품질 변화를 최소화하는 실시간 저전송률 영상코딩)

  • Park, Sang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.5
    • /
    • pp.868-874
    • /
    • 2007
  • A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for minimizing video duality variation. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize variation in distortion between frames. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce the delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better PSNR performance than the existing rate control method.

Frame Skipping Algorithm for Minimization of Video Quality Variation (영상 품질 변화를 최소화하는 프레임 생략 알고리즘)

  • Park, Sang-Hyun;Lee, Sung-Keun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.8
    • /
    • pp.1582-1588
    • /
    • 2007
  • According to recently presented QoS architecture by 3GPP, a traffic conditioner may be deployed to provide conformance of the negotiated QoS. In this paper, a real-time frame-layer rate control method which can be applied to the traffic conditioner of 3GPP is proposed. The proposed rate control method uses an efficient frame skipping algorithm method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. The proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder.

The Performance Evaluation of Multilayer VVC and SHVC (Multilayer VVC와 SHVC의 성능 평가)

  • Hong, Myungoh;Lee, Jongseok;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.26 no.2
    • /
    • pp.208-220
    • /
    • 2021
  • This paper evaluates the performance of multilayer VVC and SHVC. Multilayer VVC supports a multi-layer coding and many coding technologies have been added and extended compared to SHVC. For this reason, it is necessary to evaluate the multi-layer coding performance of VVC and the coding performance for inter-layer reference prediction. Multilayer VVC provides significant BD-rate improvement of AI 24.4%, RA 29.4%, LDB 29.4%, LDP 32.6% on average when compared to SHVC, so that it is shown that VVC can provide scalability more efficiently. On the other hand, the complexity of the encoding time increases by an average of 14 times and decoding time by an average of 1.8 times, which requires efforts to reduce the complexity.

Transcoding Algorithm for SMV and AMR Speech Coder (SMV와 AMR 음성부호화기를 위한 상호부호화 알고리즘)

  • Lee, Duck-Jong;Jeong, Gyu-Hyeok;Lee, In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.8
    • /
    • pp.427-434
    • /
    • 2008
  • In this paper, a transcoding algorithm for SMV and AMR speech coder is proposed. In the application requiring the interoperability of different networks, two speech coders must work together with the structure of cascaded connection, tandem. The tandem which is one of the simplest methods has several problems such as long delay, high complexity and the quality degradation due to twice complete encoding/decoding process. These problems can be solved by using transcoding algorithm. The proposed algorithm consists of LSP (Line Spectral Pair) conversion, pitch delay conversion, and fast fixed codebook search. The evaluation results show that the proposed algorithm achieves equivalent speech quality to that of tandem with reduced computational complexity and delay.