Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2007. / 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.
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:sun/oai:scholar.sun.ac.za:10019.1/1801 |
| Date | 03 1900 |
| Creators | Mitchley, Ryan |
| Contributors | Lourens, J. G., University of Stellenbosch. Faculty of Engineering. Dept. of Electrical and Electronic Engineering. |
| Publisher | Stellenbosch : University of Stellenbosch |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 2059412 bytes, application/pdf |
| Rights | University of Stellenbosch |
Page generated in 0.0023 seconds