• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.11a
• /
• pp.65-66
• /
• 2005

This paper presents an adaptive satellite communication systems to adapt channel environment. High performance coding and modulation techniques are applied to poor channel condition, otherwise, bandwidth efficient coding and modulation techniques are applied to good channel condition to obtain high transmission rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.88-96
• /
• 2007

H.264 is a new international video coding standard that can achieve considerably higher coding efficiency than conventional standards. Its coding gain has been achieved by employing advanced video coding methods. Specially, the increased number of macroblock modes and the complex mode decision procedure using the Lagrangian optimization are the main factors for increasing coding efficiency. Although H.264 obtains improved coding efficiency, it is difficult to do an real-time encoding because it considers all coding parameters in the mode decision procedure. In this paper, we propose a fast mode decision algorithm which classifies the macroblock modes in order to determine the optimal mode having low complexity quickly. Simulation results show that the proposed algorithm can reduce the encoding time by 34.95% on average without significant PSNR degradation or bit-rate increment. In addition, in order to show the validity of simulation results, we set up a low boundary condition for coding efficiency and complexity and show that the proposed algorithm satisfies the low boundary condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.242-259
• /
• 2015

Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.357-364
• /
• 2006

We study Hausdorff and packing dimensions of subsets of a general coding space with a generalized ultra metric from a multifractal spectrum induced by a self-similar measure on a self-similar Cantor set using a function satisfying a H${\ddot{o}}$older condition.

• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2004

We study Hausdorff and packing dimensions of subsets of a coding space with an ultra metric from a multifractal spectrum induced by a self-similar measure on a Cantor set using a function satisfying a H$\ddot{o}$lder condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.27-37
• /
• 2022

In this paper, we presents a Multiple User Multiple Input Multiple Output (MU-MIMO) test-bed system for Time Division Duplex (TDD) Long Term Evolution-Advanced (LTE-A). Using two parameters, the condition number of the channel matrix and the path gain, the MU-MIMO system could switch pre-coder to maintain target Bit Error Rate (BER) level. This paper also introduces a calibration procedure for compensating error of Radio Frequency (RF) paths of the antennas and RF transceivers. From experimental measurements, dynamic pre-coding scheme could maintain target BER, set to 10^-3, with the pre-coder set configured with Zero Forcing (ZF), Tomlinson Harashima Pre-coding (THP), Lattice Reduction (LR). The simplest pre-coder ZF is adopted in stable channel, and when path gain become less than 0.25, LR is adopted. Lastly, when condition number of channel matrix become larger than 7, THP is adopted.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.5
• /
• pp.285-290
• /
• 2012

In this paper, we propose a fast encoding algorithm for scalable video encoding without compromising coding performance. Through analysis on multiple motion estimation processes performed at the enhancement layer, we show redundant motion estimations and suggest the condition under which the redundant ones can efficiently be determined without additional memory. Based on the condition, the redundant motion estimation processes are excluded in the proposed algorithm. Simulation results show that the proposed algorithm is faster than the conventional fast encoding method without performance degradation and additional memory.

• Journal of the Ergonomics Society of Korea
• /
• v.1 no.2
• /
• pp.17-23
• /
• 1982

Application of color coding to a jack board-type display has not yet been tried. The purpose of this paper is to study the effects of color coding on a jack board-type display. Ten subjects searched 10*20 arrays of numbers for the presence or absence of a color coding. Five colors were used for the coding. Three subjects were selected among 10 subjects to repeat 11 times the above experiments. Detection time was reduced by 6.6% for the color coding condition. Three subjects did not show any results different from those in their inexperienced state, except the learning effect during repetition of the experiments. The results imply that the color coded jack board-type display may be efficient either to inexperienced subjects or to experienced subjects.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.139-143
• /
• 2014

This paper proposes a simplified DC calculation method for simplified depth coding (SDC) mode of 3D High Efficiency Video Coding (3D-HEVC) to reduce the computational complexity. For the computational complexity reduction, the current reference software of 3D-HEVC employs reference samples sub-sampling method. However, accumulation, branch, and division operations are still utilized and these operations increase computational complexity. The proposed method calculates DC value without those operations. The experimental results show that the proposed method achieves 0.1% coding gain for synthesized views in common test condition (CTC) with the significantly reduced number of computing operations.