• Title/Summary/Keyword: Embedded File System

Search Result 161, Processing Time 0.033 seconds

Information Hiding Technique in Smart Phone for the Implementation of GIS Web-Map Service (GIS 웹 맵 서비스 구현을 위한 스마트 폰에서의 정보은닉 기법)

  • Kim, Jin-Ho;Seo, Yong-Su;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.710-721
    • /
    • 2010
  • Recently, for the advancement of embedded technology about mobile device, a new kind of service, mash-up is appeared. It is service or application combining multimedia content making tool or device and web-GIS(geographic information system) service in the mobile environment. This service can be ease to use for casual user and can apply in various ways. So, It is served in web 2.0 environment actively. But, in the mashup service, because generated multimedia contents linked with web map are new type of multimedia contents which include user's migration routes in the space such as GPS coordinates. Thus, there are no protection ways for intellectual property created by GIS web-map service users and user's privacy. In this paper, we proposed a location and user information hiding scheme for GIS web-map service. This scheme embeds location and user information into a picture that is taken by camera module on the mobile phone. It is not only protecting way for user's privacy but is also tracing way against illegal photographer who is peeping person through hidden camera. And than, we also realized proposed scheme on the mobile smart phone. For minimizing margin of error about location coordinate value against contents manipulating attacks, GPS information is embedded into chrominance signal of contents considering weight of each digit about binary type of GPS coordinate value. And for tracing illegal photographer, user information such as serial number of mobile phone, phone number and photographing date is embedded into frequency spectrum of contents luminance signal. In the experimental results, we confirmed that the error of extracted information against various image processing attacks is within reliable tolerance. And after file format translation attack, we extracted embedded information from the attacked contents without no damage. Using similarity between extracted one and original templete, we also extracted whole information from damaged chrominance signal of contents by various image processing attacks.

A Fully Synthesizable Bluetooth Baseband Module for a System-on-a-Chip

  • Chun, Ik-Jae;Kim, Bo-Gwan;Park, In-Cheol
    • ETRI Journal
    • /
    • v.25 no.5
    • /
    • pp.328-336
    • /
    • 2003
  • Bluetooth is a specification for short-range wireless communication using the 2.4 GHz ISM band. It emphasizes low complexity, low power, and low cost. This paper describes an area-efficient digital baseband module for wireless technology. For area-efficiency, we carefully consider hardware and software partitioning. We implement complex control tasks of the Bluetooth baseband layer protocols in software running on an embedded microcontroller. Hardware-efficient functions, such as low-level bitstream link control; host controller interfaces (HCIs), such as universal asynchronous receiver transmitter (UART) and universal serial bus (USB)interfaces; and audio Codec are performed by dedicated hardware blocks. Furthermore, we eliminate FIFOs for data buffering between hardware functional units. The design is done using fully synthesizable Verilog HDL to enhance the portability between process technologies so that our module can be easily integrated as an intellectual property core no system-on-a-chip (SoC) ASICs. A field programmable gate array (FPGA) prototype of this module was tested for functional verification and realtime operation of file and bitstream transfers between PCs. The module was fabricated in a $0.25-{\mu}m$ CMOS technology, the core size of which was only 2.79 $mm{\times}2.80mm$.

  • PDF

Design of an Efficient FTL Algorithm Exploiting Locality Based on Sector-level Mapping (Locality를 이용한 섹터 매핑 기법의 효율적인 FTL 알고리듬)

  • Hong, Soo-Jin;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.818-826
    • /
    • 2011
  • This paper proposes a novel FTL (Flash Translation Layer) algorithm employing sector-level mapping technique based on locality to reduce the number of erase operations in flash memory accesses. Sector-level mapping technique shows higher performance than other mapping techniques, even if it requires a large mapping table. The proposed algorithm reduces the size of mapping table by employing dynamic table update, processes sequential writes by exploiting sequential locality and extracts hot sector in random writes. Experimental results show that the number of erase operations has been reduced by 75.4%, 65.8%, and 10.3% respectively when compared with well-known BAST, FAST and sector mapping algorithms.

A Car Black Box Video Data Integrity Assurance Scheme Using Cyclic Data Block Chaining (순환형 데이터 블록 체이닝을 이용한 차량용 블랙박스의 영상 데이터 무결성 보장 기법)

  • Yi, Kang;Kim, Kyung-Mi;Cho, Yong Jun
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.982-991
    • /
    • 2014
  • The integrity assurance of recorded video by car black boxes are necessary as the car black box is becoming more popular. In this paper, we propose a video data integrity assurance scheme reflecting the features of car black box. The proposed method can detect any kind of deletion, insertion, modification of frames by cyclic chaining using inter block relation. And, it provides the integrity assurance function consistently even in cases of file overwriting because of no more free space in storage, partial file data lost. And non-repudiation is supported. Experimental results with a car black box embedded system with A8 application processor show that our method has a feasible computational overhead to process full HD resolution video at 30 frames per second in a real time.

An Evaluation of Multimedia Data Downstream with PDA in an Infrastructure Network

  • Hong, Youn-Sik;Hur, Hye-Sun
    • Journal of Information Processing Systems
    • /
    • v.2 no.2
    • /
    • pp.76-81
    • /
    • 2006
  • A PDA is used mainly for downloading data from a stationary server such as a desktop PC in an infrastructure network based on wireless LAN. Thus, the overall performance depends heavily on the performance of such downloading with PDA. Unfortunately, for a PDA the time taken to receive data from a PC is longer than the time taken to send it by 53%. Thus, we measured and analyzed all possible factors that could cause the receiving time of a PDA to be delayed with a test bed system. There are crucial factors: the TCP window size, file access time of a PDA, and the inter-packet delay that affects the receiving time of a PDA. The window size of a PDA during the downstream is reduced dramatically to 686 bytes from 32,581 bytes. In addition, because flash memory is embedded into a PDA, writing data into the flash memory takes twice as long as reading the data from it. To alleviate these, we propose three distinct remedies: First, in order to keep the window size at a sender constant, both the size of a socket send buffer for a desktop PC and the size of a socket receive buffer for a PDA should be increased. Second, to shorten its internal file access time, the size of an application buffer implemented in an application should be doubled. Finally, the inter-packet delay of a PDA and a desktop PC at the application layer should be adjusted asymmetrically to lower the traffic bottleneck between these heterogeneous terminals.

Implementations of Record_Level Synchronized Safe Personal Cloud (레코드 단위의 동기화를 지원하는 개별 클라우드 구현 기법)

  • Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.3
    • /
    • pp.239-244
    • /
    • 2014
  • As the usefulness of mobile device is kept growing the privacy of the cloud computing is receiving more attentions. Even though many researches and solutions for privacy matters are suggested we are still worrying about the security problems. In addition most of cloud computing systems uses file-level synchronization which make it difficult to modify a part of a file. If we use data-centric app that stores data on embedded DBMS such as SQLite, a simple synchronization may incur some loss of information. In this paper we propose a solution to build a personal cloud that supports record-level synchronization. And we show a prototype system which uses RESTful web services and the same schema on mobie devices and the cloud storage. Synchronization is achieved by using a kind of optimistic concurrency control.

A Transformation Method of Polygon Data for Visualization of Height Map in SEDRIS (SEDRIS에서 높이맵의 가시화를 위한 폴리곤 데이터 변환 방법)

  • Son, Hyun-Seung;Kim, Young-Chul
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.6
    • /
    • pp.135-140
    • /
    • 2015
  • The Cyber-Physical Systems (CPS) complexly perform modeling and simulation (M&S) for the various embedded systems. In this case, due to use diverse formatted models, we suggest to apply with the SEDRIS to systematically manage the different formatted data on M&S. The SEDRIS can reduce time and cost with reusing and interoperating environment data developed in the specific domain. To do this, we should input the data transformed the height map for terrain representation in a simulator into raster data of SEDRIS for which interoperate between the existed simulator and the SEDRIS. To solve the problem, we propose the transformation method to transfer the polygon data from RAW file used in terrain representation. With the proposed method, we can provide two advantages. First, it can possibly express the environment data into SEDRIS. Second, we can see the terrain like an image file through a viewer. Therefore, even non-expert easily constructs the terrain environment data.

Expanding Code Caches for Embedded Java Systems using Client Ahead-Of-Time Compilation (내장형 자바 시스템을 위한 클라이언트 선행 컴파일 기법을 이용한 코드 캐시 확장)

  • Hong, Sung-Hyun;Kim, Jin-Chul;Shin, Jin-Woo;Kwon, Jin-Woo;Lee, Joo-Hwan;Moon, Soo-Mook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.8
    • /
    • pp.868-872
    • /
    • 2010
  • Many embedded Java systems are equipped with limited memory, which can constrain the code cache size provided for Java just-in-time compilation, affecting the Java performance. This paper proposes expanding the limited code cache when it is full, by saving the machine code for some methods in the code cache into the file system of the permanent storage and reloading it to the code cache when they are re-invoked later. This is applying the client ahead-of-time compilation during the execution time for the purpose of enlarging the code cache. Our experimental results indicate that the proposed execution method can improve the performance by as much as 1.6 times compared to the conventional method, when the code cache size is reduced by half.

Design and Implementation of Flash Translation Layer with O(1) Crash Recovery Time (O(1) 크래시 복구 수행시간을 갖는 FTL의 설계와 구현)

  • Park, Joon Young;Park, Hyunchan;Yoo, Chuck
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.10
    • /
    • pp.639-644
    • /
    • 2015
  • The capacity of flash-based storage such as Solid State Drive(SSD) and embedded Multi Media Card(eMMC) is ever-increasing because of the needs from the end-users. However, if a flash-based storage crashes, such as during power failure, the flash translation layer(FTL) is responsible for the crash recovery based on the entire flash memory. The recovery time increases as the capacity of the flash-based storages increases. We propose O1FTL with O(1) crash recovery time that is independent of the flash capacity. O1FTL adopts the working area technique suggested for the flash file system and evaluates the design on a real hardware platform. The results show that O1FTL achieves a crash recovery time that is independent of the capacity and the overhead, in terms of I/O performance, and achieves a low P/E cycle.

An Analysis on Building Steps of LFS Linux System (LFS 리눅스 시스템 구축 과정 분석)

  • Lee, Kyesang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.316-321
    • /
    • 2017
  • With the recent wide adoption of Linux in the fields of IoT, embedded, mobile, desktop and server industries, the importances of understanding the Linux system architecture as well as customizing the Linux system are increasing very steeply. Accordingly, the capabilities of building every component of Linux system from source code files have been important. The LFS (Linux From Scratch) site[1] guides the steps of building the basic Linux system from source files. The steps consist of build host preparation step, temporary system building step, final system building step, and system configuration and boot preparation step. However, the underlying concepts behind the steps used in building LFS are difficult to understand, particularly to the beginner. This paper analyzes the LFS build steps and reveal the core build concepts and principles used in each step. Additionally, this paper shows the measured package build times obtained from our build experience.