Home
Resource
Antennas re-clustering and target handoff for multiple radars system
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(1.60 MB)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Jabbar, Sadiq. Antennas re-clustering and target handoff for multiple radars system. Retrieved from https://doi.org/doi:10.7282/T3KH0QSJ

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleAntennas re-clustering and target handoff for multiple radars system
NameJabbar, Sadiq (author); Godrich, Hana (chair); Gajic, Zoran (internal member); Caggiano, Michael (internal member); Rutgers University; Graduate School - New Brunswick
Date Created2017
Other Date2017-01 (degree)
SubjectElectrical and Computer Engineering, Radar--Antennas, Antenna arrays
Extent1 online resource (viii, 48 p. : ill.)
DescriptionWidely distributed multiple radar systems have been shown to offer enhanced localization performance. With smaller radar footprint, the ability to employ larger number of transmit and receive antennas opens new opportunities. In previous research, a subset selection scheme has been proposed for antenna clustering that minimizes the number of transmit and receive antennas required to achieve a preset accuracy performance. The study indicated that some transmit and receive antenna pairs contribute more than others to the localization performance. This thesis concentrates on handoff techniques that enable the transition of target tracking from one antenna cluster to another. As a target moves in an area covered by a grid of multiple radars, its relative position with respect to an existing tracking antenna cluster (or antenna subset) is changing, affecting the accuracy capabilities of the existing antenna cluster. Thus, at some point, there is a need to update the antenna cluster, keeping a useful antenna subset while replacing other antennas with ones that will keep localization accuracy within a given range. Re-clustering methods are proposed to address target handoff within antennas belonging to a larger grid. Low complexity re-clustering algorithms are proposed for handoff purposes which enable a constrained replacement of antennas. These fast approximation algorithms are based on the optimization of the Cramer Rao bound (CRB) and constrained by the number of antennas that may be replaced at any given time. It is shown that this method performs close to optimal and can be implemented in a decentralized fashion.
NoteM.S.
NoteIncludes bibliographical references
Noteby Sadiq Jabbar
Genretheses, ETD graduate
Persistent URLhttps://doi.org/doi:10.7282/T3KH0QSJ
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024