• Title/Summary/Keyword: coding efficiency

Search Result 1,018, Processing Time 0.024 seconds

Composition Rule of Character Codes to efficiently transmit the Character Code in HDLC(High-level Data Link Control) Protocol (HDLC(High-level Data Link Control) 프로토콜에서 효율적 문자부호 전송을 위한 문자부호화 규칙)

  • Hong, Wan-Pyo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.753-760
    • /
    • 2012
  • This paper is to show the character coding rule in computer and information equipment etc to improve the transmission efficiency in telecommunications. In the transmission system, the transmission efficiency can be increased by applying the proper character coding method. In datalink layer, HDSL ptotocol use FLAG byte to identify the frame to frame which consists of data bit stream and other control bytes. FLAG byte constits of "01111110". When data bit stream consist of the consecutive 5-bit "1" after "0", the decoder can not distinguish whether the data bit sequence is flag bit stream or data bit stream. To solve the problem, when the line coder in transmitter detects the consecutive 5-bits "1" after "0" in the input data stream, inserts violently the "0" after 5th "1" of the consecutive 5-bit "1" after "0". As a result, when the characters are decoded with the above procedure, the efficiency of system should be decreased. This paper shows the character code rule to minimize the consecutive 5-bits "1" after "0" when the code is given to each characters.

Multi-code Biorthogonal Code Keying with Constant Amplitude Coding Combined with $Q^{2}PSK$ to Increase Bandwidth Efficiency (정 진폭 부호화된 Multi-code Biorthogonal Code Keying시스템에서 대역폭 효율 개선을 위해 $Q^{2}PSK$를 이용하는 방안)

  • Kim Sung-Pil;Kim Myoung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.484-492
    • /
    • 2006
  • A multi-code biorthogonal code keying(MBCK) system consists of multiple waveform coding block, and the sum of output codewords is transmitted. Drawback of MBCK is that it requires amplifier with high linearity because its output symbol is multi-level. MBCK with constant amplitude preceding blcok(CA-MBCK) has been proposed, which guarantees sum of orthogonal codes to have constant amplitude. Redundant bits of CA-MBCK for constant amplitude coding are not only used to make constant amplitude signal but also used to improve the bit error rate(BER) performance at receiver. In this paper, we proposed a transmission scheme which combine CA-MBCK with $Q^{2}PSK$ to improve bandwidth efficiency of CA-MBCK. The BER performance of the scheme is same that of CA-MBCK in additive white gaussian noise(AWGN). And we showed that BER performance of the proposed system can be improved using redundant bits of constant amplitude preceding.

New Video Compression Method based on Low-complexity Interpolation Filter-bank (저 복잡도 보간 필터 뱅크 기반의 새로운 비디오 압축 방법)

  • Nam, Jung-Hak;Jo, Hyun-Ho;Sim, Dong-Gyu;Choi, Byeong-Doo;Cho, Dae-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.5
    • /
    • pp.165-174
    • /
    • 2010
  • The H.264/AVC standard obtained better performance than previous compression standards, but it also increased the computational complexity of CODEC simultaneously. Various techniques recently included at the KTA software developed by VCEG also were increasing its complexity. Especially adaptive interpolation filter has more complexity than two times due to development for coding efficiency. In this paper, we propose low-complexity filter bank to improve speed up of decoding and coding gain. We consists of filter bank of a fixed-simple filter for low-complexity and adaptive interpolation filter for high coding efficiency. Then we compensated using optimal filter at each macroblock-level or frame-level. Experimental results shows a similar coding efficiency compared to existing adaptive interpolation filter and decoding speed of approximately 12% of the entire decoder gained.

Complexity Reduction of HEVC SAO Intra Modes By Adjustment of Offset Values (HEVC SAO 인트라 모드 오프셋 값 조정을 통한 복잡도 감소)

  • Mun, Ji-Hun;Choi, Jung-Ah;Ho, Yo-Sung
    • Journal of Broadcast Engineering
    • /
    • v.19 no.3
    • /
    • pp.355-361
    • /
    • 2014
  • In this paper, we propose a complexity reduction method of sample adaptive offset (SAO), which is an in-loop filter in high-efficiency video coding (HEVC). In the conventional SAO, an offset value is calculated for each coding tree block (CTB) to minimize the error between the original and reconstructed images. In order to determine the optimal offset value, all offset candidates are examined and the offset value that leads to the smallest rate-distortion cost is chosen. Thus, SAO occupies a significant amount of the computational complexity in the HEVC encoder. In the proposed method, we determine the least-used band (LUB) by considering the statistical characteristics of offset values and without processing the offset value included in the LUB. Also, in the offset value decision stage, we check only a certain number of candidates rather than all of them. Experimental results show that the proposed method reduces the encoding time by approximately 8.15% without yielding a significant loss in terms of coding efficiency.

Early Decision of Transform unit for HEVC (HEVC를 위한 고속 변환 크기 결정방법)

  • Kang, Jang-Byung;Choi, Haechul
    • Journal of Broadcast Engineering
    • /
    • v.18 no.4
    • /
    • pp.631-642
    • /
    • 2013
  • For the emerging High Efficiency Video Coding (HEVC) standard, a fast transform unit (TU) decision method is proposed. HEVC defines the TU representing a region sharing the same transformation, and it allows a residual block to be split into multiple TUs recursively to form a quadtree. By using the quadtree of TUs, HEVC supports various transform sizes from $4{\times}4$ to $32{\times}32$. The various sizes of TUs can provide a good coding efficiency, whereas this may increase encoding complexity dramatically. In the assumption that a TU with highly compacted energy is unlikely to be split, the proposed method determines TU sizes according to the position of the last non-zero transform coefficient. In the experimental results, the proposed method reduced 18% encoding run time with the negligible coding loss of 0.7% BD-rate for the Random_access case.

Macroblock-based Adaptive Interpolation Filter Method for Improving Coding Efficiency in H.264/AVC (H.264/AVC에서 부호화 효율 개선을 위한 매크로 블록 기반 적응 보간 필터 방법)

  • Yoon, Kun-Su;Kim, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.5
    • /
    • pp.73-83
    • /
    • 2007
  • In this paper, we propose macroblock(MB)-based adaptive interpolation filter method for improving coding efficiency in H.264/AVC. In the proposed method, nine separable two-dimensional(2D) interpolation filters are applied for precisely compensating motions in various directions. The optimal cost function which considers the bit rate and distortion for coding the MB is defined. The filter is adaptively selected per MB for minimizing the defined cost function. In the experimental results, the proposed method shows more excellent in coding efficiency than the conventional methods for the various standard $QCIF(176{\times}144)/CIF(352{\times}288)$ video test sequences. It leads to about 6.25%(1 reference frame) and 3.46%(5 reference frames) bit rate reduction on average compared to the H.264/AVC.

An SNR Scalable Video Coding using Linearly Combined Motion Vectors

  • Ryu, Chang-Hoon;Byoungjun Han;Park, Kwang-Pyo;Yoon, Eung-Sik;Lee, Keun-Young
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.50-53
    • /
    • 2002
  • There are increasing needs to deliver the multimedia streaming over heterogeneous networks. When considering network environments and equipment accessed by user, delivery of video streaming must be scalable. There are many kinds of scalable video coding: spatial, temporal, SNR, and hybrid. The SNR scalable and spatial resolution, but different SNR quality with respect to layers. The 1-layer SNR scalable encoder produces SNR scalable video streams with ease. But, there is drift problem. Modified 1-layer approach does not have this problem but coding inefficiency, and is not MPEG-compliant. The present MPEG-compliant 2-layer encoder comes out to reduce coding rate. But it still use only base layer to encode whole layer. In this paper, we propose adaptive MPEG-compliant 2-layer encoder. Using linear combination algorithm, encoder use 1 motion vector to encode the sequences efficiently. By dong this, we can achieve the coding efficiency of SNR scalable coding.

  • PDF

Block Truncation Coding using Reduction Method of Chrominance Data for Color Image Compression (색차 데이터 축소 기법을 사용한 BTC (Block Truncation Coding) 컬러 이미지 압축)

  • Cho, Moon-Ki;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.3
    • /
    • pp.30-36
    • /
    • 2012
  • block truncation coding(BTC) image compression is known as a simple and efficient technology for image compression algorithm. In this paper, we propose RMC-BTC algorithm(RMC : reduction method chrominace data) for color image compression. To compress chrominace data, in every BTC block, the RMC-BTC coding employs chrominace data expressed with average of chrominace data and using method of luminance data bit-map to represented chrominance data bit-map. Experimental results shows efficiency of proposed algorithm, as compared with PSNR and compression ratio of the conventional BTC method.

An Efficient DPB Design Scheme for Scalable Multi-view Video Coding Using GPB Mechanism (GPB 메카니즘을 활용한 스케일러블 다시점 비디오 부호화를 위한 효율적인 DPB 설계 기법)

  • Junga, Tae-jun;Ko, Myung Pil;Seo, Kwang-deok
    • Journal of Broadcast Engineering
    • /
    • v.20 no.6
    • /
    • pp.921-927
    • /
    • 2015
  • In this paper, we propose a novel design scheme for the operation of Decoded Picture Buffer (DPB) including reference picture re-ordering, marking process, and reference picture list construction to perform an efficient scalable multi-view video coding. Extensive simulations show that the proposed method can provide improved compression efficiency and improved video quality measured in terms of BD-Rate and BD-PSNR for the scalable multi-view video coding.

IMPROVEMENT OF I-PICTURE CODING USING INTER-PICTURE PROCESSING

  • Arizumi, Masao;Sagara, Naoya;Sugiyama, Kenji
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.618-622
    • /
    • 2009
  • An improvement of standard encoder has been saturated recently. However, new coding method does not have a compatibility with conventional standard. To solve this problem, new concept coding method that has a semicompatibility with standard may be discussed. On the other hand, cyclic Intra-picture coding is used for access and refreshment. However, I-picture spend large amount of bits. An enhancement of I-picture is desired with keeping its refreshment performance. Further, it's a problem that quality change at the border of GOP because of its independency. To respond these, we propose the coding which is applied an inter-frame processing at the border of GOP. Applied method is the reduction of quantization error using the motion compensated inter-picture processing. In this report, we check the improvement of the efficiency and the compatibility of proposed method. As a result of examination, we recognize that the total gain is maximally 1.2dB in PSNR. Generally, the degradation of performance in standard decoding is smaller than its gain. Also the refreshment performance is tested.

  • PDF