• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.3
• /
• pp.117-124
• /
• 1994

In this paper an inventory model is presented for determining the ordering schedule in which the demand rate is changing linearly with time and the decay is assumed to be a constant rate of the on-hand inventory. An easy to use heuristic is developed to find the times and sizes of replenishments so as to keep the total of ordering, inventory carrying and deteriorating costs as low as possible. Solutions of the model to test problems show that our heuristic model outperforms other existing models in the literature without sacrificing the computational complexity. When there is no deterioration, the model developed is related to the corresponding model of nondeteriorating items.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.490-490
• /
• 2006

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.80.2-80
• /
• 2002

The problem of sound source localization is to determine the position of sound sources using the measurement of the acoustic signals received by microphones. To develop a good sound source localization system which is applicable to a mobile platform such as robots, a time delay estimator with low computational complexity and robustness to background noise or reverberations is necessary. In this paper, an explicit adaptive time delay estimation method for a sound source localization system is proposed. Proposed explicit adaptive time estimation algorithm employs direct adaptation of the delay parameter using a transform-based optimization technique, rather than...

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1E
• /
• pp.25-29
• /
• 2008

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimatesthe signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. In this paper, we propose a new algorithm to improve the subspace estimation accuracy using a normally ordered input vector and a reversely ordered input vector simultaneously.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.25-28
• /
• 2001

A new decision-feedback equalization technique for a filter bank-based orthogonal frequency division multiplexing (OFDM) data transmission system operating in a frequency selective multipath fading channel is presented in this paper. At the cost of relatively increased computational complexity in comparison to the conventional OFDM systems, the proposed system achieves a better performance in terms of bit error rates. The simulation results confirm the superiority and robustness of our method, particularly, in the low SNR channel environment.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.123-126
• /
• 2001

Block filter implementation technique for uniform filter banks is uniform in this paper. By applying block filter into decimation and interpolation filters, it is shown that down and up samplers are cancelled out in respective liters. Furthermore by applying block filters into uniform filter banks, significant reduction for computational complexity is achieved since prototype filter can be shared in each channel implementation. Also, it is shown that proposed implementation is a reconfigurable structure in terms of order variation.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.240-242
• /
• 2009

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.132-132
• /
• 2004

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.931-936
• /
• 2006

This paper presents different issues of the real-time compression algorithms without compromising the video quality in the distributed environment. The theme of this research is to manage the critical processing stages (speed, information lost, redundancy, distortion) having better encoded ratio, without the fluctuation of quantization scale by using IP configuration. In this paper, different techniques such as distortion measure with searching method cover the block phenomenon with motion estimation process while passing technique and floating measurement is configured by discrete cosine transform (DCT) to reduce computational complexity which is implemented in this video codec. While delay of bits in encoded buffer side especially in real-time state is being controlled to produce the video with high quality and maintenance a low buffering delay. Our results show the performance accuracy gain with better achievement in all the above processes in an encouraging mode.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.2
• /
• pp.79-84
• /
• 2012

Efficient arithmetic design is essential to implement error correcting codes and cryptographic applications over finite fields. This article presents an efficient $AB^2$ multiplier in GF($2^m$) using a polynomial representation. The proposed multiplier produces the result in m clock cycles with a propagation delay of two AND gates and two XOR gates using O($2^m$) area-time complexity. The proposed multiplier is highly modular, and consists of regular blocks of AND and XOR logic gates. Especially, exponentiation, inversion, and division are more efficiently implemented by applying $AB^2$ multiplication repeatedly rather than AB multiplication. As compared to related works, the proposed multiplier has lower area-time complexity, computational delay, and execution time and is well suited to VLSI implementation.