Evaluation of selected subspace tracking algorithms for direction finding

Mitchley, Ryan (2007-03)

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2007.

Thesis

This thesis examines three reduced complexity algorithms for subspace tracking in the context of radio direction finding. Projection Approximation Subspace Tracking (Yang), the Fast Data Projection Method (Doukopoulos and Moustakides) and OPERA (MacInnes) are presented and compared in terms of performance and efficiency. The algorithms’ performances are contrasted using step changes in direction of arrival, sensitivity to noise and minimum angular discrimination. Their relative efficiencies are examined by comparing their theoretical complexities and by assessing benchmark results. The construction of a PC based signal simulator and direction finding client using the MUSIC algorithm are described. The results of a field assessment of the algorithms are presented, and finally, conclusions regarding the relative merits of the algorithms are drawn.

Please refer to this item in SUNScholar by using the following persistent URL: http://hdl.handle.net/10019.1/1801
This item appears in the following collections: