Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Optimization of the array geometry for direction finding
Download
index.pdf
Date
2003
Author
Özaydın, Seval
Metadata
Show full item record
Item Usage Stats
206
views
0
downloads
Cite This
In this thesis, optimization of the geometry of non-uniform arrays for direction finding yielding unambiguous results is studied. A measure of similarity between the array response vectors is defined. In this measure, the effects of antenna array geometry, source placements and antenna gains are included as variable parameters. Then, assuming that the antenna gains are known and constant, constraints on the similarity function are developed and described to result in unambiguous configurations and maximum resolution. The problem stated is solved with two different methods, the MATLAB optimization toolbox, and genetic algorithm in which different genetic codings are also studied. The performance of the MUSIC algorithm with the optimized array geometries are investigated through computer simulations. The direction of arrival estimates are obtained using the optimized array geometry on the MUSIC algorithm along with the effects of different parameters. Statistics of the true and probable erroneous arrival angles and the probability of gross error are obtained as a measure of performance. It is observed that the proposed optimization process for the array geometry gave rise to unambiguous results for direction findi
Subject Keywords
Genetic algorithms
,
Antennas (Electronics)
URI
http://etd.lib.metu.edu.tr/upload/2/1093012/index.pdf
https://hdl.handle.net/11511/13839
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Optimizations of antennas using heuristic algorithms supported by the multilevel fast multipole algorithm
Önol, Can; Ergül, Özgür Salih; Department of Electrical and Electronics Engineering (2015)
In this study, an optimization environment based on heuristic algorithms supported by the multilevel fast multipole algorithm (MLFMA) is presented for different antenna problems involving either excitation or geometry optimizations. The heuristic algorithms are implemented in-house by aiming more effective interactions between electromagnetic solvers and optimization algorithms, instead of black box interactions. Excitation optimizations of various array geometries for desired radiation characteristics are ...
Optimization of nonuniform array geometry for DOA estimation with the constraint on gross error probability
Birinci, Toygar; Tanık, Yalçın (2007-10-01)
In this work, a novel method is proposed to optimize the array geometry for DOA estimation. The method is based on minimization of fine error variances with the constraint that the gross error probability is below a certain threshold. For this purpose, a metric function that reflects the gross and fine error characteristics of the array is proposed. Theoretical analyses show that the minimization of this metric function leads to small DOA estimation error variance and small gross error probability. Analyses...
On the use of genetic algorithms for synthesis of signal temporal logic formulas
Aydin, Sertac Kagan; Aydın Göl, Ebru (2018-07-09)
In this work, we studied use of genetic algorithms to synthesize Signal Temporal Logic formulas from a labeled data set. In the synthesis problem, the goal is to generate the best STL formula representing the labeled signals in the set. To use genetic algoritms in this domain, the basic genetic algoritm processes are defined for STL formulas. The developed synthesis method produces a formula from the data set efficiently in a fully automated way. In particular, the proposed approach does not require an expe...
Optimizations of Patch Antenna Arrays Using Genetic Algorithms Supported by the Multilevel Fast Multipole Algorithm
Onol, Can; Ergül, Özgür Salih (2014-12-01)
We present optimizations of patch antenna arrays using genetic algorithms and highly accurate full-wave solutions of the corresponding radiation problems with the multilevel fast multipole algorithm (MLFMA). Arrays of finite extent are analyzed by using MLFMA, which accounts for all mutual couplings between array elements efficiently and accurately. Using the superposition principle, the number of solutions required for the optimization of an array is reduced to the number of array elements, without resorti...
Efficient and Accurate Electromagnetic Optimizations Based on Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2016-01-01)
We present electromagnetic optimizations by heuristic algorithms supported by approximate forms of the multilevel fast multipole algorithm (MLFMA). Optimizations of complex structures, such as antennas, are performed by considering each trial as an electromagnetic problem that can be analyzed via MLFMA and its approximate forms. A dynamic accuracy control is utilized in order to increase the efficiency of optimizations. Specifically, in the proposed scheme, the accuracy is used as a parameter of the optimiz...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Özaydın, “Optimization of the array geometry for direction finding,” M.S. - Master of Science, Middle East Technical University, 2003.
