• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.173-175
• /
• 2013

In this paper, we propose a fast and low-complexity Motion Estimation (ME) algorithm for High Efficiency Video Coding (HEVC). Motion estimation occupies 77~81% of the amount of computation in HEVC. After all, the main key of codec implementation is to find a fast and low-complexity motion estimation algorithm and architecture. The proposed algorithm uses only 1% of the amount of operations compared to full search algorithm while maintaining compression performance with slight loss of 0.6% (BDBR).

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.852-855
• /
• 2002

This paper presents a design of FIR near-equiripple Nyquist filters having zero-intersymbol interference (ISI) and low sensitivity to timing jitter, with coefficients taking only discrete values. Using an affine scaling linear programming algorithm, an optimum discrete coefficient set can be obtained in a feasible computational time. Also presented is a pipelined multiplier-free FIR filter realization with periodically time-varying (PTV) coefficients based on a hybrid form suitable for Nyquist filter. The realization exploits the coefficient symmetry to reduce the hardware by about one half. High speed computation and low power consumption are achieved by its pipelined and low fan-out structure.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.6
• /
• pp.1541-1546
• /
• 1993

To extend the widely used Gibson and Launder's second order closure model to the low-Reynolds-number region near a wall, modifications have been made for velocity pressure-gradient interaction and dissipation terms in the stress equations, and also for the dissipation rate equation. From the computation of fully developed plane channel flow, it is found that the results with present model agree well with the data of direct numerical simulation in the predictions of stress components. And, the computed mean velocity profile coincides with the universal velocity law.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.178-194
• /
• 2009

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.488-496
• /
• 2016

This paper presents a low-complexity non-iterative soft-decision Bose-Chaudhuri-Hocquenghem (SD-BCH) decoder architecture and design technique for wireless body area networks (WBANs). A SD-BCH decoder with test syndrome computation, a syndrome calculator, Chien search and metric check, and error location decision is proposed. The proposed SD-BCH decoder not only uses test syndromes, but also does not have an iteration process. The proposed SD-BCH decoder provides a 0.75~1 dB coding gain compared to a hard-decision BCH (HD-BCH) decoder, and almost similar coding gain compared to a conventional SD-BCH decoder. The proposed SD-BCH (63, 51) decoder was designed and implemented using 90-nm CMOS standard cell technology. Synthesis results show that the proposed non-iterative SD-BCH decoder using a serial structure can lead to a 75% reduction in hardware complexity and a clock speed 3.8 times faster than a conventional SD-BCH decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.822-830
• /
• 2009

The spectrum efficiency of mobile communication networks can be improved dramatically adopting multiple antennas technologies. In order to guarantee the licensed rights of primary user (PU), the cognitive radio system should perform in a relatively low interference manner when it gets access to the spectrum of licensed networks. In this paper, we explore a uniformly distributed circular antenna array to implement beamforming algorithm that is accomplished by optimization method at the base station of cognitive radio networks, and therefore we can suppress the interference to PU by steering quite low transmission power toward PU and constructing a narrow beam toward cognitive user (CU). By reducing the constraint number of the optimization problem, we also propose a null steering algorithm that steers rather low radiation power toward PU, while the other areas in the same cell are covered by radiation power except the local area around PU. It is pursued to reduce the computation load and enlarge the capacity of cognitive radio networks extremely. The simulation results demonstrate that the proposed algorithms process superior performance.

• 한국신재생에너지학회:학술대회논문집
• /
• 2006.06a
• /
• pp.499-502
• /
• 2006

This paper presents computed results of FEM analysis on the tribological contact behaviors of a primary sealing components of mechanical face seals for a small hydro-power turbine. The FEM computed results present that the contact area between seal rings and seal seats is very important for a good tribological performance such as low friction heating, low wear, high contact normal stress in a primary seal ing components. Based on the FEM computation, model III in which has a small sealing contact area shows low dilatation of primary sealing components, and high contact stress between a seal ring and a 1)seal seat.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.3
• /
• pp.560-566
• /
• 2009

A low-power Radio Frequency Identification (RFID) system is an auto-identification technology that reads and writes an information of things without physical contacts using radio frequency. It is unescapable against unlawful modification, eavesdropping, tracking, or privacy of individuals because RFID systems use the radio frequency and RFID tags. Therefore we create a key using hash chain between database and tag and this process can prevent above attacks. Also we support the efficiency of proposed protocol using hash function to abate computation.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.136-140
• /
• 2006

In this paper, we consider the detection of orthogonal space-time block codes (OSTBCs) without channel state information (CSI) at the receiver. Based on the conventional blind cyclic decoder, we propose an enhanced blind cyclic decoder which has higher system performance than the conventional one. Furthermore, the proposed decoder offers low complexity since it does not require the computation of singular value decomposition.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.141-144
• /
• 2000

In this paper, a new parallel array structure for the asynchronous array multiplier is introduced. This structure is designed for a data dependent asynchronous multiplier to reduces power which is wasted in conventional array structure. Simulation shows that this structure saves 30％ of power and 55％ of computation time comparing to conventional booth encoded array multiplier.