• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.702-708
• /
• 2000

In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.5
• /
• pp.62-72
• /
• 1993

The phased array antenna has the ability to perform adaptive sampling by directing the radar beam without inertia in any direction. The adaptive sampling capability of the phased array antenna allows each sampling time interval to be varied for each target, depending on the acceleration of each target at any time. In this paper we design a three dimensional adaptive target tracking algorithm for the phased array radar system with a given set of measurement parameters. The tracking algorithm avoids taking unnecessarily frequent samples, while keeping the angular prediction error within a fraction of antenna beamwidth so that the probability of detection will not be degraded during a track updata illuminations. In our algorithm, the target model and the sampling rate are selected depending on the target range and the target maneuver status which is determined by a maneuver level detector. A detailed simulation is conducted to test the validity of our tracking algorithm for target trajectories under various conditions of maneuver.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.221-228
• /
• 2010

Since string operations were applied to computational biology, security and search for Internet, various data structures and algorithms for computing efficient string operations have been studied. The all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings. The matching algorithm is importantly used for fast approximation algorithm to find the shortest superstring, as well as for bio-informatics and data compressions. In this paper, we propose an algorithm to find all-pairs suffix-prefix matching using the suffix array, which takes O($k{\cdot}m$)�� time complexity. The suffix array algorithm is proven to be better than the suffix tree algorithm by showing it takes less time and memory through experiments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2777-2784
• /
• 2011

In this paper, DOA(direction of arrival) of multiple incident signals received from linear array antenna and circular array antenna, which is based on nonparametric estimation algorithm, and adaptive beam-forming algorithm are studied and analyzed. In nonparametric estimation algorithm, we minimize a regularized objective function for finding a estimate of the signal energy as a function of angle, using nonquadratic norm which leads to supper resolution and noise suppression. And then, DOA is estimated by the signal and noise spatial steering vector, and adaptive beam-forming pattern is improved by weight vectors obtained from the spatial vector. Especially, the discrimination ability of DOA and the adaptive beam-forming ability according to antenna array methods and the number of array elements are compared and considered.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.481-493
• /
• 2011

Multiple-input multiple-output (MIMO) technology provides high data rate and enhanced quality of service for wireless communications. Since the benefits from MIMO result in a heavy computational load in detectors, the design of low-complexity suboptimum receivers is currently an active area of research. Lattice-reduction-aided detection (LRAD) has been shown to be an effective low-complexity method with near-maximum-likelihood performance. In this paper, we advocate the use of systolic array architectures for MIMO receivers, and in particular we exhibit one of them based on LRAD. The "Lenstra-Lenstra-Lov$\acute{a}$sz (LLL) lattice reduction algorithm" and the ensuing linear detections or successive spatial-interference cancellations can be located in the same array, which is considerably hardware-efficient. Since the conventional form of the LLL algorithm is not immediately suitable for parallel processing, two modified LLL algorithms are considered here for the systolic array. LLL algorithm with full-size reduction-LLL is one of the versions more suitable for parallel processing. Another variant is the all-swap lattice-reduction (ASLR) algorithm for complex-valued lattices, which processes all lattice basis vectors simultaneously within one iteration. Our novel systolic array can operate both algorithms with different external logic controls. In order to simplify the systolic array design, we replace the Lov$\acute{a}$sz condition in the definition of LLL-reduced lattice with the looser Siegel condition. Simulation results show that for LR-aided linear detections, the bit-error-rate performance is still maintained with this relaxation. Comparisons between the two algorithms in terms of bit-error-rate performance, and average field-programmable gate array processing time in the systolic array are made, which shows that ASLR is a better choice for a systolic architecture, especially for systems with a large number of antennas.

• ETRI Journal
• /
• v.31 no.3
• /
• pp.321-323
• /
• 2009

A wideband beamforming algorithm for estimating the azimuth angle, elevation angle, velocity, and range using a planar phased radar array with antenna switching is proposed. It uses the time-variant steering vector model. Simulation results illustrating the performance of the proposed beamformer are presented.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.408-413
• /
• 2001

The structural optimization is carried out in the continuous design space or discrete design space. Methods for discrete variables such as genetic algorithms are extremely expensive in computational cost. In this research, an iterative optimization algorithm using orthogonal arrays is developed for design in discrete space. An orthogonal array is selected on a discrete design space and levels are selected from candidate values. Matrix experiments with the orthogonal array are conducted. New results of matrix experiments are obtained with penalty functions for constraints. A new design is determined from analysis of means(ANOM). An orthogonal array is defined around the new values and matrix experiments are conducted. The final optimum design is found from iterative process. The suggested algorithm has been applied to various problems such as truss and frame type structures. The results are compared with those from a genetic algorithm and discussed.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.164-169
• /
• 2009

This paper presents a fast and accurate ranging algorithm for the WiBro system. The proposed algorithm detects a received ranging code and estimates its propagation delay using the correlation characteristics of the PRBS (Pseudo Random Binary Sequence) and the circular shift property of the discrete Fourier transform operator. The proposed ranging algorithm was applied to array antenna systems to show how it could improve the ranging performance of an array antenna system compared to a conventional base station system, which uses only a single antenna.