• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.42-49
• /
• 2011

In this paper, we propose a fast macroblock mode decision algorithm in H.264/AVC, based on the image sequence statistics. Specically, considering the directional characteristics of image sequences, we eliminate sub$8{\times}4$ or sub$4{\times}8$ mode decision process based on the rate-distortion cost of Inter$16{\times}8$ or Inter$8{\times}16$ mode respectively. Additionally, exploiting the optimal modes of submacroblock in inter$8{\times}8$ mode, we propose an algorithm to eliminate Intra$4{\times}4$ or Intra$16{\times}16$ mode decision process selectively. From the simulation results, the proposed method reduce the encoding time by maximum 70% of total, compared with the other conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.587-597
• /
• 2005

Flash memory based embedded computing systems are becoming increasingly prevalent.These systems typically have to provide an instant start-up time. However, we observe that mounting a file system toy flash memory takes 1 to 25 seconds mainly depending on the flash capacity. Since the flash chip capacity is doubled in every year, this mounting time will soon become the most dominant reason of the delay of system start-up time Therefore, in this paper, we present instant mounting techniques for flash file systems by storing the In-memory file system metadata to flash memory when unmounting the file system and reloading the stored metadata quickly when mounting the file system. These metadata snapshot techniques are specifically developed for NOR- and NAND-type flash memories, while at the same time, overcoming their physical constraints. The proposed techniques check the validity of the stored snapshot and use the proposed fast trash recovery techniques when the snapshot is Invalid. Based on the experimental results, the proposed techniques can reduce the flash mounting time by about two orders of magnitude over the existing de facto standard flash file system, JFFS2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1123-1130
• /
• 2004

This paper proposes the fast OVSF code generation method using the multi-stage spreading scheme based on the single code indexing scheme. The conventional OVSF indexing scheme based on the code-tree structure uses two numbers as the codeword indices, the layer number and the code number of the corresponding layer. However, the single code index number implicitly includes the information of the spreading factor as well as the code number. Since the binary representation of the single code indices shows the pattern of the codeword, the orthogonality between two different codewords can be determined by comparing their code indices instead of much longer codewords. The above useful property also makes the codeword can be generated directly kom its single code index. In this paper, the multi-stage spreading scheme is applied to generate the long code by spreading two shorter codewords with the appropriate code indices. The proposed fast code generation algorithm is designed for 3GPP UMTS systems and verified by the simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.1
• /
• pp.15-20
• /
• 2022

An improvement of computational resources with a large scale cluster service is available to the individual person, which has been limited to the original industry and research institute. Therefore, the application of powerful computational resources to the engineering design has been increased fast. In naval and marine industry, the application of Computational Fluid Dynamics, which requires a huge computational effort, to a design of ship and offshore structure has been increased. Floating bodies such as the ship or offshore structure is exposed to ocean waves, current and wind in the ocean, therefore the precise modelling of those environmental disturbances is important in Computational Fluid Dynamics. Especially, ocean waves has to be nonlinear rather than the linear model based on the superposition due to a nonlinear characteristics of Computational Fluid Dynamics. In the present study, a fast reconstruction technique is suggested and it is validated from a series of simulations by using the Computational Fluid Dynamics.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.11 s.102
• /
• pp.1123-1130
• /
• 2005

In this paper, we propose an improved side information processing scheme which is important in the sub-block phase weighting(SPW) method for the peak-to-average power ratio(PAPR) reduction. SPW method is to divide the input OFDM subchannels into several subblocks and to multiply phase weighting with each subblocks, properly for the reduction of the peak power. SPW method is similar to the conventional PTS method when the number of sub-carriers, signal modulation format and the number of subblocks are the same. However, unlike the conventional PTS(Partial Transmit Sequence) and SLM(Selected Mapping) method using many stages of IFFT(Inverse Fast Fourier Transform), SPW method only needs one IFFT. Although PAPR can be reduced by SPW method, complex computation burden still remains. In this paper the flipping algorithm and the full iteration algorithm are used f3r the phase control method. Through the computer simulation, we analyze and discuss the properties and the performance of the suggested method.

• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.297-305
• /
• 2003

In this paper, we propose a wavelet based fast motion estimation algorithm for video sequence encoding with very low bit-rate. By using one of properties oi wavelet transform, multi-resolution analysis(MRA) property and spatial Interpolation of an image, we are able to reduce both prediction error and computational complexity at the same time. Especially, by defining a significant block(SB) based on the differential information of wavelet coefficients between successive frames, the proposed algorithm makes up a defect of multi-resolution motion estimation(MRME) algorithm of increasing the number of motion vectors. As experimental results. we can reduce the computational load up to 70% but also improve PSNR up to about 0.1 ∼ 1.2 dB comparing with the MRME algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1A
• /
• pp.7-16
• /
• 2003

Handover is very important to support the mobility of user because wireless ATM networks have smaller cell size such as micro/pico cell for broadband mobile multimedia service In this paper, we propose dynamic path reservation handover scheme for fast inter-MSC (Mobile Switching Center) handovers To reduce the handover delay for connection re-routing, the proposed scheme reserves virtual channels from nearest common node to neighbor MSC in advance Especially, our handover scheme predicts the number of inter-MSC handover calls at each period by the prediction algorithm and reserve virtual channels The simulation and analysis results show that our scheme reduce handover complexity and has higher reservation channel utilization, compared with DVCT scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.200-208
• /
• 2003

In this paper, we propose an enhanced p-cycles (preconfigured protection cycles) scheme for fast restoration in WDM (Wavelength Division Multiplexing) optical mesh network with limited wavelength conversion for fast restoration. We enhanced the p-cycles to accommodate uni-directional connections to be used in uni-directional multicasting or asymmetric broadband multimedia communications with bi-directional connectivity. We applied it to WDM network with limited wavelength conversion and analyzed the result. The analysis results show that the enhanced p-cycle algorithm provides better performance in WDM optical networks with limited wavelength converter.