Sparse sensor array design via constrained optimization

Download

index.pdf

Date

2013

Author

Gök, Gökhan

Metadata

Show full item record

Item Usage Stats

80
views

74
downloads

In direction finding applications, sparse array design is an important problem. Sparse arrays are desired when the number of receivers are limited or when sensor size is large compared to half wavelength. When the sparse array design with inter element spacing greater than half wavelength is considered, ambiguity should be avoided as much as possible. The design should generate array patterns without grating lobes. In this thesis, a similarity measure related to ambiguity probability is used to design sparse arrays. This measure is also related to the DOA estimation accuracy and resolution. The design problem setting is cast in a form suitable for linear binary programming. The design criteria includes worst-case ambiguity probability, DOA accuracy, sensor dimensions and maximum array aperture. The proposed approach is used to design one and two dimensional sparse arrays. It is shown that the proposed approach is effective and presents certain advantages compared to the alternative methods.

Subject Keywords

Signal processing., Beamforming., Binary system (Mathematics)., Sensor networks., Sparse Arrays.

URI

http://etd.lib.metu.edu.tr/upload/12616331/index.pdf
https://hdl.handle.net/11511/23039

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Sparse polynomial multiplication for lattice-based cryptography with small complexity Akleylek, Sedat; Alkim, Erdem; Tok, Zaliha Yuce (2016-02-01) In this paper, we propose efficient modular polynomial multiplication methods with applications in lattice-based cryptography. We provide a sparse polynomial multiplication to be used in the quotient ring (Z/pZ)[x]/(x(n) + 1). Then, we modify this algorithm with sliding window method for sparse polynomial multiplication. Moreover, the proposed methods are independent of the choice of reduction polynomial. We also implement the proposed algorithms on the Core i5-3210M CPU platform and compare them with numbe...
SPARSE SUPPORT RECOVERY FOR DOA ESTIMATION IN THE PRESENCE OF MUTUAL COUPLING Elbir, Ahmet M.; Tuncer, Temel Engin (2015-09-04) Direction-of-arrival (DOA) estimation in the presence of mutual coupling and coherent signals is a hard task for arbitrary sensor arrays including uniform circular array (UCA). While the coherent sources can be resolved using spatial smoothing algorithms for uniform linear and rectangular arrays, it cannot be applied to UCA. In this paper, a new technique is proposed for DOA estimation in UCA using a single snapshot. Joint-sparse recovery algorithm is proposed where the source signal spatial directions and ...
The static stochastic knapsack problem with normally distributed item sizes Merzifonluoglu, Yasemin; Geunes, Joseph; Romeijn, H. Edwin (Springer Science and Business Media LLC, 2012-09-01) This paper develops exact and heuristic algorithms for a stochastic knapsack problem where items with random sizes may be assigned to a knapsack. An item's value is given by the realization of the product of a random unit revenue and the random item size. When the realization of the sum of selected item sizes exceeds the knapsack capacity, a penalty cost is incurred for each unit of overflow, while our model allows for a salvage value for each unit of capacity that remains unused. We seek to maximize the ex...
Analysis and design of wideband antenna arrays Çapraz, Kenan; Alatan, Lale; Department of Electrical and Electronics Engineering (2014) Two methods of wideband array design are studied. The aim of this study is to investigate arrays with aperiodic spacings which are designed with these methods in order to obtain wideband behavior. These methods are genetic algorithm and wavelength scaled arrays that have active regions with variable interelement spacings. Genetic algorithm is utilized for array antennas with aperiodic spacing to optimize sidelobe levels of the antenna array in wide frequency band. Wavelength scaled spacing concept in design...
A HEURISTIC PREPROCESSOR SUPPORTED ALGORITHM FOR THE CAPACITATED PLANT LOCATION PROBLEM YAGIZ, O (1991-03-01) The capacitated plant location problem is an example of a binary problem that is a special case of the mixed integer programming problem. General solution methods, which can be used to solve any mixed integer programming problem, prove to be inefficient when applied to the capacitated plant location problem. Heuristic procedures, on the other hand, are effective means to obtain good, possibly optimal, solutions, but their optimality cannot be guaranteed. In this paper we developed an exact algorithm for ...

Citation Formats

G. Gök, “Sparse sensor array design via constrained optimization,” M.S. - Master of Science, Middle East Technical University, 2013.