• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.18-29
• /
• 2008

NAND Flash memory has been growing popular storage device for the last years because of its low power consumption, fast access speed, shock resistance and light weight properties. However, it has the distinct characteristics such as erase-before-write architecture, asymmetric read/write/erase speed, and the limitation on the number of erasure per block. Due to these limitations, various Flash Translation Layers (FTLs) have been proposed to effectively use NAND flash memory. The systems that adopted the conventional FTL may result in severe performance degradation by the hot data which are frequently requested data for overwrite in the same logical address. In this paper, we propose a novel FTL algorithm called Adaptive Flash Translation Layer (AFTL) which uses sector mapping method for hot data and log-based block mapping method for cold data. Our system removes the redundant write operations and the erase operations by the separating hot data from cold data. Moreover, the read performance is enhanced according to sector translation that tends to use a few read operations. A series of experiments was organized to inspect the performance of the proposed method, and they show very impressive results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2594-2603
• /
• 1997

A novel method of adaptive beam forming is presented in this paper. The proposed technique provides for a suboptimal beam pattern that increases the Signal to Noise/Interference Ratio (SNR/SIR), thus, eventually increases the capacity of the communication channel, under an assumption that the desired signal is dominant compared to each component of interferences at the receiver, which is precoditionally achieved in Code Division Multiple Access (CDMA) mobile communications by the chip correlator. The main advantages of the new technique are:(1)The procedure requires neither reference signals nor training period, (2)The signal interchoerency does not affect the performance or complexity of the entire procedure, (3)The number of antennas does not have to be greater than that of the signals of distinct arrival angles, (4)The entire procedure is iterative such that a new suboptimal beam pattern be generated upon the arrival of each new data of which the arrival angle keeps changing due tot he mobility of the signal source, (5)The total amount of computation is tremendously reduced compared to that of most conventional beam forming techniques such that the suboptimal beam pattern be produced at vevery snapshot on a real-time basis. The total computational load for generating a new set of weitht including the update of an N-by-N(N is the number of antenna elements) autocovariance matrix is $0(3N^2 + 12N)$. It can further be reduced down to O(11N) by approximating the matrix with the instantaneous signal vector.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.78-87
• /
• 2013

NAND flash memory has been widely used as a storage medium in mobile devices, PCs, and workstations due to its advantages such as low power consumption, high performance, and random accessability compared to a hard disk drive. However, NAND flash cannot support in-place update so that it is mandatory to erase the entire block before overwriting the corresponding page. In order to overcome this drawback, flash storages need a software support, named Flash Translation Layer. However, as the high performance mass NAND flash memory is getting widely used, the size of mapping tables is increasing more than the limited DRAM size. In this paper, we propose an adaptive mapping information caching algorithm based on page mapping to solve this DRAM space shortage problem. Our algorithm uses a mapping information caching scheme which minimize the flash memory access frequency based on the analysis of several workloads. The experimental results show that the proposed algorithm can increase the performance by up to 70% comparing with the previous mapping information caching algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.3
• /
• pp.22-30
• /
• 2010

This paper proposes a combination system of Adaptive Modulation and Coding (AMC) and Multiple Input Multiple Output (MIMO), which improves the throughput and has a better reliability. In addition, the system includes Precoding, Antenna Subset Selection and MIMO Mode Selection scheme. Finally, we make a performance analysis of the proposed system. The principal environmental parameters for the simulation experiment consist of a frequency non-selective rayleigh fading channel and a Spreading Factor (SF) of 16. Other parameters may be included in order to fulfill the requirements of the HSDP A Standard. The proposed system has a higher throughput and more reliability than the conventional system, which does not include MIMO Mode Selection scheme, Precoding or Antenna Subset Selection. According to the simulation results, the proposed system reaches the maximum throughput at 8dB, presentlng an improvement of 6dB and twice higher throughput, respect to the conventional system. Specifically, at the point of -6dB, the conventional system reaches 2.5Mbps, while the proposed system reaches 6.4Mbps at the same SNR. Also, at the point of 2dB, each system reaches 7.5Mbps (conventional system) and 15.3Mbps (proposed system), with near twice the difference. According to the results exposed above, we can conclude that the system proposed in this paper has, as the greatest contribution, the improvement of the throughput, especially, the average throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.401-404
• /
• 2015

This paper proposes a high-performance in-loop filter in HEVC(High Efficiency Video Coding) encoder for Ultra HD video processing in real time. HEVC uses in-loop filter consisting of deblocking filter and SAO(Sample Adaptive Offset) to solve the problems of quantization error which causes image degradation. In the proposed in-loop filter encoder hardware architecture, the deblocking filter and SAO has a 2-level hybrid pipeline structure based on the $32{\times}32CTU$ to reduce the execution time. The deblocking filter is performed by 6-stage pipeline structure, and it supports minimization of memory access and simplification of reference memory structure using proposed efficient filtering order. Also The SAO is implemented by 2-statge pipeline for pixel classification and applying SAO parameters and it uses two three-layered parallel buffers to simplify pixel processing and reduce operation cycle. The proposed in-loop filter encoder architecture is designed by Verilog HDL, and implemented by 205K logic gates in TSMC 0.13um process. At 110MHz, the proposed in-loop filter encoder can support 4K Ultra HD video encoding at 30fps in realtime.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.31-40
• /
• 2004

In this paper, we analyze mathematically the performance of the gated service scheduling in the Interleaved Polling with Adaptive Cycle Time(IPACT) was proposed to control upstream traffic for Gigabit Ethernet-PONs. In the analysis, we model EPON MAC protocol as a polling system and use mean value analysis. We divide arrival rate λ into three regions and analyze each region accordingly In the first region in which λ value is very small, there are very few ONUs' data to be transmitted. In the second region in which λ has reasonably large value, ONUs have enough data for continuous transmission. In the third region, ONUs' buffers are always saturated with data since λ value is very large. We obtain average packet delay, average Queue size, average cycle time of the gated service. We compare analysis results with simulation to verify the accuracy of the mathematical analysis. Simulation requires much time and effort to evaluate the performance of EPONs. On the other hand, mathematical analysis can be widely used in the design of EPON systems because system designers can obtain various performance results rapidly. We can design appropriate EPON systems for varioustraffic property by adjusting control parameters.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.417-424
• /
• 2007

Mesh networks using WLAN technology have been paid attention as a key wireless access technology. However, many technical issues still exist for its successful deployment. One of those issues is the routing problem that addresses the path setup through a WLAN mesh network for the data exchanges between a station and a wired network. Since the characteristics of a WLAN mesh network can be very dynamic, the use of single routing protocol would not fit for all environments whether it is reactive or proactive. Therefore, it is required to develop an adaptive routing protocol that modifies itself according to the changes in the network parameters. As a logical first step for the development, an analytical model considering all the dynamic features of a WLAN mesh network is required to evaluate the performance of a reactive and a proactive routing scheme. In this paper, we propose an analytical model that makes us scrutinize the impact of the network and station parameters on the performance of each routing protocol. Our model includes the size of a mesh network, the density of stations, mobility of stations. and the duration of network topology change. We applied our model to the AODV that is a representative reactive routing protocol and DSDV that is a representative proactive routing protocol to analyze the tradeoff between AODV and DSDV in dynamic network environments. Our model is expected to help developing an adaptive routing protocol for a WLAN mesh network.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.139-148
• /
• 2005

The desired level for multimedia services in the mobile web environment, the next generation web environment, is expected to be of PC level quality. And great efforts have been made in the development of hadware technology, communication technology, various kinds of services and standardization to support these services, In the mobile web environment, multimedia contents adaptation services should be available through supporting various kinds of devices, network abilities and users' preferences. It means that due to the variety of both desired devices' hardware specifications, called destinations, and desired QoSes, the QoSes in the destinations are not fixed or defined. If a new user wants to stream multimedia contents in a server through a new kind of terminal device, it should be considered whether the existing transcoders are able to adapt the multimedia contents. However, the existing libraries for multimedia adaptation have heavy transcoder figures which include all adaptive functions in one library, The challenge of universal access is too complex to be solved with these all in one solutions. Therefore, in this paper we propose an application independent multimedia adaptation framework which meets the QoS of new and varied mobile devices. This framework is composed of a group of unit transcoders having only one transcoding function respectively, Instead of heavy transcoders. Also, It includes the transcoder manager supporting the dynamic connections of the unit transcoders in order to satisfy end to end QoS.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.529-542
• /
• 2000

Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.