• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.229-237
• /
• 2010

The conventional detection methods developed for spatially-multiplexed MIMO systems such as OSIC and QRD-M show performance difference for each user depending on the order of detection when they are applied to detection of multi-user signals in uplink multiuser systems based on collaborative spatial multiplexing. In this paper, a signal detection method for uplink multiuser systems based on collaborative spatial multiplexing is proposed to provide similar performance for each user while its performance is close to the case of ML detection. Compared with QRD-M method, computational complexity of the proposed signal detection method is similar in the case of QPSK, and significantly lower in the case of high modulation order with 16-QAM and 64-QAM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7C
• /
• pp.644-651
• /
• 2007

In multiple antenna systems, vertical Bell Labs Layered Space-Time (V-BLAST) systems enable very high throughput by nulling and cancelling at each layer detection. In this paper, we propose a V-BLAST system which combines with signal space diversity technique. The benefit of the signal space diversity is that we can obtain an additional gain without extra bandwidth and power expansion by applying inphase/quadrature interleaving and the constellation rotation. Through simulation results, it is shown that the performance of the proposed system is less than 0.5dB away from the ideal upper bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.487-495
• /
• 2007

When error occurs during the network transmission of the image, the quality of the restored image is very serious. Therefore to maintain the received image quality, the error concealment technique is necessary. This paper presents an efficient spatial error concealment method using adaptive edge-oriented interpolation. It deals with errors on slice level. The proposed method uses boundary matching method having 2-step processes. We divide error block into external and internal region, adaptively restore each region. Because this method use overall as well as local edge characteristics, it preserves edge continuity and texture feature. The proposed technique reduces the complexity and provide better reconstruction quality for damaged images than the previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2401-2406
• /
• 1999

Various techniques extracting feature vectors have been studied for the cut detection in compressed video data. In case of using the histogram of occurrence of pixel's values as a feature vector, the precise detection of cuts would not be expected because of not considering the spatial correlation of pixels. And more sophisticated algorithms such as CCV(Color Coherent Vector) and Correlrogram tend to be used. Though these methods can be able to detect cuts rather precisely, they require much more processing time because of a enormous amount of computations. In this paper we propose a method of the cut detection using spatial correlation of DC values of luminance components in MPEG video sequence. This requires less processing time and also It can increase the rates of detecting the correct cuts by using advanced comparative method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.460-468
• /
• 2009

Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.

• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.47-50
• /
• 2005

본 논문에서는 S-XML 미들웨어에서 캐싱을 이용한 효율적인 공간 데이터 변환 기법을 제안한다. 공간 데이터베이스 관리 시스템(SDBMS)을 기반으로 하여 S-XML 을 지원하는 시스템은 SDBMS 에서 사용되는 이진 데이터와 S-XML 간의 상호 변환 과정이 필요하다. 특히 변환 과정에서 공간 데이터는 비공간 데이터에 비해 데이터 크기가 크고, 복잡한 동시에 다양한 데이터 형식을 가지고 있어 비공간 데이터에 비해 변환 비용이 크다. 따라서 공간 데이터의 특성을 고려한 변환 비용 감소 기법이 필요하다. 제안 기법은 SDBMS 의 질의 처리 결과인 이진 데이터를 S-XML 문서로 변환하고, S-XML 미들웨어의 캐싱 관리자에서 공간 데이터에 해당하는 부분만을 캐싱 한다. 캐싱 관리자는 질의를 점 질의와 영역 질의로 구분한다. 점 질의의 결과에 대해서는 공간 데이터의 OID 를 키 값으로 하는 해쉬 색인을 사용하며, 영역 질의 결과에 대해서는 질의에서 표현된 MBR 에 따라 R-Tree 색인을 사용한다. 변환 과정에서 요구되는 공간 데이터가 캐싱된 데이터로 존재하면 질의 종류에 따른 색인을 사용하여 데이터를 추출하고 이를 S-XML 데이터로 치환한다. 캐싱 데이터를 이용한 공간 데이터 변환 기법에 의해 공간 데이터의 변환 비용을 줄임으로써 S-XML 미들웨어 에서의 변환 시간을 단축할 수 있다.

• 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.

• Tunnel and Underground Space
• /
• v.19 no.3
• /
• pp.167-173
• /
• 2009

Underground storage cavern is known as the most complicated underground project because of the complexity of construction schedule, tunnel size, and geological problems. In order to optimize the construction schedule of underground storage cavern, two up-to-date technologies were applied. The first technology was 3 dimensional visualization of complicated underground structures, and the second was 4 dimensional simulation considering construction resources, geological conditions and construction schedule. This application case shows that we can achieve optimized construction schedule in the ways to optimize the number of work teams, fleets, the sequence of tunnel excavation, the commencement time of excavation and the hauling route of materials and excavated rocks. 3 dimensional modeling can help designer being able to understand the status of complicated underground structures and to investigate the geological data in the exact 3 dimensional space. Moreover, using 4 dimensional simulation, designer is able to determine the bottle neck point which appear during hauling of excavated rocks and to investigate the daily fluctuation in cost.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.129-137
• /
• 2010

Currently used shortest path search algorithms involve graphs with vertices and weighted edges between each vertex. However, when finding the shortest path with a randomly shaped obstacle(an island, for instance) positioned in between the starting point and the destination, using such algorithms involves high memory inefficiency and is significantly time consuming - all positions in the map should be considered as vertices and every line connecting any of the two adjacent vertices should be considered an edge. Therefore, we propose a new method for finding the shortest path in such conditions without using weighted graphs. This algorithm will allow finding the shortest obstacle bypass given only the positions of the obstacle boundary, the starting point and the destination. When the row and column size of the minimum boundary rectangle to include an obstacle is m and n, respectively, the proposed algorithm has the maximum time complexity, O(mn). This performance shows the proposed algorithm is very efficient comparing with the currently used algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.1
• /
• pp.11-20
• /
• 2007

A fast Montgomery multiplication occupies important to the design of RSA cryptosystem. Montgomery multiplication consists of two addition, which calculates using CSA or RBA. In terms of CSA, the multiplier is implemented using 4-2 CSA o. 5-2 CSA. In terms of RBA, the multiplier is designed based on redundant binary system. In [1], A new redundant binary adder that performs the addition between two binary signed-digit numbers and apply to Montgomery multiplier was proposed. In this paper, we reconstruct the logic structure of the RBA in [1] for reducing time and space complexity. Especially, the proposed RB multiplier has no coupler like the RBA in [1]. And the proposed RB multiplier is suited to binary exponentiation as modified input and output forms. We simulate to the proposed NRBA using gates provided from SAMSUNG STD130 $0.18{\mu}m$ 1.8V CMOS Standard Cell Library. The result is smaller by 18.5%, 6.3% and faster by 25.24%, 14% than 4-2 CSA, existing RBA, respectively. And Especially, the result is smaller by 44.3% and faster by 2.8% than the RBA in [1].