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

검색결과 1,953건 처리시간 0.033초

LTE 하향링크의 Zadoff-Chu 시퀀스를 이용한 배열 안테나 Calibration 알고리즘 (An Array Antenna Calibration Algorithm Using LTE Downlink Zadoff-Chu Sequence)

  • 손철봉;장재현;양현욱;최승원
    • 디지털산업정보학회논문지
    • /
    • 제9권4호
    • /
    • pp.51-57
    • /
    • 2013
  • Research on calibration of array antenna has become a hot spot in the area of signal processing and it is necessary to obtain the phase mismatch of each antenna channel. This paper presents a new calibration method for an array antenna system. In order to calibrate the phase mismatch of each antenna channel, we used primary synchronization signal (PSS) which exists in LTE downlink frame. Primary synchronization signal (PSS) is based on a Zadoff-Chu sequence which has a good correlation characteristic. By using correlation calculation, we can extract primary synchronization signal (PSS). After extracting primary synchronization signal (PSS), we use it to calibrate and reduce the phase errors of each antenna channel. In order to verify the new array antenna calibration algorithm which is proposed in this paper, we have simulated the proposed algorithm by using MATLAB. The array antenna system consists of two antenna elements. The phase mismatch of first antenna and second antenna is calculated accurately by proposed algorithm in the experiment test. Theory analysis and MATLAB simulation results are shown to verify the calibration algorithm.

비전 시스템 구현을 위한 SAD 정합 알고리즘의 변형 (Heuristic Designs of SAD Correlation Algorithm for Vision System)

  • 이정수;김준성
    • 전자공학회논문지CI
    • /
    • 제47권5호
    • /
    • pp.61-66
    • /
    • 2010
  • 스테레오 비전은 서로 다른 이미지 쌍을 사용하여 주변 환경에 대한 보다 세부화된 3차원 지도를 제공할 수 있기 때문에 소형 로봇이나 홈네트워크 분야에서 많은 활용이 가능하다. 스테레오 비전 시스템의 영역기반 정합방법 중 하나인 SAD 정합 알고리즘은 구조적인 규칙성을 가짐으로써 풍부한 병렬성을 제공하여 많이 사용된다. 본 논문에서는 SAD 알고리즘을 사용하여 스테레오 비전 시스템을 구현하는데 있어 응용분야에 따라 성능과 하드웨어 자원 소모량 등 제약조건이 서로 다른 변형 SAD 알고리즘을 제안하고 비교 분석하였다. 변이도 축약 알고리즘과 윈도우 축약 알고리즘의 경우 하드웨어 자원 소모량을 줄여 소형화와 저가격화를 지향하는 경우에 적합하다. 또한 사용 환경의 객체 형태에 따라서 윈도우 형태 알고리즘의 사용을 고려해 볼 만하며 높은 정합율이 필요한 경우 가변 윈도우 알고리즘을 사용할 수 있다.

응답 스펙트럼의 평균과 분산, 상관관계를 모두 고려한 지반운동 선정 방법 - II 지진 응답 (A Method for Selecting Ground Motions Considering Target Response Spectrum Mean, Variance and Correlation - II Seismic Response)

  • 하성진;한상환
    • 한국지진공학회논문집
    • /
    • 제20권1호
    • /
    • pp.63-70
    • /
    • 2016
  • This study is the sequel of a companion paper (I. Algorithm) for assessment of the seismic performance evaluation of structure using ground motions selected by the proposed algorithm. To evaluate the effect of the correlation structures of selected ground motions on the seismic responses of a structure, three sets of ground motions are selected with and without consideration of the correlation structure. Nonlinear response history analyses of a 20-story reinforced concrete frame are conducted using the three sets of ground motions. This study shows that the seismic responses of the frames vary according to ground motion selection and correlation structures.

상관값의 크기와 부호에 기반한 O-CDMA 부호 획득 알고리즘 (O-CDMA Code Acquisition Algorithm Based on Magnitude and Sign of Correlation Values)

  • 정다해;윤태웅;이영포;이영윤;송정한;박소령;윤석호
    • 한국통신학회논문지
    • /
    • 제34권6C호
    • /
    • pp.649-655
    • /
    • 2009
  • 평균 부호 획득 시간은 (mean acquisition time: MAT) 부호 획득 시스템의 성능을 나타내는 가장 중요한 지표이며, MAT가 짧을수록 부호 획득 시스템의 성능이 좋다고 일컬어진다. 광 부호 분할 다중 접속 (optical code division multiple access: O-CDMA) 시스템의 부호 획득을 위해 Keshavarzian과 Salehi가 제안한 multiple-shift (MS) 알고리즘은 부호 획득을 두 단계로 나누어 수행함으로써, 기존 serial-search (SS) 알고리즘에 비해 짧은 MAT를 제공한다. 본 논문에서는 효율적으로 결합된 로컬 신호와 그에 따른 상관값 및 부호를 이용하여 기존 MS 알고리즘에 비해 더 짧은 MAT를 제공할 수 있는 알고리즘을 제안한다. 또한, 모의실험을 통해 제안한 알고리즘이 기존 MS 알고리즘에 비해 더 짧은 MAT를 제공함을 보인다.

움직임 벡터의 시공간적인 상관성을 이용한 예측 움직임 추정 기법 (Predictive motion estimation algorithm using spatio-temporal correlation of motion vector)

  • 김영춘;정원식;김중곤;이건일
    • 전자공학회논문지B
    • /
    • 제33B권6호
    • /
    • pp.64-72
    • /
    • 1996
  • In this paper, we propose predictive motion estimatin algorithm which can predict motion without additional side information considering spatio-tempral correlatio of motion vector. This method performs motion prediction of current block using correlation of the motion vector for two spatially adjacent blocks and a temporally adjacent block. Form predicted motion, the position of searhc area is determined. Then in this searhc area, we estimate motion vector of current block using block matching algoirthm. Considering spatial an temporal correlation of motion vector, the proposed method can predict motion precisely much more. Especially when the motion of objects is rapid, this method can estimate motion more precisely without reducing block size or increasing search area. Futhrmore, the proposed method has computation time the same as conventional block matching algorithm. And as it predicts motion from adjacent blocks, it does not require additional side information for adjacent block. Computer simulation results show that motion estimation of proposed method is more precise than that of conventioanl method.

  • PDF

An Adaptive Image Quality Assessment Algorithm

  • Sankar, Ravi;Ivkovic, Goran
    • International journal of advanced smart convergence
    • /
    • 제1권1호
    • /
    • pp.6-13
    • /
    • 2012
  • An improved algorithm for image quality assessment is presented. First a simple model of human visual system, consisting of a nonlinear function and a 2-D filter, processes the input images. This filter has one user-defined parameter, whose value depends on the reference image. This way the algorithm can adapt to different scenarios. In the next step the average value of locally computed correlation coefficients between the two processed images is found. This criterion is closely related to the way in which human observer assesses image quality. Finally, image quality measure is computed as the average value of locally computed correlation coefficients, adjusted by the average correlation coefficient between the reference and error images. By this approach the proposed measure differentiates between the random and signal dependant distortions, which have different effects on human observer. Performance of the proposed quality measure is illustrated by examples involving images with different types of degradation.

지연 추정 LMS 적응 알고리즘을 이용한 무선 중계 간섭 제거기 (Wireless Repeating Interference Canceller Using Delay Estimation Least Mean Square Adaptive Algorithm)

  • 강용진;송주태;전익태;김주완;하성희;반지훈;이종현
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2007년도 하계종합학술대회 논문집
    • /
    • pp.119-120
    • /
    • 2007
  • The operation of Interference cancellation algorithm for wireless repeater cancellation depends on either existing correlation properties between desired signal and reference signal or not At the time, due to the correlation properties at the ICS system, adaptive algorithms without considering system delay do not function properly. Thus, this system should be oscillated. In this paper, to solve these problems, we use the delayed least mean square algorithm. For the best performance of ICS, the system delays must be estimated. To efficiently estimate the delay of ICS, we use relations between bandwidth and correlation properties of the received signal.

  • PDF

A Searching and Enhancement Alogorithm for Shadow Areas Using Histogram and Correlation in Fourier Domain

  • Lee, Choong-Ho;Lee, Kwang-Jae;Seo, Doo-Chun;Kim, Yong-Seung
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.552-554
    • /
    • 2003
  • Searching and enhancement of shadow area in the satellite imagery is one of growing interest because of new possible needs of application in this field. This paper proposes an algorithm to search and enhance the shadow areas caused by buildings such as apartments which are very common in Korean satellite imagery. The proposed searching algorithm makes use of characteristics of histogram of images in the spatial domain and also uses the fast Fourier transform and correlation in Frequency domain. Further, the enhancement algorithm is only applied to the shadow areas searched and preserves the areas which are naturally dark.

  • PDF

상관관계와 카이-제곱 분석에 기반한 긍정과 부정 연관 규칙 알고리즘 (Mining Positive and Negative Association Rules Algorithm based on Correlation and Chi-squared analysis)

  • 김나희;윤성대
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 추계학술대회
    • /
    • pp.223-226
    • /
    • 2009
  • Recently, Mining negative association rules has received some attention and proved to be useful. Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. Several algorithms have been proposed. However, there are some questions with those algorithms, for example, misleading rules will occur when the positive and negative rules are mined simultaneously. The chi-squared test that based on the mature theory and Correlation Coefficient can avoid the problem. In this paper, We proposed the algorithm PNCCR based on chi-squared test and correlation is proposed. The experiment results show that the misleading rules are pruned. It suggests that the algorithm is correct and efficient.

  • PDF

공간 상관성을 이용한 적응적 움직임 추정 알고리즘 (An Adaptive Motion Estimation Algorithm Using Spatial Correlation)

  • 박상곤;정동석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
    • /
    • pp.43-46
    • /
    • 2000
  • In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

  • PDF