• Title/Summary/Keyword: Mobile digital device

Search Result 365, Processing Time 0.022 seconds

Implementation of Stopping Criterion Algorithm using Variance Values of LLR in Turbo Code (터보부호에서 LLR 분산값을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.149-157
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of LLR in turbo decoder, the proposed algerian can largely reduce the average number of iterations without BER performance degradation in all SNR regions. As a result of simulation, the average number of iterations in the upper SNR region is reduced by about $34.66%{\sim}41.33%$ compared to method using variance values of extrinsic information. the average number of iterations in the lower SNR region is reduced by about $13.93%{\sim}14.45%$ compared to CE algorithm and about $13.23%{\sim}14.26%$ compared to SDR algorithm.

gABC: A Text Entry Framework using Gamepad (gABC: 게임패드를 이용한 문자 입력 방법)

  • Min, Kyung-Ha
    • Journal of Korea Game Society
    • /
    • v.7 no.3
    • /
    • pp.67-76
    • /
    • 2007
  • As the performance of game consoles is so highly progressed that services such as internet browsing become available on the consoles, the need for text input schemes on game consoles is rapidly raised. In this paper, we present a text input method of alphabet characters and several symbols using a gamepad, which is a widely used input device for most game consoles. Just like other text input methods using gamepad, our method allows users to enter texts by manipulating the gamepad with a user interface displayed on the screen of the console. A key idea of this paper is to present the user interface that is similar to the $4{\times}3$ keypad on mobile phones. The motivation of this idea is a principle that the experience of using a text input tool can be transferred to another tool that has similar interface. Another motivation is that the keyboard-based interface is too complex to be easily manipulated by simple input from a keypad, which is four orthogonal directions and several fire signals. Since most of keys on keypad of $4{\times}3$ keys are represented by a combination of two orthogonal directions, users feel easier in entering texts using keypad-based interface. We prove this argument in this paper by a user test of ten subjects. After about two experiment sessions, subjects reach 13 WPM in average, which proves that the proposed text input method enables much faster text input than the existing keyboard-based text input methods.

  • PDF

A Study on Automatic Threshold Selection in Line Simplification for Pedestrian Road Network Using Road Attribute Data (보행자용 도로망 선형단순화를 위한 도로속성정보 기반 임계값 자동 선정 연구)

  • Park, Bumsub;Yang, Sungchul;Yu, Kiyun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.4
    • /
    • pp.269-275
    • /
    • 2013
  • Recently, importance of pedestrian road network is getting emphasized as it is possible to provide mobile device users with both route guidance services and surrounding spatial information. However, it costs a tremendous amount of budget for generating and renovating pedestrian road network nationally, which hinder further advances of these services. Hence, algorithms extracting pedestrian road network automatically based on raster data are needed. On the other hand, road dataset generated from raster data usually has unnecessary vertices which lead to maintenance disutility such as excessive turns and increase in data memory. Therefore, this study proposed a method of selecting a proper threshold automatically for separate road entity using not only Douglas-Peucker algorithm but also road attribute data of digital map in order to remove redundant vertices, which maximizes line simplification efficiency and minimizes distortion of shape of roads simultaneously. As a result of the test, proposed method was suitable for automatic line simplification in terms of reduction ratio of vertices and accuracy of position.

Implementation of Stopping Criterion Algorithm using Sign Change Ratio for Extrinsic Information Values in Turbo Code (터보부호에서 외부정보에 대한 부호변화율을 이용한 반복중단 알고리즘 구현)

  • Jeong Dae-Ho;Shim Byong-Sup;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.143-149
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations is increased in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using sign changed ratio of extrinsic information values in turbo decoder, the proposed algorithm can largely reduce the average number of iterations without BER performance degradation. As a result of simulations, the average number of iterations is reduced by about $12.48%{\sim}22.22%$ compared to CE algorithm and about $20.43%{\sim}54.02%$ compared to SDR algorithm.

Study on File Recovery Based on Metadata Accoring to Linux Kernel (리눅스 커널에 따른 메타데이터 기반 파일 복원 연구)

  • Shin, Yeonghun;Jo, Woo-yeon;Shon, Taeshik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.1
    • /
    • pp.77-91
    • /
    • 2019
  • Recent Linux operating systems having been increasingly used, ranging from automotive consoles, CCTV, IoT devices, and mobile devices to various versions of the kernel. Because these devices can be used as strong evidence in criminal investigations, there is a risk of destroying evidence through file deletion. Ext filesystem forensics has been studied in depth because it can recovery deleted files without depending on the kind of device. However, studies have been carried out without consideration of characteristics of file system which may vary depending on the kernel. This problem can lead to serious situations, such as those that can impair investigative ability and cause doubt of evidence ability, when an actual investigation attempts to analyze a different version of the kernel. Because investigations can be performed on various distribution and kernel versions of Linux file systems at the actual investigation site, analysis of the metadata changes that occur when files are deleted by Linux distribution and kernel versions is required. Therefore, in this paper, we analyze the difference of metadata according to the Linux kernel as a solution to this and recovery deleted file. After that, the investigating agency needs to consider the metadata change caused by the difference of Linux kernel version when performing Ext filesystem forensics.