• Title/Summary/Keyword: Memory Mapping

Search Result 215, Processing Time 0.03 seconds

Multiple-symbol Nonlinear Continuous Phase Frequency Shift Keying (다중 심볼 비선형 연속 위상 주파수 천이 변조)

  • 주판유;송명규;홍성권;강성진;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.10
    • /
    • pp.2660-2669
    • /
    • 1996
  • In this paper, it is called nonlinear-symbol CPFSK(NCPFSK) which is modulated by the nonlinear function of information carrying phase function within all symbol interval produce time invariant trellis structure. In general, the bit error probability performance of CPFSK modultion scheme within given signal constellation is determined from the number of memory elementsof continuous phase encoder, i.e. number of state. In this paper the number of state of analyticall designed NCPFSK is time invariant. And the nonlinear symbol mapping function of the proposed moudlation produces the nonlinear symbol andthe phase state of the modulation for updating the phase function of NCPFSK. It si shown in this paper nonlinear symbol CPFSK with multiple TCM to make further improvements in d$^{2}$, and analyzed BER performance in AWGN channel envioronments.hannel envioronments.

  • PDF

A Study on Octree Construction Algorithm for 3D Objects (3차원 물체에 대한 8진 트리 구성 알고리즘에 관한 연구)

  • 최윤호;송유진;홍민석;박상희
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.1
    • /
    • pp.1-10
    • /
    • 1992
  • This study presents a complete octree construction algorithm for 2D depth images obtained from orthogonal face views, which can represent 3D objects exactly. In constructing quadtree, optimal quadtree construction algorithm is applied to depth images for efficient use of memory and reduction of tree construction time. In addition, pseudo-octrees are constructed by using our proposed method, which construct pseudo-octrees according to the resolution value given in each node of constructed quadtree and mapping relation between quadrants and octants. Finally, a complete octree, which represents a 3D object, is constructed by volume intersection with each constructed pseudo-octree. The representation accuracy of a complete octree constructed by our algorithm is investigated by using a 3D display method and a volume ratio method for a complete octree.

  • PDF

Speech Recognition Using Recurrent Neural Prediction Models (회귀신경예측 모델을 이용한 음성인식)

  • 류제관;나경민;임재열;성경모;안성길
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.11
    • /
    • pp.1489-1495
    • /
    • 1995
  • In this paper, we propose recurrent neural prediction models (RNPM), recurrent neural networks trained as a nonlinear predictor of speech, as a new connectionist model for speech recognition. RNPM modulates its mapping effectively by internal representation, and it requires no time alignment algorithm. Therefore, computational load at the recognition stage is reduced substantially compared with the well known predictive neural networks (PNN), and the size of the required memory is much smaller. And, RNPM does not suffer from the problem of deciding the time varying target function. In the speaker dependent and independent speech recognition experiments under the various conditions, the proposed model was comparable in recognition performance to the PNN, while retaining the above merits that PNN doesn't have.

  • PDF

A Study on the Method for detecting Stealth Native API calls in User-mode (유저 모드 기반의 은닉된 네이티브 API 호출 탐지 기법 연구)

  • Choe, Sim Hyeon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.264-267
    • /
    • 2018
  • 본 연구에서는 API 호출을 은닉할 수 있는 새로운 유형의 유저모드 기반 루트킷으로 Cuckoo Sandbox를 회피하는 기법과 이를 탐지하기 위한 연구를 한다. Cuckoo Sandbox의 행위 분석을 회피하기 위해 잠재적으로 출현 가능한 은닉된 코드 이미지 기반의 신종 루트킷 원리를 연구하고 탐지하기 위한 방안을 함께 연구한다. 네이티브 API 호출 코드 영역을 프로세스 공간에 직접 적재하여 네이티브 API를 호출하는 기법은 Cuckoo Sandbox에서 여전히 잠재적으로 행위 분석 회피가 가능하다. 본 연구에서는 은닉된 외부주소 호출 코드 영역의 탐지를 위해 프로세스의 가상메모리 공간에서 실행 가능한 페이지 영역을 탐색 후 코사인 유사도 분석으로 이미지 탐지 실험을 하였으며, 코드 영역이 맵핑된 정렬 단위의 4가지 실험 조건에서 평균 83.5% 유사도 탐지 결과를 확인하였다.

Observation of the domain using secondary electron microscopy with polarization analysis(SEMPA)

  • Lee, Sang-Seon;Park, Yong-Seong;Kim, Won-Dong;Hwang, Chan-Yong
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2010.02a
    • /
    • pp.396-396
    • /
    • 2010
  • 최근에 자구벽 이동을 이용한 race track memory, 혹은 나노자성체의 자구 동역학 등에 대한 관심이 집중되고 있다. 용량은 하드디스크의 크기를 가지며 속도는 SRAM, 집적도는 DRAM에 필적하는 새로운 메모리의 실현은 지금까지 이용되는 대부분의 메모리를 대체할 가능성이 있다. 이러한 메모리의 개발에 가장 기본이 되는 측정기술은 나노크기의 자성 구조체에서 자구 혹은 자구벽 이동을 측정하는 기술로써 현재 국내에서 자성 나노구조의 자화방향과 더불어 topography를 동시에 측정할 수 있는 장치는 본 SEMPA가 유일하다. SEMPA는 기존에 사용되어지던 SEM(전자 현미경) 에서 알 수 있는 나노 구조의 형상이외에 전자의 스핀방향을 검출함으로써 형상과 스핀의 결함된 imaging 을 할 수 있다. 일반적으로 기존의 SEM의 경우 고 에너지빔의 전자빔을 주사시키고 이때 발생되는 이차 전자의 수를 2차원상의 영역에 따라 달라지는 비로 mapping 을 하게 된다. 이때 전자의 수뿐만 아니라 이들의 스핀편향(spin polarization) 을 측정할 수 있다면 형상뿐만 아니라 표면에서의 스핀상태를 동시에 측정 할 수 있게 된다. 본 발표에서는 이 방법을 이용하여 나노구조체의 자구측정 결과를 제시하고자 한다.

  • PDF

Parallel algorithm of global routing for general purpose associative processign system (법용 연합 처리 시스템에서의 전역배선 병렬화 기법)

  • Park, Taegeun
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.4
    • /
    • pp.93-102
    • /
    • 1995
  • This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

  • PDF

Selective Page-Level Mapping Technique for Large-Scaled Flash Memory (대용량 플래시 메모리를 위한 선택적 페이지 변환 기법)

  • Byung-Doo Choi;Dongkun Shin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.864-867
    • /
    • 2008
  • 본 논문에서는 플래시 메모리를 효율적으로 관리하기 위하여 페이지 수준 주소 변환과 블록 수준 주소 변환을 선택적으로 적용하는 기법을 제시한다. 페이지 수준 변환을 사용하는 기존 FTL은 대용량의 주소 관리 정보를 플래시 메모리에 저장하여 성능과 사용측면에서 여러 문제점이 있다. 제안된 기법은 일부의 블록만 페이지 수준 주소 변환을 사용하고 나머지 블록은 블록 수준 주소변환을 이용하여 주소 관리 정보에 필요한 메모리 공간을 기존의 20% 수준으로 줄인 동시에 성능을 약 28%향상시켰다.

Development of System for Calculating Carbon Storage Amount of Roadside Tree Using Mobile Mapping System (멀티센서 융합 측위 시스템을 이용한 가로수 탄소저장량 산정 시스템 개발)

  • Kim, Jeong-Seob;Yang, Keum-Chul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.4
    • /
    • pp.536-543
    • /
    • 2017
  • This study developed a new methodology to evaluate the carbon storage using a Mobile Mapping System according to the life cycle of street trees. The system for calculating the carbon storage of a roadside tree using the MMS developed in this study consisted of a database, memory, processor, user interface, and communication module. The carbon storage was calculated for 261 trees in the Cheonan-Asan New Town (distance: 2.1 km, area: $283,698m^2$). The average biomass and carbon storage of Metasequoia glyptostroboides were highest at 34.5 kg and 17.3 kg C and Chionanthus retusa were lowest at 19.5 kg and 9.8 kg C, respectively. The total biomass and total carbon storage of Ginkgo biloba were highest at 5028.8 kg and 17.3 kg C and Chionanthus retusa were lowest at 780.7 kg and 390.3 kg C, respectively. Based on the roadside tree database, the amount of carbon storage in a given area was converted to Google format and visualized in 3D by GIS analysis.

A Kernel Module to Support High-Performance Intra-Node Communication for Multi-Core Systems (멀티 코어 시스템을 위한 고속 노드내 통신 지원 모듈)

  • Jin, Hyun-Wook;Kang, Hyun-Goo;Kim, Jong-Soon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.9
    • /
    • pp.407-415
    • /
    • 2007
  • In parallel cluster computing systems, the efficiency of communication between computing nodes is one of important factors that decide overall system performance. Accordingly, many researchers have studied on high-performance inter-node communication. The recently launched multi-core processor, however. increases the importance of intra-node communication as well because the more the number of cores in a node, the more the number of parallel processes running in the same node. Though there have been studies on intra-node communications, these have limited considerations on the state-of-the-art systems. In this paper, we propose a Linux kernel module that minimizes the number of data copy by exploiting the memory mapping mechanism for high-performance intra-node communication. The proposed kernel module supports the Linux kernel version 2.6. The performance measurements over a multi-core system present that the proposed kernel module can achieve lower latency up to 62% and higher throughput up to 144% than an existing kernel module approach. In addition, the measurements reveal that the performance of intra-node communication can vary significantly based on whether the cores that run the communication processes are belong to the same processor package (i.e., sharing the L2 cache).

High-resolution 3D Object Reconstruction using Multiple Cameras (다수의 카메라를 활용한 고해상도 3차원 객체 복원 시스템)

  • Hwang, Sung Soo;Yoo, Jisung;Kim, Hee-Dong;Kim, Sujung;Paeng, Kyunghyun;Kim, Seong Dae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.10
    • /
    • pp.150-161
    • /
    • 2013
  • This paper presents a new system which produces high resolution 3D contents by capturing multiview images of an object using multiple cameras, and estimating geometric and texture information of the object from the captured images. Even though a variety of multiview image-based 3D reconstruction systems have been proposed, it was difficult to generate high resolution 3D contents because multiview image-based 3D reconstruction requires a large amount of memory and computation. In order to reduce computational complexity and memory size for 3D reconstruction, the proposed system predetermines the regions in input images where an object can exist to extract object boundaries fast. And for fast computation of a visual hull, the system represents silhouettes and 3D-2D projection/back-projection relations by chain codes and 1D homographies, respectively. The geometric data of the reconstructed object is compactly represented by a 3D segment-based data format which is called DoCube, and the 3D object is finally reconstructed after 3D mesh generation and texture mapping are performed. Experimental results show that the proposed system produces 3D object contents of $800{\times}800{\times}800$ resolution with a rate of 2.2 seconds per frame.