• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.21-29
• /
• 2020

The use of NAND flash memory is continuously increased with the demand of mobile data in the IT industry environment. However, the erase operations in flash memory require longer latency and higher power consumption, resulting in the limited lifetime for each cell. Therefore, frequent write/erase operations reduce the performance and the lifetime of the flash memory. In order to solve this problem, management techniques for improving the performance of flash based storage by reducing write and erase operations of flash memory with using disk buffers have been studied. In this paper, we propose a CPWL to minimized the number of write operations. It is a disk buffer management that separates read and write pages according to the characteristics of the buffer memory access patterns. This technique increases the lifespan of the flash memory and decreases an energy consumption by reducing the number of writes by arranging pages according to the characteristics of buffer memory access mode of requested pages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.321-327
• /
• 2006

This paper presents low power and high frequency design of instructions using ad-hoc techniques at transistor level for full custom and semi-custom ASIC(Application Specific Integrated Circuit) designs. The proposed design has been verified at high level using Verilog-HDL and simulated using ModelSim for the logical correctness. It is then observed at the layout level using LASI using $0.25{\mu}m$ technology and analyzed for timing characteristic under Win-spice simulation environment. The result shows the significant reduction up to $35\%$ in the power consumption by any general purpose processor like RISC or CISC. A significant reduction in the propagation delay is also observed. increasing the frequency for the fetch and execute cycle for the CPU, thus increasing the overall frequency of operation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.673-676
• /
• 2005

In this paper, we propose a improved control performance for autonomous mobile robot using the embeded system. The proposed PID(PPID) control method removes steady state error, and has good performance in transient response. The integral term in the proposed method accumulates error in increment section, inverses errors in decrement section, and increases the effect of integral coefficient around target. Therefore, the PPID control method decreases the overshoot, and makes settling time faster than general PID(GPID) control method. In order to verify the effectiveness of the proposed method(PPID), we simulated the position control of DC motor, and experimented the velocity control of autonomous mobile robot. The PPID control method demonstrated good control performance that decrease overshoot and settling time in simulation and experiments.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.198-203
• /
• 2009

With the growing demand for multimedia services and advances in display technology, new applications for 3$\sim$D scene communication have emerged. While multi-view video of these emerging applications may provide users with more realistic scene experience, drastic increase in the bandwidth is a major problem to solve. In this paper, we propose a fast prediction mode decision algorithm which can significantly reduce complexity and time consumption of the encoding process. This is based on the object segmentation, which can effectively identify the fast moving foreground object. As the foreground object with fast motion is more likely to be encoded in the view directional prediction mode, we can properly limit the motion compensated coding for a case in point. As a result, time savings of the proposed algorithm was up to average 45% without much loss in the quality of the image sequence.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.1-11
• /
• 2007

H.264/AVC uses variable block sizes to achieve significant coding gain. It has 7 different coding modes having different motion compensation block sizes in Inter slice, and 2 different intra prediction modes in Intra slice. This fine-tuned new coding feature has achieved far more significant coding gain compared with previous video coding standards. However, extremely high computational complexity is required when rate-distortion optimization (RDO) algorithm is used. This computational complexity is a major problem in implementing real-time H.264/AVC encoder on computationally constrained devices. Therefore, there is a clear need for complexity reduction algorithm of H.264/AVC such as fast mode decision. In this paper, we propose a fast mode decision with early $P8\times8$ mode rejection based on block size activity using large block history map (LBHM). Simulation results show that without any meaningful degradation, the proposed method reduces whole encoding time on average by 53%. Also the hybrid usage of the proposed method and the early SKIP mode decision in H.264/AVC reference model reduces whole encoding time by 63% on average.

• Nuclear Medicine and Molecular Imaging
• /
• v.41 no.3
• /
• pp.234-240
• /
• 2007

Purpose: In this study we propose a block-iterative method for reconstructing Compton scattered data. This study shows that the well-known expectation maximization (EM) approach along with its accelerated version based on the ordered subsets principle can be applied to the problem of image reconstruction for Compton camera. This study also compares several methods of constructing subsets for optimal performance of our algorithms. Materials and Methods: Three reconstruction algorithms were implemented; simple backprojection (SBP), EM, and ordered subset EM (OSEM). For OSEM, the projection data were grouped into subsets in a predefined order. Three different schemes for choosing nonoverlapping subsets were considered; scatter angle-based subsets, detector position-based subsets, and both scatter angle- and detector position-based subsets. EM and OSEM with 16 subsets were performed with 64 and 4 iterations, respectively. The performance of each algorithm was evaluated in terms of computation time and normalized mean-squared error. Results: Both EM and OSEM clearly outperformed SBP in all aspects of accuracy. The OSEM with 16 subsets and 4 iterations, which is equivalent to the standard EM with 64 iterations, was approximately 14 times faster in computation time than the standard EM. In OSEM, all of the three schemes for choosing subsets yielded similar results in computation time as well as normalized mean-squared error. Conclusion: Our results show that the OSEM algorithm, which have proven useful in emission tomography, can also be applied to the problem of image reconstruction for Compton camera. With properly chosen subset construction methods and moderate numbers of subsets, our OSEM algorithm significantly improves the computational efficiency while keeping the original quality of the standard EM reconstruction. The OSEM algorithm with scatter angle- and detector position-based subsets is most available.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.73-80
• /
• 2002

본 연구는 U자형 생산라인(U라인)에서의 라인밸런싱 문제를 해결하기 위한 유전알고리즘을 제시한다. U라인에서는 사이클 타임 내에 제품이 들어가는 방향과 나오는 방향의 작업을 한 작업자가 수행 할 수 있어서, 재공품 수량을 일정하게 유지한다거나 작업부하를 평활화 하는 등의 라인관리가 기존 직선라인에 비해 용이하다. U라인은 JIT(Just-ln-Time)생산 시스템에서 흔히 볼 수 있다. 본 연구는 U라인에서 사이클 타임이 고정되었을 때 작업장 또는 작업자의 수를 최소로 하면서 동시에 작업장에 할당된 작업들 간의 관련성을 최대화하는 라인밸런싱 문제를 다루었다. 라인밸런싱에 관한 기존 연구는 대부분 직선라인에 관한 것으로 U라인의 장점을 충분히 활용하지 못한다. 특히, 라인의 작업장의 수를 최소화하는 문제는 많은 대안해가 있음에도 불구하고, 작업관련성을 고려하여 해를 구하는 기법에 관한 연구는 아직 미미한 실정이다. 실제 조립라인에서는 가능한 한 관련된 작업들을 동일한 작업자에 할당하는 것이 바람직하며, 이러한 작업편성은 작업자의 작업능률을 향상시킬 수 있다. 유전알고리즘은 자연계의 적자생존과 생물학적 진화과정을 모방한 탐색기법으로 조합최적화 문제에 효과적인 기법으로 널리 알려져 있다. 본 연구는 유전알고리즘을 이용하여 U라인에서 작업관련성을 고려한 라인밸런싱 문제를 해결하기 위한 기법을 개발하였다. 문제의 목적에 적합한 개체의 평가함수가 제시되었으며, 개체의 형질을 효과적으로 자손에 유전할 수 있고 유전 연산이 용이한 개체의 표현방법과 개체의 해석방법이 제시되었다. 컴퓨터 실험을 통하여 개발한 알고리즘의 성능을 보였다.월 초순부터 중순에 각각 최고 성기를 나타내었다. H. papariensis의 암컷과 수컷의 발광양상을 분석하고자 정지발광과 구애 발광을 구분하여 조사하였고 각각의 발광지속시간과 발광주기를 구분하여 측정하였다. 수컷의 발광지속시간은 정지발광(0.12초)보다 구애발광(0.17초)에서 1.4배 증가하였으며 암컷의 발광지속시간은 정지발광(0.15초)보다 구애발광(0.19초)에서 1.5배 증가하였다. 발광주기는 수컷에서 정지발광(1.26초)보다 구애발광(1.12초)에서 0.88배 감소하였고, 암컷에서 정지발광(2.99초)보다 구애발광(1.06초)에서 0.35배 감소하였다. 발광양상에서 발광주파수는 수짓의 정지발광에서 0.8 Hz, 수컷 구애발광에서 0.9 Hz, 암컷의 정지발광에서 0.3 Hz, 암컷의 구애발광에서 0.9 Hz로 각각 나타났다. H. papariensis의 발광파장영역은 400 nm에서 700 nm에 이르는 모든 영역에서 확인되었으며 가장 높은 첨두치는 600 nm에 있고 500에서 600 nm 사이의 파장대가 가장 두드러지게 나타났다. 발광양상과 어우러진 교미행동은 Hp system과 같은 결과를 얻었다.하는 방법을 제안한다. 즉 채널 액세스 확률을 각 슬롯에서 예약상태에 있는 음성 단말의 수뿐만 아니라 각 슬롯에서 예약을 하려고 하는 단말의 수에 기초하여 산출하는 방법을 제안하고 이의 성능을 분석하였다. 시뮬레이션에 의해 새로 제안된 채널 허용 확률을 산출하는 방식의 성능을 비교한 결과 기존에 제안된 방법들보다 상당한 성능의 향상을 볼 수 있었다., 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른 영향을

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6B
• /
• pp.325-333
• /
• 2007

An OS requires the device driver to control hardware IPs at application level. Development of a device driver requires specific acknowledge for target hardware and OS. In this paper, we present a system which generates a device driver together with an interface circuit. In the proposed system, an efficient device driver is generated by selecting a basic device driver skeleton, a function module code, and a header file table from the pre-constructed library and an interface circuit is constructed such that the generated device driver operates correctly. The proposed system is evaluated by generating a TFT-LCD device driver on the ARM922T core with 3.5 inch Samsung TFT-LCD in ARM-Linux environment. Experiment result shows that the writing time on the LCD is decreased by 1.12% and the compiled code size is increased by 0.17% compared to the manually generated one. The automatically generated device driver has no performance degradation in the latency of hardware control at the application program level. The system development time can be reduced using the proposed device driver generation system.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.158-165
• /
• 2014

High Efficiency Video Coding (HEVC), the latest video coding standard, has twice of the compression efficiency compared to AVC/H.264 under the same image quality condition. To obtain the improved efficiency, however, it was adopted for many methods which need complicated calculation, and the time complexity of HEVC was increased more than that of AVC/H.264. To solve this problem, the various fast algorithms have been researched. In this paper, we propose a fast intra prediction mode decision method which uses result of Rough Mode Decision (RMD) and Most Probable Mode (MPM). The proposed method selects a best predicted mode by comparing each predicted directions which are calculated through RMD and MPM. We applied the proposed method to HM 10.0 and conducted an comparing experiment in All-Intra environment. The experiment result showed that total encoding time is reduced by about 26% on average with about a 0.8% loss of BD-rate.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.5
• /
• pp.721-728
• /
• 2004

OCSP (Online Certificate Status Protocol) server which checks the certificate status provides the real time status verification in the PKI (Public Key Infrastructure) system which is the essential system of certificate. However, OCSP server need the message authentication with the server and client, so it has some shortcomings that has slow response time for the demands of many clients concurrently and has complexity of the mathematical process in the public encryption system. In this research, simulation model of the certificate status vertification server is constructed of the DEVS (Discrete EVent system Specification) formalism. This sever model is constructed to practice the authentication with hash function when certificate is checked. Simulation results shows the results of increase of the certificate status verification speed and decrease of the response time to the client.