Robust Beamforming with Cyclostationary Signals

• Main Authors: Liu, Jia-Chun, 劉佳旬
• Other Authors: Ju-Hong Lee
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/50772333313285510621

碩士 === 國立臺灣大學 === 電機工程學系 === 85 === Strongly influenced by the advantage of automatically resolving the desired signal while cancelling interference signals and noise,adaptive array beamforming has received much attention in several application areas.Recently using cyclostationary signals in adaptive array beamforming has been a new field.In mobile communication systems,we use that technique to increase capacity without increasing bandwidth.The SCORE algorithm is an important one of those.Thus it can resolve the adaptive weights by only knowing the cyclic frequency of desired signal that the SCORE is a blind beamformer.But it has much more computation than the traditional beamformer does.In order to reduce the computation ,we use the subarray technique in SCORE algorithm.This method can also increase the convergence speed of the adaptive weights. If the cyclic frequency of the desired signal is error,the performance of SCORE algorithm will drop violently.We present a novel and efficient method to resolve this problem.First,we use the FFT method to estimate the cyclic frequency of the desired signal,then use the estimated frequency in SCORE algorithm. In order to resolve the blind angles of the 1-D SCORE,we develope the 2-D SCORE algorithm.We also use the subarray and FFT method to reduce computation and to resolve the error cyclic frequency problem in the 2-D SCORE algorithm respectively.