• Title/Summary/Keyword: Remapping

Search Result 33, Processing Time 0.023 seconds

M-QAM Symbol Remapping Using LLR Soft Bit Information for Iterative Equalization (반복등화를 위한 LLR 연판정 비트 정보를 이용한 M-QAM 심벌 Remapping)

  • Kim, Geun-Bae;Park, Sang-Kyu
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.10
    • /
    • pp.1020-1023
    • /
    • 2011
  • In this paper, we present a symbol remapping method of BRGC M-ary QAM signal by using LLR soft bit decision information which is obtained after iterative decoding process. In order to reconstruct estimated transmitted signal constellation, we have to use exponential or hyperbolic tangent(tanh) function resulting in high implementation complexity. The BRGC mapping rule enables us to use a recursive operation. In addtion, we reduce the implementing complexity by using a curve fitting algorithm.

An OpenFlow User-Switch Remapping Approach for DDoS Defense

  • Wei, Qiang;Wu, Zehui;Ren, Kalei;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4529-4548
    • /
    • 2016
  • DDoS attacks have had a devastating effect on the Internet, which can cause millions of dollars of damage within hours or even minutes. In this paper we propose a practical dynamic defense approach that overcomes the shortage of static defense mechanisms. Our approach employs a group of SDN-based proxy switches to relay data flow between users and servers. By substituting backup proxy switches for attacked ones and reassigning suspect users onto the new proxy switches, innocent users are isolated and saved from malicious attackers through a sequence of remapping process. In order to improve the speed of attacker segregation, we have designed and implemented an efficient greedy algorithm which has been demonstrated to have little influence on legitimate traffic. Simulations, which were then performed with the open source controller Ryu, show that our approach is effective in alleviating DDoS attacks and quarantining the attackers by numerable remapping process. The simulations also demonstrate that our dynamic defense imposes little effect on legitimate users, and the overhead introduced by remapping procedure is acceptable.

Enhancing Single Thermal Image Depth Estimation via Multi-Channel Remapping for Thermal Images (열화상 이미지 다중 채널 재매핑을 통한 단일 열화상 이미지 깊이 추정 향상)

  • Kim, Jeongyun;Jeon, Myung-Hwan;Kim, Ayoung
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.3
    • /
    • pp.314-321
    • /
    • 2022
  • Depth information used in SLAM and visual odometry is essential in robotics. Depth information often obtained from sensors or learned by networks. While learning-based methods have gained popularity, they are mostly limited to RGB images. However, the limitation of RGB images occurs in visually derailed environments. Thermal cameras are in the spotlight as a way to solve these problems. Unlike RGB images, thermal images reliably perceive the environment regardless of the illumination variance but show lacking contrast and texture. This low contrast in the thermal image prohibits an algorithm from effectively learning the underlying scene details. To tackle these challenges, we propose multi-channel remapping for contrast. Our method allows a learning-based depth prediction model to have an accurate depth prediction even in low light conditions. We validate the feasibility and show that our multi-channel remapping method outperforms the existing methods both visually and quantitatively over our dataset.

A Study on the Optimal Stress Compensation to Dynamic Recrrystallization for the Estimation of Forming Loads (성형하중예측을 위한 재결저분율 보상의 최적조건 도출)

  • 장영원
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1999.03b
    • /
    • pp.131.1-134
    • /
    • 1999
  • The effect of dynamic recrystallization during hot forming process was implemented to a commercial FEM code by conditioned remeshing and remapping of sate variables. A datum strain for stress compensation was determined as a strain for maximum softening rate and was able to be formulated as a function of critical strain f($\varepsilon$). The validity of remapping criterion was examined by a series of mechanical tests and microstructural observation. The application of suggested datum resulted in better estimation of load-stroke during forging processes.

  • PDF

qtar: Design and Implementation of an Optimized tar Command with FTL-level Remapping (qtar: 플래시 변환 계층 리매핑 기법을 이용한 최적화된 tar 명령어 구현)

  • Ryoo, Jeongseok;Hahn, Sangwook Shane;Kim, Jihong
    • Journal of KIISE
    • /
    • v.45 no.1
    • /
    • pp.9-14
    • /
    • 2018
  • Tar is a Linux command that combines several files into a single file. Combining multiple small files into large files increases the compression efficiency and data transfer speed. However, tar has a problem in that smaller target files, result in a lower performance. In this paper, we show that this performance degradation occurs when tar reads the data from the target files and propose qtar (quick tar) to solve this problem via flash-level remapping. When the size of an I/O request is less than 1 MB, the I/O performance decreases proportionally to the decrease in size of the I/O request. Since tar reads the data of files one by one, a smaller file size results in a lower performance. Therefore, the remapping technique is implemented in qtar to read data from the target files at the maximum I/O size regardless of the size of each file. Our evaluations show that the execution time with qtar is reduced by up to 3.4 times compared to that with tar.

CacheSCDefender: VMM-based Comprehensive Framework against Cache-based Side-channel Attacks

  • Yang, Chao;Guo, Yunfei;Hu, Hongchao;Liu, Wenyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.6098-6122
    • /
    • 2018
  • Cache-based side-channel attacks have achieved more attention along with the development of cloud computing technologies. However, current host-based mitigation methods either provide bad compatibility with current cloud infrastructure, or turn out too application-specific. Besides, they are defending blindly without any knowledge of on-going attacks. In this work, we present CacheSCDefender, a framework that provides a (Virtual Machine Monitor) VMM-based comprehensive defense framework against all levels of cache attacks. In designing CacheSCDefender, we make three key contributions: (1) an attack-aware framework combining our novel dynamic remapping and traditional cache cleansing, which provides a comprehensive defense against all three cases of cache attacks that we identify in this paper; (2) a new defense method called dynamic remapping which is a developed version of random permutation and is able to deal with two cases of cache attacks; (3) formalization and quantification of security improvement and performance overhead of our defense, which can be applicable to other defense methods. We show that CacheSCDefender is practical for deployment in normal virtualized environment, while providing favorable security guarantee for virtual machines.

Generic Obstacle Detection on Roads by Dynamic Programming and Remapping of Stereo Images to a Virtual Top-View (스테레오영상의 가상의 탑뷰변환과 동적계획법에 의한 도로상의 장애물 검출)

  • Lee Ki Yong;Lee Joon Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.418-422
    • /
    • 2005
  • In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

SRAM Reuse Design and Verification by Redundancy Memory (여분의 메모리를 이용한 SRAM 재사용 설계 및 검증)

  • Shim Eun sung;Chang Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4A
    • /
    • pp.328-335
    • /
    • 2005
  • bIn this paper, built-in self-repair(BISR) is proposed for semiconductor memories. BISR is consisted of BIST(Buit-in self-test) and BIRU(Built-In Remapping Uint). BIST circuits are required not oがy to detect the presence of faults but also to specify their locations for repair. The memory rows are virtually divided into row blocks and reconfiguration is performed at the row block level instead of the traditional row level. According to the experimental result, we can verify algorithm for replacement of faulty cell.

Performance Analysis of Link-16 Waveform considering Frequency Remapping under PBNJ (부분대역 잡음 재밍 환경에서의 주파수 재할당을 고려한 Link-16 성능 분석)

  • Lee, Kyuman;Noh, Hongjun;Lee, Jongkwan;Lim, Jaesung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.11
    • /
    • pp.955-965
    • /
    • 2013
  • The joint tactical information distribution system (JTIDS) is used as the communication terminal of Link-16 by the United States armed forces, north atlantic treaty organization (NATO), and other allied forces. A portion of Link-16 frequencies may be shortly remapped to other systems owing to the growing demand for frequencies, especially in civil aviation, which is witnessing a constant increase in air traffic. This will affect the performance of Link-16. Therefore, in this paper, we analyze the effect of frequency band reduction on the performance of Link-16 waveform under partial-band noise jamming with Nakagami fading, via simulation and numerical analysis. The multi-net and anti-jamming performance of Link-16 with frequency remapping is compared with that of conventional Link-16 systems. The results show that the performance of Link-16 waveform is degraded with the reduction in frequencies. Nonetheless, Link-16 retains its jam resistance, and it can support multiple users in the same time slots.

A Virtual Machine Remapping Scheme for Reducing Relocation Time on a Cloud Cluster (클라우드 클러스터에서 가상머신 재배치시간을 단축하기 위한 재매핑 기법)

  • Kim, Chang-Hyeon;Kim, Jun-Sang;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.1-7
    • /
    • 2014
  • In this paper, we propose a virtual machine(VM) remapping scheme that reduces VM relocation time on a cloud cluster. The proposed scheme finds VMs that should be migrated in sequence from a given VM map, and exchanges destinations of some VMs among them to reduce the VM relocation time. The VMs, the destinations of which will be exchanged, are chosen based on the amount of physical machine's available resources and migration completion time. The exchange of destinations is repeated until the VM relocation time cannot be shortened any further. Through a simulation, we show that the proposed scheme reduces VM relocation time by 42.7% in maximum.