• Title/Summary/Keyword: 배열 알고리즘

Search Result 495, Processing Time 0.026 seconds

A Study on Signal Sub Spatial Method for Removing Noise and Interference of Mobile Target (이동 물체의 잡음과 간섭제거를 위한 신호 부 공간기법에 대한 연구)

  • Lee, Min-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.3
    • /
    • pp.224-228
    • /
    • 2015
  • In this paper, we study the method for desired signals estimation that array antennas are received signals. We apply sub spatial method of direction of arrival algorithm and adaptive array antennas in order to remove interference and noise signal of received antenna signals. Array response vector of adaptive array antenna is probability, it is correctly estimation of direction of arrival of targets to update weight signal. Desired signals are estimated updating covariance matrix after moving interference and noise signals among received signals. We estimate signals using eigen decomposition and eigen value, high resolution direction of arrival estimation algorithm is devided signal sub spatial and noise sub spatial. Though simulation, we analyze to compare proposed method with general method.

An Index Data Structure for String Search in External Memory (외부 메모리에서 문자열을 효율적으로 탐색하기 위한 인덱스 자료 구조)

  • Na, Joong-Chae;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.598-607
    • /
    • 2005
  • We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

An Error position detection and recovery algorithm at 3×3 matrix digital circuit by mimicking a Neuron (뉴런의 기능을 모사한 3×3배열구조의 디지털 회로에서의 오류위치 확인 및 복구 알고리즘)

  • Kim, Soke-Hwan;Hurg, Chang-Wu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.101-104
    • /
    • 2016
  • In this study, we propose an algorithm to simulate the function of the coupling structure and having two neurons to find out exactly recover the temporary or permanent position errors that can occur during operation in a digital circuit was separated by function, a 3x3 array. If any particular part in the combined cells are differentiated cells have a problem that function to other cells caused an error and perform the same function are subjected to a step of apoptosis by the surrounding cells. Designed as a function block in the function and the internal structure having a cell structure of this digital circuit proposes an algorithm.

  • PDF

Genotype-Calling System for Somatic Mutation Discovery in Cancer Genome Sequence (암 유전자 배열에서 체세포 돌연변이 발견을 위한 유전자형 조사 시스템)

  • Park, Su-Young;Jung, Chai-Yeoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.3009-3015
    • /
    • 2013
  • Next-generation sequencing (NGS) has enabled whole genome and transcriptome single nucleotide variant (SNV) discovery in cancer and method of the most fundamental being determining an individual's genotype from multiple aligned short read sequences at a position. Bayesian algorithm estimate parameter using posterior genotype probabilities and other method, EM algorithm, estimate parameter using maximum likelihood estimate method in observed data. Here, we propose a novel genotype-calling system and compare and analyze the effect of sample size(S = 50, 100 and 500) on posterior estimate of sequencing error rate, somatic mutation status and genotype probability. The result is that estimate applying Bayesian algorithm even for 50 of small sample size approached real parameter than estimate applying EM algorithm in small sample more accurately.

AIC & MDL Algorithm Based on Beamspace, for Efficient Estimation of the Number of Signals (효율적인 신호개수 추정을 위한 빔공간 기반 AIC 및 MDL 알고리즘)

  • Park, Heui-Seon;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.4
    • /
    • pp.617-624
    • /
    • 2021
  • The accurate estimation of the number of signals included in the received signal is required for the AOA(: Angle-of-Arrival) estimation, the interference suppression, the signal reception, etc. AIC(: Akaike Information Criterion) and MDL(: Minimum Description Length) algorithms, which are known as the typical algorithms to estimate the signal number, estimate the number of signals according to the minimum of each criterion. As the number of antenna elements increased, the estimation performance is enhanced, but the computational complexity is increased because values of criteria for entire antenna elements should be calculated for finding their minimum. In order to improve this problem, in this paper, we propose AIC and MDL algorithms based on the beamspace, which efficiently estimate the number of signals while reducing the computational complexity by reducing the dimension of an array antenna through the beamspace processing. In addition, we provide computer simulation results based on various scenarios for evaluating and analysing the estimation performance of the proposed algorithms.

Numerical Analysis on 3-dimensional Heat transfer of Heating Surface with Periodically Arrayed Injectors (분사기가 주기적으로 배열된 가열면의 3차원 열전달 수치해석 연구)

  • Cho, Won-Kook;Kim, Young-Mog
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.8
    • /
    • pp.112-119
    • /
    • 2002
  • Three dimensional numerical heat transfer analysis was carried out against periodically arranged fuel injectors of the liquid rocket engine. A finite volume method based on SIMPLE algorithm was adapted which gave a good agreement with the published results of the heat transfer problem of a backward facing step. The Nusselt number and pressure drop increased as the distance between the injector elements decreased. When the Reynolds number increased, the Nusselt number increased but nondimensionalized pressure drop decreased slightly.

Source Localization Based on Independent Doublet Array (독립적인 센서쌍 배열에 기반한 음원 위치추정 기법)

  • Choi, Young Doo;Lee, Ho Jin;Yoon, Kyung Sik;Lee, Kyun Kyung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.10
    • /
    • pp.164-170
    • /
    • 2014
  • A single near-field sounde source bearing and ranging method based on a independent doublet array is proposed. In the common case of bearing estimation method, unform linear array or uniform circular array are used. It is constrained retaining aperture because of array structure to estimate the distance of the sound source. Recent using independent doublet array sound source's bearing and distance esmtimation method is proposed by wide aperture. It is limited to the case doublets are located on a straight line. In this paper, we generalize the case and estimate the localization of a sound source in the various array structure. The proposed algorithm was verified performance through simulation.

Adaptive Beamforming System Based on Combined Array Antenna (혼합 배열 안테나 기반의 적응 빔형성 시스템)

  • Kim, Tae-Yun;Hwang, Suk-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.1
    • /
    • pp.9-18
    • /
    • 2021
  • The 5G communication system employs the millimeter wave with the extremely high frequency. Since the high frequency signal has the strong straightness, the beamforming technology based on the multiple base stations is required for services covering wide range. The beamformer needs the angle-of-arrival(AOA) information of the signal incident to the antenna, and it is generally estimated through the high resolution AOA estimation algorithm such as Multiple Signal Classification (MUSIC) or Estimation of Signal Parameters via Rotational Invariacne Technique (ESPRIT). Although various antenna array shapes can be employed for the beamformer, a single shape (square, circle, or hexagonal) is typically utilized. In this paper, we introduce a transmitting/receiving beamforming system based on the combined array antenna with square and circular shapes, which is proper to various frequency signals, and evaluate its performance. For evaluating the performance of the proposed beamforming system based on the combined array antenna, we implement the computer simulation employing various scenarios.

Fast and Scalable Path Re-routing Algorithm Using A Genetic Algorithm (유전자 알고리즘을 이용한 확장성 있고 빠른 경로 재탐색 알고리즘)

  • Lee, Jung-Kyu;Kim, Seon-Ho;Yang, Ji-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.18B no.3
    • /
    • pp.157-164
    • /
    • 2011
  • This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

Coherent Multiple Target Angle-Tracking Algorithm (코히어런트 다중 표적 방위 추적 알고리즘)

  • Kim Jin-Seok;Kim Hyun-Sik;Park Myung-Ho;Nam Ki-Gon;Hwang Soo-Bok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.4
    • /
    • pp.230-237
    • /
    • 2005
  • The angle-tracking of maneuvering targets is required to the state estimation and classification of targets in underwater acoustic systems. The Problem of angle-tracking multiple closed and crossing targets has been studied by various authors. Sword et al. Proposed a multiple target an91e-tracking algorithm using angular innovations of the targets during a sampling Period are estimated in the least square sense using the most recent estimate of the sensor output covariance matrix. This algorithm has attractive features of simple structure and avoidance of data association problem. Ryu et al. recently Proposed an effective multiple target angle-tracking algorithm which can obtain the angular innovations of the targets from a signal subspace instead of the sensor output covariance matrix. Hwang et al. improved the computational performance of a multiple target angle-tracking algorithm based on the fact that the steering vector and the noise subspace are orthogonal. These algorithms. however. are ineffective when a subset of the incident sources are coherent. In this Paper, we proposed a new multiple target angle-tracking algorithm for coherent and incoherent sources. The proposed algorithm uses the relationship between source steering vectors and the signal eigenvectors which are multiplied noise covariance matrix. The computer simulation results demonstrate the improved Performance of the Proposed algorithm.