• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.5
• /
• pp.379-387
• /
• 2019

The complexity of path planning for visiting multiple mission points is even larger than that of single pair path planning. Deciding a path for visiting n mission points requires conducting $n^2+n$ times of single pair path planning. We propose Multiple Mission $D^*$ Lite($MMD^*L$) which is an optimal path planning algorithm for visiting multiple mission points in dynamic environments. $MMD^*L$ reduces the complexity by reusing the computational data of preceding single pair path planning. Simulation results show that the complexity reduction is significant while its path optimality is not compromised.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1087-1094
• /
• 1987

In this paper, we describe about polygon resizing porblem where the given polygons are expanded or shrunk in two dimensional plane. First, the definition of polygon resizing and it's problems are given, then the enhanced XY method is proposed: the polygon resizing can be completed in one directional sweep of plane only, usisng enhanced plane sweep method. The time complexity is 0(n log n), and space complexity 0(\ulcorner), where n is the number of verties of polygons. The applications of polygon resizing to the mask artwork processing and layout verification are discussed.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.371-374
• /
• 2000

This paper proposes a 16-bit ${\times}$ 16-bit multiplier for 2 twos-complement binary numbers with tree-like structure and implements it on a FPGA. The space and time complexity analysis shows that the 16-bit Tree-like multiplier represents lower circuit complexity and computes more quickly than both Booth array multiplier md Modified array multiplier.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1837-1838
• /
• 2010

기존 hierarchical clustering 은 Time complexity 와 space complexity 가 Large data set 을 clustering 하기에는 적당하지 못하며 이것을 일반 PC 의 메모리 내에서 해결하는데 어려움이 있다. 따라서 본 연구에서는 이러한 어려움을 극복하기 위해 기존 Hierarchical clustering 중 Centroid Linkage 에 새로운 Algorithm 을 제안하여 보다 적은 메모리를 사용하고 빠르게 처리하는 방법을 제안하고자 한다.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.136-140
• /
• 2006

In this paper, we consider the detection of orthogonal space-time block codes (OSTBCs) without channel state information (CSI) at the receiver. Based on the conventional blind cyclic decoder, we propose an enhanced blind cyclic decoder which has higher system performance than the conventional one. Furthermore, the proposed decoder offers low complexity since it does not require the computation of singular value decomposition.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.13-16
• /
• 1999

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. As an extension of PN code acquisition algorithm using one auxiliary code introduced by Salih in 1996, we propose a more and optimal (hardware / time / space complexity wise) algorithm by using a vector space approach. We outline some important differences between our algorithm and that introduced by Salih and in the process point out some advantages of our algorithm.

• Journal of the Korean Institute of Traditional Landscape Architecture
• /
• v.28 no.2
• /
• pp.75-85
• /
• 2010

The purpose of this study is to attempt new analysis on Soswaewon Garden(瀟灑園) where is Korea's traditional garden, focusing on which the tendency of its change is a relational-formation tool similar to the Eastern Mode of Thought, with paying attention to conversion as the new view of world. Accordingly, the aim is to reanalyze by connecting with Soswaewon Garden based on the theory of complexity, which tries to look at the whole through relationship rather than characteristics in individual components. Given summarizing findings, those are as follows. First, it was found that complexity shown in space and open system of physical dimension was characterized by 'event(situation)', 'non-determination' and 'homogeneous relationships between part and whole', and a variety of techniques introduced the nature positively. In particular, it was found that there were many cases of topographic usage, since the Soswaewon Garden selected its construction site proactively and was a product from architectural works in compliance with a given flow of natural topography. This has a nature of open text in the situation of emergent behaviors. Second, it was found that complexity shown in experiences and open system on the invisible dimension was characterized primarily by 'event(situation)' and 'relationships of interactive response between actors and environment', and various techniques appeared as a space for interactive combination of nature and daily experiences. This is typical of bilateral harmony based on interactions between subject and object, and between mankind and nature, and becomes also a space to accommodate temporary emergent behaviors in our life. Third, the compositional elements are reconstituted as space of organic property with dismantling steady relations. Especially, 'Soswaewon Garden's 48 poems(瀟灑園四十八詠)' will be the origin of the emotionally spatial experience to the current performers. Ultimately, the performer in the space of Soswaewon Garden simultaneously becomes a creator of space, and will generate new space with intertextuality with environment. Therefore, Soswaewon Garden becomes a place of binding me and the other together while maintaining mutual relationship based on organic thinking between a human being and nature and between the whole and a part.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.113-117
• /
• 1998

We propose a way to show the inherent learning complexity for the multilayer perceptron. We display the solution space and the error surfaces on the input space of a single neuron with two inputs. The evolution of its weights will follow one of the two error surfaces. We observe that when we use the back-propagation(BP) learning algorithm (1), the wight cam not jump to the lower error surface due to the implicit continuity constraint on the changes of weight. The self-relaxation approach is to explicity find out the best combination of all neurons' two error surfaces. The time complexity of training a multilayer perceptron by self-relaxationis exponential to the number of neurons.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.735-743
• /
• 2016

This paper proposes a direction-of-arrival (DOA)-based beamforming approach for multi-cell massive multiple-input multiple-output systems with uniform rectangular arrays (URAs). The proposed approach utilizes the steering vectors of the URA to form a basis of the spatial space and selects the partial space for beamforming according to the DOA information. As a result, the proposed approach is of lower computational complexity than the existing methods which utilize the channel covariance matrices. Moreover, the analysis demonstrates that the proposed approach can eliminate the interference in the limit of infinite number of the URA antennas. Since the proposed approach utilizes the multipaths to enhance the signal rather than discarding them, the proposed approach is of better performance than the existing low-complexity method, which is verified by the simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.954-961
• /
• 2004

In this paper, we propose a STF(Space-Time-Frequency) coded OFDM(Orthogonal Frequency Division Multiplexing) transmission scheme as an attractive solution for high bit rate data transmission in a multipath fading environment. The STF-OFDM transmission scheme that we propose in this paper is a simple transmission cheme for achieving frequency diversity gain with low complexity. Using preceding in frequency domain, we obtain frequency diversity gain and improve the SER performance of conventional ST-OFDM. The preceding scheme proposed in this paper is a very simple method that can be encoded and decoded with low complexity.