• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.56-61
• /
• 1997

In this paper, we describe a real-time implementation of a multi-channel auido codec system that is based on the MPEG-1 audio algorithm. The major feature of this system is that it has a flexible multi-DSP system that can be adapted for various applications with using up to four TMS320C40 DSPs. The purpose of this paper is to present the problems of the system and is to describe the optimized methods to solve the problems in the view of hardware and software. Our audio codec is composed of an encoder an a decoder system and the bit rate of bitstream is up to 384 kbps. Fast input/output interfaces, DSP overloads, and inter-DSP communications methods with high speed are considered in multi-DSP H/W. Also, to run real-time in S/W, optimizing methods of algorithm are considered. After implementation of system, the subjective assessment method, and 'triple stimulus/hidden reference/double blind' that recommended by ITU-R TG10/3 is adopted for the quality of our system. All test items except one are awarded difference grades(diffgrade) better than 1-. Form the results, multi-channel audio system can be used for HDTV service.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.5
• /
• pp.505-511
• /
• 2011

In this paper, we have developed an automatic velocity control system of a small-sized commercial treadmill (belt length of 1.2 m and width of 0.5 m) which is widely used at home and health centers. The control objective is to automatically adjust the treadmill velocity so that the subject's position is maintained within the track when the subject walks at a variable velocity. The subject's position with respect to a reference point is measured by a low-cost sonar sensor located on the back of the subject. Based on an encoder sensor measurement at the treadmill motor, a state feedback control algorithm with Kalman filter was implemented to determine the velocity of the treadmill. In order to reduce the unnatural inertia force felt by the subject, a predefined acceleration limit was applied, which generated smooth velocity trajectories. The experimental results demonstrate the effectiveness of the proposed method in providing successful velocity changes in response to variable velocity walking without causing significant inertia force to the subject. In the pilot study with three subjects, users could change their walking velocity easily and naturally with small deviations during slow, medium, and fast walking. The proposed automatic velocity control algorithm can potentially be applied to any locomotion interface in an economical way without having to use sophisticated and expensive sensors and larger treadmills.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.36-43
• /
• 2013

This paper proposes a motion estimation algorithm with run-time adaptive workload control. It has optimized performance within limited hardware resources while guaranteeing hard realtime operation. It performs maximum searches within hard realtime constraints, since it determines search steps and workload adaptively. It reduces the hardware size to 1/4~1/400 of conventional algorithms, while its PSNR degradation is only 0.02~0.44 dB. It can be easily applied to most conventional fast algorithms, so it is useful to design realtime encoder chips.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.1-14
• /
• 2017

This paper proposes adaptive reference structure decision method to improve the performance of HEVC (High Efficiency Video Coding) encoder. When an event occurs in the input sequence, such as scene change, scene rotation, fade in/out, or light on/off, the proposed algorithm changes the reference structure to improve the inter prediction performance. The proposed algorithm divides GOP (Group Of Pictures) into two sub-groups based on the picture that has such event and decides the reference pictures in the divided sub-groups. Also, this paper proposes fast encoding method which changes the picture type of first encoded picture in the GOP that has such event to CRA (Clean Random Access). With the statistical feature that intra prediction is selected by high probability for the first encoded picture in the GOP carrying such event, the proposed fast encoding method does not operate inter prediction. The experimental result shows that the proposed adaptive reference structure decision method improves the BD-rate 0.3% and reduces encoding time 4.9% on average under the CTC (Common Test Condition) for standardization. In addition, the proposed reference structure decision method with the picture type change reduces the average encoding time 12.2% with 0.11% BD-rate loss.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.163-174
• /
• 2008

The H.264/AVC provides gains in compression efficiency of up to 50% over a wide range of bit rates and video resolutions compared to previous standards. However, to achieve such high coding efficiency, the complexity of H.264/AVC encoder is also increased drastically than previous ones, mainly because of mode decision. In this paper, we propose a three-step mode decision algorithm for fast encoding in H.264/AVC. In the first step, we select skip mode or inter mode by considering the temporal correlation and spatial correlation. In the second step, if the result of the first step is INTER mode, we select one group between two groups for final mode. In the third step, we select final mode by exploiting the pixel values of error macroblock or the modes of adjacent macroblocks. Simulations show that the proposed method reduces the encoding time by 42% on average without any significant PSNR losses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.585-593
• /
• 2007

For the improvement of coding efficiency, the H.264 standard uses new coding tools such as VBS, 1/4-pel accurate ME, multiple references, intra prediction, loop filter, etc. Using these coding tools, H.264 has achieved significant improvements from rate-distortion point of view compared to existing standards. However, the encoder complexity is greatly increased due to these coding tools. We focus on the complexity reduction method of intra-mode decision. Our algorithm first restricts selective prediction modes of Intra4x4 using a simple preprocessing. The prediction modes of Intra4x4 are used for restricting those of the other inter-modes. Simulation results show that the proposed method outperforms other conventional methods and save about 82% of total encoding time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.12
• /
• pp.150-159
• /
• 2014

The latest video coding standard, HEVC can improve the coding efficiency significantly compared with the H.264/AVC. However the HEVC encoder requires much larger computational complexities. The longer 8-tap interpolation filter of the HEVC which is used in a non-integer motion estimation is one of the reasons and this paper aims to reduce the computational complexities. First of all, three shorter-tap interpolation filters for a motion estimation process are tested rather than the use of a standard interpolation filter. In addition, the fast searching strategies to reduce the number of comparisons for choosing the best non-integer motion vector are proposed. Finally, the interpolation process is selectively applied according to the searching strategy. By combining all of the techniques, the experimental results show that the encoding times can be reduced by 13.6%, 18.5% and 21.1% with the coding efficiency penalties of 0.7%, 1.5% and 2.5%, respectively. For the full-HD video sequences, the coding efficiency penalties are reduced to 0.4%, 1.1% and 1.6% at the same level of the encoding time savings, which shows the effectiveness of the proposed schemes for the high resolution video sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.247-254
• /
• 2008

H.264 provides a good coding efficiency compared with existing video coding standards, H.263, MPEG-4, based on the use of multiple reference frame for variable block size motion estimation, quarter-pixel motion estimation and compensation, $4{\times}4$ integer DCT, rate-distortion optimization, and etc. However, many modules used to increase its performance also require H.264 to have increased complexity so that fast algorithms are to be implemented as practical approach. In this paper, among many approaches, fast mode decision algorithm by skipping variable block size motion estimation and spatial-predictive coding, which occupies most encoder complexity, is proposed. This approach takes advantages of temporal and spatial properties of fast mode selection techniques. Experimental results demonstrate that the proposed approach can save encoding time up to 65% compared with the H.264 standard while maintaining the visual perspectives.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.41-47
• /
• 2016

High efficiency video coding (HEVC) employs a coding tree unit (CTU) to improve the coding efficiency. A CTU consists of coding units (CU), prediction units (PU), and transform units (TU). All possible block partitions should be performed on each depth level to obtain the best combination of CUs, PUs, and TUs. To reduce the complexity of block partitioning process, this paper proposes the PU mode skip algorithm with region of interest (RoI) selection using motion vector. In addition, this paper presents the CU depth level skip algorithm using the co-located block information in the previously encoded frames. First, the RoI selection algorithm distinguishes between dynamic CTUs and static CTUs and then, asymmetric motion partitioning (AMP) blocks are skipped in the static CTUs. Second, the depth level skip algorithm predicts the most probable target depth level from average depth in one CTU. The experimental results show that the proposed fast CU decision algorithm can reduce the total encoding time up to 44.8% compared to the HEVC test model (HM) 14.0 reference software encoder. Moreover, the proposed algorithm shows only 2.5% Bjontegaard delta bit rate (BDBR) loss.