• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.8
• /
• pp.907-914
• /
• 2014

A heuristic search algorithm is proposed to plan a collision free path for robots in an indoor environment. The proposed algorithm is to find a collision free path in the gridded configuration space by proposed heuristic graph search algorithm. The proposed algorithm largely consists of two parts : tunnel searching and path searching in the tunnel. The tunnel searching algorithm finds a thicker path from start grid to goal grid in grid configuration space. The tunnel is constructed with large grid defined as a connected several minimum size grids in grid-based configuration space. The path searching algorithm then searches a path in the tunnel with minimum grids. The computational time of the proposed algorithm is less than the other graph search algorithm and we analysis the time complexity. To show the validity of the proposed algorithm, some numerical examples are illustrated for robot.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.6
• /
• pp.104-110
• /
• 2008

In this paper, a novel 2-level-search sphere decoding algorithm for multiple-input multiple-output (MIMO) detection and its VLSI implementation are presented. The proposed algorithm extends the search space by concurrently performing symbol detection on 2 level of the tree search. Therefore, the possibility of discarding good candidates can be avoided. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER). From the proposed algorithm, an efficient very large scale integration (VLSI) architecture which incorporates low-complexity and fixed throughput features is proposed. The proposed architecture supports many modulation techniques such as BPSK, QPSK, 16-QAM and 64-QAM. The sorting block, which occupies a large portion of hardware utilization, is shared for different operating modes to reduce the area. The proposed hardware implementation results show the improvement in terms of area and BER performance compared with existing architectures.

• The Bulletin of The Korean Astronomical Society
• /
• v.33 no.2
• /
• pp.61.2-61.2
• /
• 2008

• The Bulletin of The Korean Astronomical Society
• /
• v.31 no.2
• /
• pp.68.2-68.2
• /
• 2006

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.356-364
• /
• 2000

Block based fast motion estimation algorithm use the fixed search pattern to reduce the search point, and are based on the assumption that the error in the mean absolute error space monotonically decreases to the global minimum. Therefore, in case of many local minima in a search region we are likely to find local minima instead of the global minimum and highly rely on the initial search points. This situation is evident in the motion boundary. In this paper we define the candidate regions within the search region using the motion information of the neighbor blocks and we propose the multiple local search method (MLSM) which search for the solution throughout the candidate regions to reduce the possibilities of isolation to the local minima. In the MLSM we mark the candidate region in the search point map and we avoid to search the candidate regions already visited to reduce the calculation. In the simulation results the proposed method shows more excellent results than that of other gradient based method especially in the search of motion boundary. Especially, in PSNR the proposed method obtains similar estimate accuracy with the significant reduction of search points to that of full search.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Bulletin of the Korean Space Science Society
• /
• 1999.09a
• /
• pp.66-66
• /
• 1999

No Abstract, See Full Text

• The Bulletin of The Korean Astronomical Society
• /
• v.34 no.2
• /
• pp.77.1-77.1
• /
• 2009

• The Bulletin of The Korean Astronomical Society
• /
• v.33 no.2
• /
• pp.59.1-59.1
• /
• 2008

• Journal of Positioning, Navigation, and Timing
• /
• v.4 no.4
• /
• pp.161-171
• /
• 2015

Alternative binary offset carrier (AltBOC) signals can be approximated by four synchronized direct sequence spread spectrum (DSSS) signals, each pair of which is a quadrature phase shift keyed (QPSK) signal at a different frequency. Therefore, depending on the strength of an incoming AltBOC signal, an acquisition technique can reduce the mean acquisition time (MAT) by searching the four DSSS signals asynchronously; the search for each of the four DSSS signals can start at one of the evenly separated hypotheses on the two-dimensional hypothesis space. And detection sensitivity can be improved by multiple levels when different numbers of search results for the same hypothesis are combined. In this paper, we propose a fast AltBOC acquisition technique that has an asynchronous search strategy and efficiently utilizes the output of the four search results to increase the sensitivity level when sensitivity improvement is needed. We provide a complete theoretical analysis and demonstrate with numerous Monte Carlo simulations that the MAT of the proposed technique is much smaller than conventional AltBOC acquisition techniques.