• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.144-154
• /
• 2011

In this paper, we propose a parallel LDPCA encoding method for fast transform-domain Wyner-Ziv video encoding which is suitable in an ultra fast and low power video encoding. The conventional transform-domain Wyner-Ziv video encoding performs LDPCA channel coding of quantized transform coefficients in bitplane-serial fashion, which takes about 60% of total encoding time, and this computational complexity becomes severer as the bitrate increases. The proposed method binds several bitplanes into one packed message and carries out the LDPCA encoding in parallel. The proposed LDPCA encoding method improves the encoding speed by 8 ~ 55 times. In the experiment, the proposed Wyner-Ziv encoder can encode 700 ~ 2,300 QCIF size frames per second with GOP=64. The method can be applied to the pixel-domain Wyner-Ziv encoder using LDPCA, and has a wide scope of application.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.2015-2020
• /
• 2008

Real-time communication network is important for KTX high speed train system because small problem can make a huge accident. Communication network for KTX high speed train system consists of IEEE 802.4 token bus network and FM0 encoding. The network device is developed by using MC68824 TBC, MC68185 TPM and MC68020 MPU. The network device make available to analysis of the network protocol among vehicles for Kyung-Boo high-speed train system.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.47-50
• /
• 2000

Recently many efforts on the development of automatic processing system for delivery sequence sorting have been performed in ETRI , which requires the use of postal 4-state bar code system to encode delivery points. The 4-state bar code called postal 4-state bar code for high speed processing that has been specifically designed for information processing of logistics and automatic processing of the mail items. This paper describes a method of Reed-Solomon encoding for creating error correction codeword of 4-state bar code.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.79-86
• /
• 1996

In this paper we propose an architecture for VLC(Variable Length Coder) and VLD(Variable Length Decoder) which is simple with respect to implementation point and efficient in memory. We implemented encoding and decoding circuit where we need only 7-bit address memory space for 114 MPEG1 DCT coefficients and employed minimal number of flip-flops and logics for an architecture to integrate a shift register for serial-to-parallel or parallel-to-serial conversion of the data in code mapping ROM. We obtained 50Mbps operating speed in both encoding and decoding process as the result of simulation using 0.80.8${\mu}m$ CMOS standard cells.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.392-394
• /
• 1999

PSTN(Public Switch Telephone Network)에서 동영상을 전송하기 위해 H.263이라는 표준이 발표되었다. 저속의 전송률을 가지는 PSTN을 이용해서 영상회의나 영상전화 등을 구현하기 위해서는 기존의 코딩방식으로는 데이터를 전송하는데 문제점이 많았다. 이를 위해서 개발된 것이 H.263이다. H.263은 H.261에 기반을 두고 있으며 .261에 비해서 동일화질을 제공하는데 반정도의 데이터 양으로도 가능하게 해준다. 영상 압축 Encoder는 일반적으로 Decoder에 비하여 영상을 처리하는데 많은 시간이 소요된다. 그러나 VOD등과 같은 실시간으로 압축할 필요가 없는 경우에 대해서는 인코더가 많은 시간을 소비하더라고 큰 문제가 없는 반면에, 영상 회의나 영상 전화 등은 실시간 영상 Encoding, Decoding을 수행해야 한다. 그러기 위해서 고가의 하드웨어를 사용하게 된다. 이와 같은 이유에서 본 연구에서는 H.263을 소프트웨어만으로 Encoding 속도향상을 꾀하고자 하는 것이 이 논문의 목표이다.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.641-644
• /
• 2011

In this letter, we propose a novel bitrate control, using both Kalman and FIR filters, based on a Hamiltonian analysis with respect to the amount of bits from each macroblock, in an encoding of a general video codec such as H.264/AVC. Since the proposed bitrate control is based on the simple computation of an optimal control method based on the Hamiltonian analysis, it is not necessary to use additional computation, such as a DCT or quantization, to estimate the bits for bitrate control. As a result, the proposed algorithm can be applied to single-pass encoding and can provide sufficient encoding speed with respect to various applications, even those requiring real-time control.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.175-177
• /
• 2018

This paper proposes an algorithm to speed up block structure partition of quad tree plus binary tree (QTBT) in Joint Exploration Test Model (JEM) encoder. The proposed fast encoding of QTBT block partition employs three spatially neighbor coded blocks, such as left, top-left, and top of current block, to early terminate QTBT block structure pruning. The propose algorithm is organized based on statistical similarity of those spatially neighboring blocks, such as block depths and coded block types, which are coded with overlapped block motion compensation (OBMC) and adaptive multi transform (AMT). The experimental results demonstrate about 30% encoding time reduction with 1.3% BD-rate loss on average compared to the anchor JEM-7.1 software under random access configuration.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.519-528
• /
• 2016

In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2355-2364
• /
• 1998

In conventional fractal decoding procedure, the reconstructed image is obtained by a rpredefined number of iterations starting with an arbitrary initial image. Its convergence speed depends on the selection of the initial image. It should be solved to get high speed convergence. In this paper, we theoretically reveal that conventional method is approximately decomposed into the decoding of the DC and AC components. Based on this fact, we proposed a novel fast fractal decoding algorithm made up of two steps. The averaged-image considered as an optimal initial image is estimated in the first step. In the second step, the reconstructe dimag eis genrated from the output image obtained in the first step. From the simulations, it is shown that the output image of the first step approximately converges to the averaged-image with only 15% calculations for one iteration of conventional method. And the proposed method is faster than various decoding mehtods and evenly equal to conventioanl decoding with the averaged-image. In addition, the proposed method can be applied to the compressed data resulted from the various encoding methods because it does not impose any constraints in the encoding procedure to get high decoding speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.