• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.11
• /
• pp.54-64
• /
• 2010

Reed-Solomon (RS) codes are the most widely used error correcting codes in digital communications and data storage. Recently, Sudan found algorithm of list decoder for RS codes. List decoder has larger decoding radius than conventional hard-decision decoding algorithms and return more than one candidate polynomial. But, the algorithm includes interpolation and factorization step that demand massive computations. In this paper, an efficient architecture and processing schedule are proposed. The architecture consists of R-MAC, memories, and control unit. The R-MAC computes both of RC and PU steps that are main part of the factorization algorithm. The proposed architecture can achieve higher hardware utilization efficiency (HUE) and throughput by using efficient processing schedule and memory architecture. Also, the architecture can be designed flexibly with scalability for various applications. We design and synthesize our architecture using Dongbu-Anam $0.18{\mu}m$ standard cell library and the maximum clock frequency is 330MHz.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.224-237
• /
• 2015

In this paper, we introduce the fast decoding method with the SIMD (Single Instruction Multiple Data) instructions for HEVC RExt (High Efficiency Video Coding Range Extensions). Several tools of HEVC RExt such as intra prediction, interpolation, inverse-quantization, inverse-transform, and clipping modules can be classified as the proper modules for applying the SIMD instructions. In consideration of bit-depth increasement of RExt, intra prediction, interpolation, inverse-quantization, inverse-transform, and clipping modules are accelerated by SSE (Streaming SIMD Extension) instructions. In addition, we propose effective implementations for interpolation filter, inverse-quantization, and clipping modules by utilizing a set of AVX2 (Advanced Vector eXtension 2) instructions that can use 256 bits register. The evaluation of the proposed methods were performed on the private HEVC RExt decoder developed based on HM 16.0. The experimental results show that the developed RExt decoder reduces 12% average decoding time, compared with the conventional sequential method.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.179-188
• /
• 2017

The Internet Video Coding (IVC) standard is due to be published by Moving Picture Experts Group (MPEG) for various Internet applications such as internet broadcast streaming. IVC aims at three things fundamentally: 1) forming IVC patents under a free of charge license, 2) reaching comparable compression performance to AVC/H.264 constrained Baseline Profile (cBP), and 3) maintaining computational complexity for feasible implementation of real-time encoding and decoding. MPEG experts have worked diligently on the intellectual property rights issues for IVC, and they reported that IVC already achieved the second goal (compression performance) and even showed comparable performance to even AVC/H.264 High Profile (HP). For the complexity issue, however, there has not been thorough analysis on IVC decoder. In this paper, we analyze the IVC decoder in view of the time complexity by evaluating running time. Through the experimental results, IVC is 3.6 times and 3.1 times more complex than AVC/H.264 cBP under constrained set (CS) 1 and CS2, respectively. Compared to AVC/H.264 HP, IVC is 2.8 times and 2.9 times slower in decoding time under CS1 and CS2, respectively. The most critical tool to be improved for lightweight IVC decoder is motion compensation process containing a resolution-adaptive interpolation filtering process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.510-518
• /
• 2000

A new video interpolation technique based on variable skip rate of video sequence is proposed in this paper. in the proposed technique. the determination whether a frame is skipped or not is done by the degree of motion complexity of the frame. If the motion complexity of a frame is low the frame is skipped. otherwise it is coded and transmitted. To determine the motion complexity of a frame a new technique using MEF (moving edge in frame),the set of pixels considered as moving edges in a frame. is introduced. In the course of decoding and interpolating of receiver., the motion field is segmented. For the purpose of dividing vector field morphological filtering is applied. Morphological filtering also used to smooth the boundaries between the changed and unchanged region. In the simulation results, the proposed technique shows higher quality and lower fluctuation of picture quality than the conventional techniques on conditioning of the same bit rate.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.6
• /
• pp.345-349
• /
• 2013

This paper proposes a simplified generalized residual prediction (GRP) that reduces the computational complexity of spatial scalability in scalable high efficiency video coding (SHVC). GRP is a coding tool to improve the inter prediction by adding a residual signal to the inter predictor. The residual signal was created by carrying out motion compensation (MC) of both the enhancement layer (EL) and up-sampled reference layer (RL) with the motion vector (MV) of the EL. In the MC process, interpolation of the EL and the up-sampled RL are required when the MV of the EL has sub-pel accuracy. Because the up-sampled RL has few high frequency components, interpolation of the up-sampled RL does not give significantly new information. Therefore, the proposed method reduces the computational complexity of the GRP by skipping the interpolation of the up-sampled RL. The experiment on SHVC software (SHM-2.0) showed that the proposed method reduces the decoding time by 10 % compared to conventional GRP. The BD-rate loss of the proposed method was as low as 1.0% on the top of SHM-2.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.877-886
• /
• 2005

Various frame recovery algorithms have been suggested to overcome the communication quality degradation problem due to Internet-typical impairments on Voice over IP(VoIP) communications. In this paper, we propose a new receiver-based recovery method which is able to enhance recovered speech quality with almost free computational cost and without an additional increment of delay and bandwidth consumption. Most conventional recovery algorithms try to recover the lost or erroneous speech frames by reconstructing missing coefficients or speech signal during speech decoding process. Thus they eventually need to modify the decoder software. The proposed frame recovery algorithm tries to reconstruct the missing frame itself, and does not require the computational burden of modifying the decoder. In the proposed scheme, the Vector Quantization(VQ) codebook indices of the erased frame are directly estimated by referring the pre-computed VQ Codebook Index Interpolation Tables(VCIIT) using the VQ indices from the adjacent(previous and next) frames. We applied the proposed scheme to the ITU-T G.723.1 speech coder and found that it improved reconstructed speech quality and outperforms conventional G.723.1 loss recovery algorithm. Moreover, the suggested simple scheme can be easily applicable to practical VoIP systems because it requires a very small amount of additional computational cost and memory space.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.893-896
• /
• 2000

본 논문은 완전한 규격의 비디오 디코더를 구현하는 것이 아니라 하드웨어의 메모리를 절반으로 줄인 비디오 디코더에 관한 것이다. 우선 프레임 메모리를 수평 방향으로 1/2 만큼 축소시키는 방법을 제시하고, 다음으로 이렇게 축소되어 저장된 프레임 메모리를 움직임 보상을 하기 위해 다시 Interpolation하는 방법을 제시한다. 이 때 여러 방법의 모의 실험을 통해 추출된 영상의 특징들을 이용하여 메모리를 줄였을 때 나타나는 화질의 열화와 에러의 누적을 최소화하는 적응적인 알고리즘을 제시하고, 컴퓨터 모의 실험을 통해 기존에 사용하던 방법과 비교하여 제안된 알고리즘의 성능을 검증하고 결론을 맺는다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.650-652
• /
• 2022

Frame rate up-conversion (FRUC) algorithm is an image interpolation technology that improves the frame rate of moving pictures. This solves problems such as screen shake or blurry motion caused by low frame rate video in high-definition digital video systems, and provides viewers with a more free and smooth visual experience. In this paper, we propose a video compression technique using deep learning-based FRUC algorithm. The proposed method compresses and transmits after excluding some images from the original video, and uses a deep learning-based interpolation method in the decoding process to restore the excluded images, thereby compressing them with high efficiency. In the experiment, the compression performance was evaluated using the decoded image and the image restored by the FRUC algorithm after encoding the video by skipping 1 or 3 pages. When 1 and 3 sheets were excluded, the average BD-rate decreased by 81.22% and 27.80%. The reason that excluding three images has lower encoding efficiency than excluding one is because the PSNR of the image reconstructed by the FRUC method is low.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3182-3196
• /
• 2012

In this paper, we present a new LED (Light Emitting Diode) mood lighting system interacting with smartphones based on the generation of different light sequences. In the proposed system, one light sequence is considered to be one unit of the service contents, which is then transmitted through a network and played in an LED lighting system. To this end, we propose a novel generation scheme using a smartphone, and a decoding/playing mechanism in an LED lighting system. The lighting sequences have a fixed period divided into predefined time units. Two modes - basic and interpolation - are supported in each time unit when playing a color sequence. In the basic mode, the color is maintained for the entire time unit, whereas in the interpolation mode the color is interpolated. The sequence is decoded and played in the lighting circuit by changing the duty cycle of a PWM (Pulse Width Modulation) signal. A demonstration system of the overall proposed method was using smartphones, a server and an LED lighting system. The results from this experiment show the validity and applicability of the proposed scheme.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.833-836
• /
• 1991

This paper proposes several types of 2-D interpolation lifters for HD-MAC decoder. Filters considered here are FIR, IIR, median, and FMH. Their structure and coefficients have been determined to be appropriate for real-time computation as well as to have good reconstructability. Results or computer simulation are also presented to show the performance of those filters.