• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.397-403
• /
• 2014

A new video compression standard called High Efficiency Video Coding (HEVC) has recently been released onto the market. HEVC provides higher coding performance compared to previous standards, but at the cost of a significant increase in encoding complexity, particularly in motion estimation (ME). At the same time, the computing capabilities of Graphics Processing Units (GPUs) have become more powerful. This paper proposes a parallel integer-pel ME (IME) algorithm for HEVC on GPU using the Compute Unified Device Architecture (CUDA). In the proposed IME, concurrent parallel reduction (CPR) is introduced. CPR performs several parallel reduction (PR) operations concurrently to solve two problems in conventional PR; low thread utilization and high thread synchronization latency. The proposed encoder reduces the portion of IME in the encoder to almost zero with a 2.3% increase in bitrate. In terms of IME, the proposed IME is up to 172.6 times faster than the IME in the HEVC reference model.

• Journal of Multimedia Information System
• /
• 제5권3호
• /
• pp.201-208
• /
• 2018

High Efficiency Video Coding range extensions (HEVC RExt) is a kind of extension model of HEVC. HEVC RExt was specially designed for dealing the high quality images. HEVC RExt is very essential for studio editing which handle the very high quality and various type of images. There are some problems to dealing these massive data in studio editing. One of the most important procedure is re-encoding and decoding procedure during the editing. Various codecs are widely used for studio data editing. But most of the codecs have common problems to dealing the massive data in studio editing. First, the re-encoding and decoding processes are frequently occurred during the studio data editing and it brings enormous time-consuming and video quality loss. This paper, we suggest new video coding structure for the efficient studio video editing. The coding structure which is called "ultra-low delay (ULD)". It has the very simple and low-delayed referencing structure. To simplify the referencing structure, we can minimize the number of the frames which need decoding and re-encoding process. It also prevents the quality degradation caused by the frequent re-encoding. Various fast coding algorithms are also proposed for efficient editing such as tool-level optimization, multi-serve based distributed coding and SIMD (Single instruction, multiple data) based parallel processing. It can reduce the enormous computational complexity during the editing procedure. The proposed method shows 9500 times faster coding speed with negligible loss of quality. The proposed method also shows better coding gain compare to "intra only" structure. We can confirm that the proposed method can solve the existing problems of the studio video editing efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권4호
• /
• pp.1457-1470
• /
• 2015

In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.

• 한국전자파학회지:전자파기술
• /
• 제4권1호
• /
• pp.20-27
• /
• 1993

본 논문에서는 디지탈 무선통신을 위한 전송방식으로 집합분할에 의한TCM/M-PSK와pragmatic 부호에 의한 M 진 PSK 시스댐을 실현하였다. 전송채널에 AWGN과 Rayleigh 페이딩이 존재하는 경우 시스댐의 성능을 오율 관점에서 해석하였으며, 이를 위한 오율식을 유도하여 제시하였다. 그 결과 Rayleigh 페이덩이 많은 영향을 미치는 이동무선통신에서 pragmatic 부호에 의한 방식은 부호화하지 않고 곧바로 전송되는 정보데이터에 의해 발생하는 병렬쌍때문에 시스템 전체의 성능을 저하시키게 됨을 알 수 있었다. 하지만 AWGN만 고려하는 무선통신에서 pragmatic 방식은 단일 부호기/복호기를 사용하므로 시스템이 간단해지는 장점이 있다.

• 방송공학회논문지
• /
• 제18권6호
• /
• pp.816-822
• /
• 2013

최신 동영상 압축 표준화 기술인 HEVC(High Efficiency Video Coding)는 ITU-T(VCEG)와 ISO-IEC(MPEG)에서 JCT-VC(Joint Collaborative Team on Video Coding)라는 팀을 이루어 진행했으며 표준화의 막바지에 다다르고 있다. 기존 H.264/AVC에 약 50% 이상의 성능 향상을 가져왔으나, 다양한 압축 기술을 사용함에 따라 부호화 및 복호화의 복잡도가 매우 증가하는 문제가 있다. 제안하는 방법은 CPU 병렬처리와 GPU 가속처리를 통해 HEVC의 복잡도를 줄이고, 이를 UHD(Ultra High Definition) 초고해상도 영상에 적용하는 방법으로 UHD($3840{\times}2144$) 영상에서 15fps 이상 인코딩/디코딩의 속도를 가지며, CPU와 GPU간의 데이터 전송 방법의 발전으로 추가적인 속도 향상이 기대된다.

• The Journal of the Acoustical Society of Korea
• /
• 제14권2E호
• /
• pp.50-56
• /
• 1995

본 논문은 3가지 상태의 전이 그래프를 이용해서, 병렬 컴퓨터인 MasPar에 적합한 한글에 대한 효율적인 부호화를 제시하고자 한다. 본 논문에서 제시한 PHDCM(Parallel Hangul Dynamic Coding Method)의 방법을 이용한 경우에 한글 한음절당 약 3.5비트이상의 축약이 가능함을 보였다. 그리고 기존의 방법과 비교해 볼때 1비트이상의 축약이 가능함도 보였다. 또한 약 천만자의 한글을 이용해서, 병렬 컴퓨터인 MasPar에 프로세서 64개를 이용하여 실제 실행을시켰을때의 가속도 (Speedup)은 49.314임을 보였다.

• 대한전자공학회논문지SP
• /
• 제45권5호
• /
• pp.79-86
• /
• 2008

H.264/AVC는 ITU-T와 ISO/IEC 표준화 단체에서 개발한 차세대 국제 영상압축 표준규격으로 이는 H.261, H.263, MPEG-4 등에 비해 더 좋은 압축 효율을 제공한다. 그러나 전체 인트라 모드에 대해 검색이 수행되므로 연산복잡성이 더욱 증가하는 문제와 하드웨어 자원의 낭비가 발생한다. 따라서 본 논문은 두 개의 프로세서 유닛 기반의 병렬 파이프라인 구조로 표준 모델에 비해 연산 복잡 도를 67% 감소시켰고, 부호화 순서를 병렬 파이프라인 구조에 적합하도록 변화시켜 기존 병렬구조에 비해 하드웨어 자원 낭비를 3% 감소시켰다.

• 한국음향학회지
• /
• 제14권1호
• /
• pp.40-47
• /
• 1995

본 논문은 redundancy를 제거함으로 해서 데이타의 축약을 할 수 있는 새로운 방법론 즉, 병렬 컴퓨터인 MasPar 머쉰에 적합한 새로운 데이타 구조를 제시하고자 하는데 그 주된 목적이 있다. 이것을 실제로 구현한 결과, 본 논문에 제시된 방법인 PDOCM (Parallel Dynamic Octal Compact Mapping)은 기존의 방법중 가장 효율이 좋은 것으로 나타난 Huffman 코드와 비교할때는 평균적으로 $30\%$정도, bit-mapping방법과 비교할때는 평균적으로 $40\%$ 정도의 우수성을 보였다. 그리고 10 백만개의 영문자를 이용해서 MasPar 기계에서 64개의 프로세서를 이용하여 구현시킨 결과 54.188의 가속화율을 얻으므로서 우수한 방법임을 알 수가 있었다.

• 전자공학회논문지B
• /
• 제30B권10호
• /
• pp.13-26
• /
• 1993

Motion picture algorithms are realized on the multiprocessor system presented in the Study I. For the most efficient processing of the algorithms, pipelining and geometrical parallel processing methods are employed, and processing time, communication load and efficiency of each algorithm are compared. The performance of the implemented system is compared and analysed with reference to MPEG coding algorithm. Theoretical calculations and experimental results both shows that geometrical partitioning is a more suitable parallel processing algorithm for moving picture coding having the advantage of easy algorithm modification and expansion, and the overall efficiency is higher than pipelining.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제7권4호
• /
• pp.235-240
• /
• 2007

A current-balancing segmented group-inverting transmitter is presented for multi-Gb/s single-ended parallel links. With an additional increase of 4 pins, 16-bit data is efficiently encoded to 20 pins to achieve the current balancing and eliminate the simultaneous switching noise. Since the proposed coding is a simple inversion-or-not transformation of pre-defined groups of binary data, it can be implemented with simplified logic circuits. The transmitter is designed with a $0.18{\mu}m$ CMOS technology, and simulated eye diagrams at 5Gb/s show dramatic improvements in signal integrity.