• 대한임베디드공학회논문지
• /
• 제6권4호
• /
• pp.255-261
• /
• 2011

In this paper, we propose a security-enhanced storing method for the voice data obtained during the flight. When an emergency occurs during flight, the flight data in the storage device such as DTS or Blackbox can be exposed to antagonist or enemy. Currently, zeroize function is embedded in these devices in order to prevent this situation. However, this could not be operated if the system is malfunctioned or the pilot is wounded in the emergency. In order to solve this problem, the voice data compressed by the ADPCM is encrypted in the proposed method composed of the AES algorithm and a reordering method. The simulation results show that the security for the voice date is further enhanced due to the proposed method.

• 대한임베디드공학회논문지
• /
• 제6권6호
• /
• pp.345-359
• /
• 2011

In high performance embedded systems, the use of multiple on-chip memories is an essential architectural feature for exploiting inherent parallelism in multimedia applications. This feature allows multiple data accesses to be executed in parallel. However, it remains difficult to effectively exploit of multiple on-chip memories. The successful use of this architecture strongly depends on how to efficiently detect and exploit memory parallelism in target applications. In this paper, we propose a technique based on a linear array access descriptor [1], which is generated from profiled data, to detect and exploit memory parallelism. The proposed technique tackles an array reorganization problem to maximize memory parallelism in multimedia applications. We present preliminary experiments applying the proposed technique onto a representative coarse grained reconfigurable array processor (CGRA) with multimedia kernel codes. Our experimental results demonstrate that our technique optimizes data placement by putting independent data on separate storage. The results exhibit 9.8% higher performance on average compared to the existing method.

• 대한임베디드공학회논문지
• /
• 제14권4호
• /
• pp.187-195
• /
• 2019

In the fourth industrial revolution era, various commercial smart platforms for smart system implementation are being developed and serviced. However, since most of the smart platforms have been developed for general purposes, they are difficult to apply / utilize because they cannot satisfy the requirements of real-time data management, data visualization and data storage of smart factory system. In this paper, we implemented an open source based smart manufacturing big data platform that can manage highly efficient / reliable data integration for the diagnosis diagnostic system of manufacturing robots.

• 한국멀티미디어학회논문지
• /
• 제10권8호
• /
• pp.958-966
• /
• 2007

본 논문에서는 음질향상 알고리즘을 내장한 MPEG-1 오디오 디코더를 Embedded OS(Linux)기반 플랫폼에 구현하였다. 네트워크 대역폭과 저장 공간의 제한점을 고려한 MP3, AAC, OGG 등과 같은 손실 오디오 압축 코덱들은 공통적으로 고주파 대역의 정보가 손실되는데, 이러한 고주파 신호성분 손실은 결국 표준 CD음질을 가지는 오디오 신호보다 제한된 저주파 대역만을 재생할 수 있게 된다. 본 논문은 손실된 고주파 대역의 신호성분과 하모닉 성분을 효과적으로 추정 및 복원할 수 있는 음질 향상 알고리즘을 MPEG-1 오디오 디코더 내부에 각 계층 I, II, III 특성별로 최적화하여 Embedded Linux 플랫폼으로 구현하였다. 기존의 MPEG-1 오디오 디코더와의 비교 청취 실험을 통해 본 논문에서 구현된 시스템이 신호 스펙트럼 및 음질 면에서 향상되었음을 확인할 수 있었다.

• 대한임베디드공학회논문지
• /
• 제13권5호
• /
• pp.235-243
• /
• 2018

NAND flash memory has been widely used for embedded systems as storage device and the flash memory file systems such as JFFS2, YAFFS/YAFFS2 have been adopted by these embedded systems. The flash memory file systems provide the high performance and overcome the limitations of flash memory. However, these file systems don't solve the slow mount time problem when a sudden power failure happens. In this paper, we proposed a flash memory management method for enhancing the recovery performance. The proposed method manages the flash memory block type and stores the block type information at recovery image block. When file operations are occurred, our method stores the file information at the metadata block before and after the file operation. When mounting the flash memory, our method only scans the recovery image blocks and metadata blocks. The proposed method reduces the mount time by seeking the metadata block locations fast by using the recovery image blocks. We implemented the proposed method and evaluation results show that our method reduces the mount time 13 ~ 46 % compared with YAFFS2.

• 한국컴퓨터정보학회논문지
• /
• 제22권5호
• /
• pp.1-9
• /
• 2017

Recently, flash memory has been in a great demand from embedded system sectors for storage devices. However, program/erase (P/E) cycles per block are limited on flash memory. For the limited number of P/E cycles, many wear leveling techniques are studied. They prolonged the life time of flash memory using information tables. As one of the techniques, block erase table (BET) method using a bit array table was studied for embedded devices. However, it has a disadvantage in that performance of wear leveling is sharply low, when the consumption of memory is reduced. To solve this problem, we propose a novel wear leveling technique using Sampling-based Block Erase Table (SBET). SBET relates one bit of the bit array table to each block by using exclusive OR operation with round robin function. Accordingly, SBET enhances accuracy of cold block information and can prevent to decrease the performance of wear leveling. In our experiment, SBET prolongs life time of flash memory by up to 88%, compared with previous techniques which use a bit array table.

• 대한임베디드공학회논문지
• /
• 제14권5호
• /
• pp.249-258
• /
• 2019

In the cyber-physical system, big data collected from numerous sensors and IoT devices is transferred to the Cloud for processing and analysis. When transferring data to the Cloud, merging data into one single file is more efficient than using the data in the form of split files. However, current merging and splitting operations are performed at the user-level and require many I / O requests to memory and storage devices, which is very inefficient and time-consuming. To solve this problem, this paper proposes kernel-level partitioning and combining operations. At the kernel level, splitting and merging files can be done with very little overhead by modifying the file system metadata. We have designed the proposed algorithm in detail and implemented it in the Linux Ext4 file system. In our experiments with the real Cloud storage system, our technique has achieved a transfer time of up to only 17% compared to the case of transferring split files. It also confirmed that the time required can be reduced by up to 0.5% compared to the existing user-level method.

• 대한임베디드공학회논문지
• /
• 제18권1호
• /
• pp.31-40
• /
• 2023

Recent advances in flash technologies, such as 3D processing and multileveling schemes, have successfully increased the flash capacity. Unfortunately, these technology advances significantly degrade flash's reliability due to a smaller cell geometry and a finer-grained cell state control. In this paper, we propose an asymmetric BER-aware reliability optimization technique (aBARO), new flash optimization that improves the flash reliability. To this end, we first reveal that bit errors of 3D NAND flash memory are highly skewed among flash cell states. The proposed aBARO exploits the unique per-state error model in flash cell states by selecting the most error-prone flash states and by forming narrow threshold voltage distributions (for the selected states only). Furthermore, aBARO is applied only when the program time (tPROG) gets shorter when a flash cell becomes aging, thereby keeping the program latency of storage systems unchanged. Our experimental results with real 3D MLC and TLC flash devices show that aBARO can effectively improve flash reliability by mitigating a significant number of bit errors. In addition, aBARO can also reduce the read latency by 40%, on average, by suppressing the read retries.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 춘계학술발표대회
• /
• pp.42-44
• /
• 2015

네트워크 속도가 발전되고 하드디스크의 비용이 감소함에 따라 NAS(Network Access Storage) 시장이 빠르게 발전하고 있다. 현재 상용화된 많은 NAS는 고성능의 하드웨어를 기반으로 하기 때문에 높은 가격대를 형성하고 있다. 본 논문에서는 NAS Management Software를 임베디드 보드에 최적화하기 위해 어떠한 요소들이 NAS의 성능에 영향을 미치는지 분석한다. 이후 운영체제에서 관리하는 파일 시스템을 데이터베이스 또는 세션에 옮기는 방법을 제안한다. 마지막으로 기존의 시스템과 비교를 통해 우수성을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.