• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1081-1088
• /
• 2021

The modern wireless communication system employes the beamforming technique based on a massive array antenna with a number of elements, for supporting the smooth communication services. A reliable beamforming technology requires the Angle-of-Arrival(: AOA) information for the signal incident to the receiving antenna, which is generally estimated by the high-resolution AOA estimation algorithm such as Multiple Signal Classification(: MUSIC). Although the MUSIC algorithm has the excellent estimation performance, it is difficult to estimate AOA in real time for the massive array antenna due to the extremely high computational complexity. In order to enhance this problem, in this paper, we propose the cascade AOA estimation algorithm based on a Flexible Massive Concentric Circular Array(: FMCCA) antenna with the On/Off function for antenna elements. The proposed cascade algorithm consists of the CAPON algorithm using some elements among entire antenna elements and the Beamspace MUSIC algorithm using entire elements. We provide computer simulation results for various scenarios to demonstrate the AOA estimation performance of the proposed approach.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.1985-1996
• /
• 1998

A parallelising algorithm for partitioning and mapping methods of matrix/vector multiplication into linear processor array/VLW simulator is presented in this paper. First we discuss the mapping methods for input matrix or vector into the arbitrarily size of processor arrays. Then, we show partitioning the algorithmss of the large size of computational problem into the size of the processor array. We execute the algorithm on VLIW simuhator and show to effectiviness of algorithm. The result which we achived better parallelising performance on our VLIW simulator dsign than on linear processor array.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.5
• /
• pp.400-404
• /
• 2015

In this paper, we study for direction of arrival MUSIC spatial spectrum algorithm in order to desired signal estimation in spatial. Proposal MUSIC spatial spectrum algorithm in paper use model error and Bayesian method to estimation on correct target position. Receiver array response vector using adaptive array antenna use Bayesian method, and target position estimate to update weight value with model error method. Target's signal estimation of desired direction of arrival in this paper apply weight value of signal covariance matrix for array response vector after removing incident signal interference and noise, respectively. Though simulation, we analyze to compare proposed method with general method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1977-1983
• /
• 1998

An algorithm-based fault tolerant scheme for the vector convolution is proposed employing the positive and negative checksum vectors that are defined in this paper based on the encoder vector. The proposed scheme is implemented on the aray processor, and then the amount of redundancy is examined thrugh the complexity analysis.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06d
• /
• pp.68-71
• /
• 1998

본 연구에서는 64(8$\times$8) 개의 마이크로폰 정방 배열에 의한 음장 가시화 시스템을 설계하고 , FFT 알고리즘과 원거리 음향 홀로그래피법 알고리즘을 이용한 음원 위치 추정에 관하여 기술한다. 본 연구에서 설계한 측정 시스템은 방사된 음들을 동시에 수음할수 있으며 실시간 데이터 처리가 가능하다. 또한 짧은 계측시간과 고분해능으로 실음장에서 안정하게 음원의 위치를 추정할 수 있다. 본 연구의 타당성을 검증하기 위해 시뮬레이션을 잉하여 마이크로폰 간격 및 측정면의 최적 조건을 구한 후 실음장 측정 실험에 적용하였다. 시뮬레이션 데이터와 실험 데이터를 비교.분석한 결과 타당성을 검증할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.733-735
• /
• 2002

DNA fragment assembly 프로그램인 Phrap에서는 exact match를 찾기 위해 정렬된 k-글자 테이블 자료구조를 사용한다. 이것은 접미사 배열의 간단한 형태로서, DNA fragment assembly와 같은 응용에서는 접미사 배열보다 더 유용한 자료구조이다. 본 논문에서는 k-글자 테이블을 정렬하는 Manber-Myers, Quicksort, Radix sort 알고리즘을 살펴보고, 실험을 통해 그 중에서 가장 뛰어난 성능을 가지는 것이 Quicksort 알고리즘임을 보였다 또한 k-글자 테이블의 정렬 문제에 있어서는, 캐쉬-메모리 아키텍쳐에 최적화되어 계산복잡도 속에 숨어있는 상수를 최소화하는 것이 중요한 문제임을 밝힌다.

• Journal of Advanced Navigation Technology
• /
• v.6 no.3
• /
• pp.181-187
• /
• 2002

In this paper, we propose a resolution enhancement method for estimating direction-of-arrival(DOA) of narrowband incoherent signals incident on a general array. The resolution of DOA algorithm is dependent on the aperture size of antenna array. But it is very impractical to increase the physical size of antenna array in real environment. We propose the method that improves resolution performance by virtually expanding the sensor spacing of original antenna array and then averaging the spatial spectrum of each virtual array which has a different aperture size. Superior resolution capabilities achieved with this method are shown by simulation results in comparison with the standard MUSIC for incoherent signals incident on a uniform circular array.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.1
• /
• pp.91-97
• /
• 2005

In the mobile antenna systems for satellite multimedia communications, the active way antenna having a low sidelobe antenna pattern is described in this paper. This designed and fabricated array antenna is satisfied with international beam pattern regulation on moving states. The subarray of the proposed mobile antenna system is arranged with a stair-planar structure and non-periodic array spacing. This subarray is designed with three-layered microstrip patch as both receiving and transmitting radiator of which are improved with antenna gain and bandwidth. Also, the optimum subarray spacing is designed to make the lowest sidelobe pattern by genetic algorithm. In addition, the characteristics of a GA-perturbed array are investigated from simulated and measured beam pattern results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.72-80
• /
• 2003

This paper proposed the method of finding optimal weight vectors for enhancing the performance of an adaptive array antenna system by adopting a novel beam-forming algorithm in CDMA (code division multiple access) channel. This algorithm is a liberalized power method, based on power method, with the total computational load, O(4N). Where, N denotes the number of antenna elements. The performance of the proposed algorithm is shown in terms of SER (symbol error rates), allowable capacity, and the convergence characteristic in IS2000 1X CDMA channel. As a result of simulations, the adaptive way antenna system allows 6-10 times more users than the conventional one in a cell of a base station. Furthermore, the proposed algorithm shows superior performance to the conventional one regarding symbol error rates, converging characteristics, and computational load.