• Title/Summary/Keyword: 공간 복잡도

Search Result 1,901, Processing Time 0.033 seconds

Key Point Extraction from LiDAR Data for 3D Modeling (3차원 모델링을 위한 라이다 데이터로부터 특징점 추출 방법)

  • Lee, Dae Geon;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.5
    • /
    • pp.479-493
    • /
    • 2016
  • LiDAR(Light Detection and Ranging) data acquired from ALS(Airborne Laser Scanner) has been intensively utilized to reconstruct object models. Especially, researches for 3D modeling from LiDAR data have been performed to establish high quality spatial information such as precise 3D city models and true orthoimages efficiently. To reconstruct object models from irregularly distributed LiDAR point clouds, sensor calibration, noise removal, filtering to separate objects from ground surfaces are required as pre-processing. Classification and segmentation based on geometric homogeneity of the features, grouping and representation of the segmented surfaces, topological analysis of the surface patches for modeling, and accuracy assessment are accompanied by modeling procedure. While many modeling methods are based on the segmentation process, this paper proposed to extract key points directly for building modeling without segmentation. The method was applied to simulated and real data sets with various roof shapes. The results demonstrate feasibility of the proposed method through the accuracy analysis.

Design of MSB-First Digit-Serial Multiplier for Finite Fields GF(2″) (유한 필드 $GF(2^m)$상에서의 MSB 우선 디지트 시리얼 곱셈기 설계)

  • 김창훈;한상덕;홍춘표
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.625-631
    • /
    • 2002
  • This paper presents a MSB-first digit-serial systolic array for computing modular multiplication of A(x)B(x) mod G(x) in finite fields $GF(2^m)$. From the MSB-first multiplication algorithm in $GF(2^m)$, we obtain a new data dependence graph and design an efficient digit-serial systolic multiplier. For circuit synthesis, we obtain VHDL code for multiplier, If input data come in continuously, the implemented multiplier can produce multiplication results at a rate of one every [m/L] clock cycles, where L is the selected digit size. The analysis results show that the proposed architecture leads to a reduction of computational delay time and it has much more simple structure than existing digit-serial systolic multiplier. Furthermore, since the propose architecture has the features of unidirectional data flow and regularity, it shows good extension characteristics with respect to m and L.

Triangulation Algorithm for Multi-user Spatial Multiplexing in MIMO Downlink Channels (MIMO 다운링크 채널에서 다중사용자 공간다중화를 위한 알고리즘)

  • Lee, Heun-Chul;Paulraj, Aroyaswami;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.45-54
    • /
    • 2010
  • This paper studies the design of a multiuser multiple-input multiple-output (MIMO) system, where a base station (BS) transmits independent messages to multiple users. The remarkable "dirty paper coding (DPC)" result was first presented by Costa that the capacity does not change if the Gaussian interference is known at the transmitter noncausally. While several implementable DPC schemes have been proposed recently for single-user dirty-paper channels, DPC is still difficult to implement directly in practical multiuser MIMO channels. In this paper, we propose a network channel matrix triangulation (NMT) algorithm for utilizing interference known at the transmitter. The NMT algorithm decomposes a multiuser MIMO channel into a set of parallel, single-input single-output dirty-paper subchannels and then successively employs the DPC to each subchannel. This approach allows us to extend practical single-user DPC techniques to multiuser MIMO downlink cases. We present the sum rate analysis for the proposed scheme. Simulation results show that the proposed schemes approach the sum rate capacity of the multiuser MIMO downlink at moderate signal-to-noise ratio (SNR) values.

Remarshalling Plan Using Neighboring Bay in Container Terminal (컨테이너 터미널에서 이웃 베이를 활용한 컨테이너 재정돈 계획)

  • Park, Young-Kyu
    • Journal of Navigation and Port Research
    • /
    • v.40 no.3
    • /
    • pp.113-120
    • /
    • 2016
  • If there are containers stacked upon the container to be fetched out of a container yard to vessel, rehandling which moves those containers to other places temporarily is needed. In order to avoid such rehandling, remarshalling which rearranges containers should be done before the vessel arrives. The remarshalling plan is commonly generated within a bay. It happens, however, that the generation of the intra-bay remarshalling plan within the permitted time is not possible because of bad stacking conditions. This paper presents the remarshalling algorithm which uses the empty slots of the neighboring bay as a temporary storage space. Simulation experiments have shown that the presented algorithm can generate the remarshalling plan within the permitted time under any staking conditions.

Harmonics Control of Electric Propulsion System using Direct Torque Control (직접벡터제어방식을 사용하는 전기추진시스템의 고조파 제어)

  • Kim, Jong-Su;Oh, Sae-Gin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2618-2624
    • /
    • 2009
  • Harmonics (or distortion in wave form) has always existed in electrical power systems. It is harmless as long as its level is not substantial. However, with the recent rapid advancement of power electronics technology, so-called nonlinear loads, such as variable frequency drives for motor power/speed control, are increasingly finding their way to shipboard or offshore applications. In this paper a new approach to direct torque control (DTC) of induction motor drive is presented. In comparison with the conventional DTC methods the inverter switching frequency is constant and is dramatically increased, requiring neither any increase of the sampling frequency, nor any high frequency dither signal. The well-developed space vector modulation technique is applied to inverter control in the proposed DTC-based induction motor drive system, thereby dramatically reducing the current harmonics. As compared to the existing DTC approach with constant inverter switching frequency, the presented new approach does not invoke any concept of deadbeat control, thereby dramatically reducing the computations.

Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees (선형 사진트리의 선형이동을 위한 상수시간 RMESH 알고리즘)

  • Kim, Kyung-Hoon;Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.207-214
    • /
    • 2003
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

Development of 2D inundation model based on adaptive cut cell mesh (K-Flood) (적응적 분할격자 기반 2차원 침수해석모형 K-Flood의 개발)

  • An, Hyunuk;Jeong, Anchul;Kim, Yeonsu;Noh, Joonwoo
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.10
    • /
    • pp.853-862
    • /
    • 2018
  • An adaptive cut-cell grid based 2D inundation analysis model, K-Flood, is developed in this study. Cut cell grid method divides a grid into a flow area and a non-flow area depending the characteristics of the flows. With adaptive mesh refinement technique cut cell method can represent complex flow area using relatively small number of cells. In recent years, the urban inundation modeling using high resolution and fine quality data is increasing to achieve more accurate flood analysis or flood forecasting. K-Flood has potential to simulate such complex urban inundation using efficient grid generation technique. A finite volume numerical scheme of second order accuracy for space and time was applied. For verification of K-Flood, 1) shockwave reflex simulation by circular cylinder, 2) urban flood experiment simulation, 3) Malpasset dam collapse simulation are performed and the results are compared with observed data and previous simulation results.

Multiple-Relay-assisted SSB SFBC SC-FDMA Transmission System (다중중계기 기반의 SSB SFBC SC-FDMA 시스템)

  • Won, HuiChul
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.2
    • /
    • pp.29-37
    • /
    • 2020
  • This paper proposes a multiple-relay-assisted single side band (SSB) space frequency block code (SFBC) single carrier (SC)-frequency division multiple access (FDMA) system and measures the performance of SSB SFBC SC-FDMA transmission system with the signal-to-noise power ratio SNR) between relays and a destination station. As we know, the performance of relay-assisted transmission systems can be easily improved by re-transmitting to the destination station after applying block code to the recovered transmitted signals of relays. In this paper, the performance improvement of the relay-assisted SSB SC-FDMA system can be obtained without any significant increase of system computational complexity by implementing block code with the complex conjugates symmetric characteristic of SSB system. The simulation result shows that the SNR performance of the proposed multiple-relay-assisted SSB SFBC SC-FDMA system is about 4 dB better than the performance of the single-relay-assisted SSB SC-FDMA system at the symbol error rate of 10-2.

Ground Station Antenna Pattern Design for Network-Based UAV Command and Control Communication Systems (네트워크 기반 무인기 제어 통신시스템을 위한 지상국 안테나 패턴 설계)

  • Kim, Kyung-Ho;Kim, Hee Wook;Jung, Young-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.5
    • /
    • pp.384-389
    • /
    • 2021
  • An optimal ground station (GS) antenna pattern design method for network-based UAV command and control communication systems considering complexity and performance is presented. The GS antenna consists of multiple side sectors and one upward sector. The antenna gain for each vertical/horizontal angle of the GS antenna according to the change of antenna design parameters such as the number of sectors, horizontal and vertical beam-width, and tilt-angle is modeled, and the effect of the parameter changes on the signal-to-noise ratio (SNR) distribution in the virtual three-dimensional space is analyzed. It is observed that the tilt-angle of the side sectors has the greatest effect on the performance, and the longer the distance between GSs, the higher the maximum altitude and the smaller the number of side sectors, the tilt-angle should be lower. In addition, it is observed that the wider vertical beam-width of the side sector is advantageous in maximizing the lowest SNR, but narrow vertical beam-width is advantageous in maximizing the average SNR.

A New Parallel Multiplier for Type II Optimal Normal Basis (타입 II 최적 정규기저를 갖는 유한체의 새로운 병렬곱셈 연산기)

  • Kim Chang-Han;Jang Sang-Woon;Lim Jong-In;Ji Sung-Yeon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.4
    • /
    • pp.83-89
    • /
    • 2006
  • In H/W implementation for the finite field, the use of normal basis has several advantages, especially, the optimal normal basis is the most efficient to H/W implementation in GF($2^m$). In this paper, we propose a new, simpler, parallel multiplier over GF($2^m$) having a type II optimal normal basis, which performs multiplication over GF($2^m$) in the extension field GF($2^{2m}$). The time and area complexity of the proposed multiplier is same as the best of known type II optimal normal basis parallel multiplier.