• 제목/요약/키워드: Array algorithm

검색결과 1,209건 처리시간 0.027초

근사화된 Gradient 방법을 사용한 널링 알고리즘 설계 (Nulling algorithm design using approximated gradient method)

  • 신창의;최승원
    • 디지털산업정보학회논문지
    • /
    • 제9권1호
    • /
    • pp.95-102
    • /
    • 2013
  • This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

Context-Free 언어의 인식을 위한 일차원 시스토릭 어레이의 설계 (Design of One-Dimensional Systolic Array for Recognition of Context-Free Language)

  • 우종호;한광선
    • 대한전자공학회논문지
    • /
    • 제27권1호
    • /
    • pp.30-36
    • /
    • 1990
  • Context-free language can be recognized by Cocke-Younger-Kasami algorithm. This algorithm is a class of polyadic-nonserial dynamic programming technique and has the O(n**3) time complexity. In this paper, a one-dimensional systolic array for recognition of context-free language is designed. The designed triangle type two-dimensional array is projected and transformed to an one-dimensional array. The designed one-dimensional array has n processing elements and \ulcornern+1)/2\ulcorner(n-1)+3n-1 time units to process the algorithm (n is the length of input string). The time complexity is O(n\ulcorner.

  • PDF

Sidelobe Reduction of Low-Profile Array Antenna Using a Genetic Algorithm

  • Son, Seong-Ho;Park, Ung-Hee
    • ETRI Journal
    • /
    • 제29권1호
    • /
    • pp.95-98
    • /
    • 2007
  • A low-profile phased array antenna with a low sidelobe was designed and fabricated using a genetic algorithm (GA). The subarray distances were optimized by GA with chromosomes of 78 bits, a population of 100, a crossover probability of 0.9, and a mutation probability of 0.005. The array antenna has 24 subarrays in 14 rows, and is designed as a mobile terminal for Ku-band satellite communication. The sidelobe level was suppressed by 6.5 dB after optimization, compared to the equal spacing between subarrays. The sidelobe level was verified from the far-field pattern measurement by using the fabricated array antenna with optimized distance.

  • PDF

다목적 위성 태양전지 모델링 및 해석 (Modeling and Analysis of Solar Array of KOMPSAT)

  • 정규범;이상욱;최완식
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 1997년도 전력전자학술대회 논문집
    • /
    • pp.365-369
    • /
    • 1997
  • In this paper, solar array of KOMPSAT was modeled and analyzed. The modeling results of solar array was achieved by neural algorithm, which is powerful of nonlinear system with a few data sets. The algorithm was analyzed and verified by simulation considering on solar cell data of KOMPSAT. The characteristics VI curves and power generation of solar array are analyzed by using the modeling.

  • PDF

Systolic array 구조를 갖는 움직임 추정기 설계 (Design of a motion estimator with systolic array structure)

  • 정대호;최석준;김환영
    • 전자공학회논문지C
    • /
    • 제34C권10호
    • /
    • pp.36-42
    • /
    • 1997
  • In the whole world, the research about the VLSI implementation of motion estimation algorithm is progressed to actively full (brute force) search algorithm research with the development of systolic array possible to parallel and pipeline processing. But, because of processing time's limit in a field to handle a huge data quantily such as a high definition television, many problems are happened to full search algorithm. In the paper, as a fast processing to using parallel scheme for the serial input image data, motion estimator of systolic array structure verifying that processing time is improved in contrast to the conventional full search algorithm.

  • PDF

Performance Analysis of Pseudorange Error in STAP Beamforming Algorithm for Array Antenna

  • Lee, Kihoon;So, Hyungmin;Song, Kiwon
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제3권2호
    • /
    • pp.37-44
    • /
    • 2014
  • The most effective method to overcome GPS jamming problem is to use an adaptive array antenna which has the capability of beamforming or nulling to a certain direction. In this paper, Space Time Adaptive Processing (STAP) beamforming algorithm of four elements array antenna will be designed and the anti-jamming performance will be analyzed. According to the analysis, the signal to noise ratio (SNR) and anti-jamming performance can be enhanced by beamforming algorithm. Also, the time tap effect of STAP algorithm will be analyzed theoretically and verified with array antenna modeling and simulation. Specially, the cautious selection of reference time tap in STAP can prevent the degradation of position accuracy performance.

상관성 채널 환경에서의 적응배열안테나의 부배열 알고리즘을 이용한 관심신호 추정 (A Desired Signal Estimation using Sub-Array Algorithm of Adaptive Array Antenna in Correlation Channel Environment)

  • 이관형;조태준
    • 디지털산업정보학회논문지
    • /
    • 제13권3호
    • /
    • pp.75-81
    • /
    • 2017
  • This paper estimate a desired signal in a correlation wireless communication. The transmitted signal is mixed with the information signal, interference, and noise in wireless channel, and it is incident on the receiver. In this paper, we apply MUSIC algorithm and sub-array method to recover the total rank of the correlation matrix in order to estimation a desired signal among receiving signals. Through simulation, we analyze to compare the proposed method with the classical MUSIC algorithm. As a result of the simulation, the proposed method improved the resolution about 10degrees compared to the conventional MUSIC algorithm. We prove the superiority of the proposed method for the desired signal estimation in correlation channel.

양자화 진화알고리즘을 적용한 널 패턴합성 알고리즘의 특성 연구 (A Study on Characteristics of Null Pattern Synthesis Algorithm Using Quantum-inspired Evolutionary Algorithm)

  • 서종우;박동철
    • 한국군사과학기술학회지
    • /
    • 제19권4호
    • /
    • pp.492-499
    • /
    • 2016
  • Null pattern synthesis method using the Quantum-inspired Evolutionary Algorithm(QEA) is described in this study. A $12{\times}12$ planar array antenna is considered and each element of the array antenna is controlled by 6-bit phase shifter. The maximum number of iteration of 500 is used in simulation and the rotation angle for updating Q-bit individuals is determined to make the individual converge to the best solution and is summarized in a look-up table. In this study we showed that QEA can satisfactorily synthesize the null pattern using smaller number of individuals compared with the conventional Genetic Algorithm.

파라메트릭 배열을 이용한 해저지층 탐사 알고리즘 (Sub-bottom Profiling Algorithm using Parametric Array)

  • 이종현;이재일;배진호
    • 한국해양공학회지
    • /
    • 제28권1호
    • /
    • pp.55-63
    • /
    • 2014
  • In this paper, we propose an threshold-based Schur algorithm for estimating the media characteristics of sub-bottom multi-layers by using the signal generated by a parametric array transducer. We use the KZK model to generate a parametric array signal, and use the proposed threshold-based Schur algorithm for estimating the reflection coefficients of multiple sea bottom layers. Using computer simulation, we verify that the difference frequency component generated by the KZK model prevails over the signals of primary frequencies at long range. For the simulation, we use the transmit signal generated by the KZK and the reflected signal obtained from a lattice filter model for the seawater and sub-bottom of multi-level non-homogeneous layers. Through the simulation, we verify that the proposed threshold-based Schur algorithm can give much more accurate and efficient estimates of the reflection coefficients than methods using received signal, matched filter output signal, and normal Schur algorithm output.

레이더 시스템에서 목표물 위치추정 알고리즘에 대한 연구 (A Study on the Target Position Estimation Algorithm to Radar System)

  • 이관형;송우영
    • 한국컴퓨터정보학회논문지
    • /
    • 제13권5호
    • /
    • pp.111-116
    • /
    • 2008
  • 레이더 시스템은 간섭채널에서 목표물을 신속, 정확하게 예측하여야 한다. 무선채널의 간섭요소로는 인공구조물, 자연구조물에 의해서 다중경로가 형성되어 신호의 추정이 어렵다. 이러한 간섭신호를 제거하기 위해서 디지털 빔형성, 적응배열안테나 등 많은 연구가지속 되어왔다. 본 논문에서는 적응배열 안테나와 코히어런트 간섭신호를 제거하는 SPT-SALCMV 빔형성 알고리즘을 제안하였다. 적응 배열은 간섭신호의 방향에 대해서는 널 패턴을 형성하여 이득을 감소시킨다. 그리고 표적신호 방향으로는 빔 패턴의 이득을 일정하게 유지함으로서 원하는 신호를 추정한다. 본 논문에서 제안한 SPT-SALCMV 알고리즘은 목표물에 대한 위치를 정확히 수신하였다. 그러나 기존의 SPT-LCMV 알고리즘은 약 30 정도의 빔 오차가 생겼다. 따라서 본 논문에서 제안한 SPT-SALCMV 알고리즘이 기존의 SPT-LCMV알고리즘보다 우수함을 입증하였다.

  • PDF