Evaluation of selected subspace tracking algorithms for direction finding

[摘要] This thesis examines three reduced complexity algorithms for subspace tracking in the contextof radio direction finding. Projection Approximation Subspace Tracking (Yang), theFast Data Projection Method (Doukopoulos and Moustakides) and OPERA (MacInnes)are presented and compared in terms of performance and efficiency. The algorithms' performancesare contrasted using step changes in direction of arrival, sensitivity to noise andminimum angular discrimination. Their relative efficiencies are examined by comparingtheir theoretical complexities and by assessing benchmark results. The construction ofa PC based signal simulator and direction finding client using the MUSIC algorithm aredescribed. The results of a field assessment of the algorithms are presented, and finally,conclusions regarding the relative merits of the algorithms are drawn.

[发布机构] Stellenbosch University