Overloaded Array Processing with Spatially Reduced Search Joint Detection

An antenna array is overloaded when the number of cochannel signals in its operating environment exceeds the number of elements. Conventional space-time array processing for narrow-band signals fails in overloaded environments. Overloaded array processing (OAP) is most difficult when signals impingi...

Full description

Bibliographic Details
Main Author: Hicks, James E. Jr.
Other Authors: Electrical and Computer Engineering
Format: Others
Published: Virginia Tech 2011
Subjects:
Online Access:http://hdl.handle.net/10919/9611
http://scholar.lib.vt.edu/theses/available/etd-08152000-12590010
id ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-9611
record_format oai_dc
spelling ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-96112021-11-04T05:34:01Z Overloaded Array Processing with Spatially Reduced Search Joint Detection Hicks, James E. Jr. Electrical and Computer Engineering Reed, Jeffrey H. Tranter, William H. Woerner, Brian D. Antenna Array Interference Mitigation Overloaded Array Joint Detection An antenna array is overloaded when the number of cochannel signals in its operating environment exceeds the number of elements. Conventional space-time array processing for narrow-band signals fails in overloaded environments. Overloaded array processing (OAP) is most difficult when signals impinging on the array are near equal power, have tight excess bandwidth, and are of identical signal type. In this thesis, we first demonstrate how OAP is theoretically possible with the joint maximum likelihood (JML) receiver. However, for even a modest number of interfering signals, the JML receiverà ­s computational complexity quickly exceeds the real-time ability of any computer. This thesis proposes an iterative joint detection technique, Spatially Reduced Search Joint Detection, (SRSJD), which approximates the JML receiver while reducing its computational complexity by several orders of magnitude. This complexity reduction is achieved by first exploiting spatial separation between interfering signals with a linear pre-processing stage, and second, performing iterative joint detection with a (possibly) tail-biting and time"-varying trellis. The algorithm is sub-optimal but is demonstrated to well approximate the optimum receiver in modest signal to interference ratios. SRSJD is shown to demodulate over 2M zero excess bandwidth synchronous QPSK signals with an M element array. Also, this thesis investigates a temporal processing technique similar to SRSJD, Temporally Reduced Search Joint Detection (TRSJD), that separates co-channel, asynchronous, partial response signals. The technique is demonstrated to separate two near equal power QPSK signals with r= .35 root raised-cosine pulse shapes." Master of Science 2011-08-06T14:41:44Z 2011-08-06T14:41:44Z 2000-05-10 2000-08-15 2001-08-22 2000-08-22 Thesis etd-08152000-12590010 http://hdl.handle.net/10919/9611 http://scholar.lib.vt.edu/theses/available/etd-08152000-12590010 JEH_ETD.pdf In Copyright http://rightsstatements.org/vocab/InC/1.0/ ETD application/pdf Virginia Tech
collection NDLTD
format Others
sources NDLTD
topic Antenna Array
Interference Mitigation
Overloaded Array
Joint Detection
spellingShingle Antenna Array
Interference Mitigation
Overloaded Array
Joint Detection
Hicks, James E. Jr.
Overloaded Array Processing with Spatially Reduced Search Joint Detection
description An antenna array is overloaded when the number of cochannel signals in its operating environment exceeds the number of elements. Conventional space-time array processing for narrow-band signals fails in overloaded environments. Overloaded array processing (OAP) is most difficult when signals impinging on the array are near equal power, have tight excess bandwidth, and are of identical signal type. In this thesis, we first demonstrate how OAP is theoretically possible with the joint maximum likelihood (JML) receiver. However, for even a modest number of interfering signals, the JML receiverà ­s computational complexity quickly exceeds the real-time ability of any computer. This thesis proposes an iterative joint detection technique, Spatially Reduced Search Joint Detection, (SRSJD), which approximates the JML receiver while reducing its computational complexity by several orders of magnitude. This complexity reduction is achieved by first exploiting spatial separation between interfering signals with a linear pre-processing stage, and second, performing iterative joint detection with a (possibly) tail-biting and time"-varying trellis. The algorithm is sub-optimal but is demonstrated to well approximate the optimum receiver in modest signal to interference ratios. SRSJD is shown to demodulate over 2M zero excess bandwidth synchronous QPSK signals with an M element array. Also, this thesis investigates a temporal processing technique similar to SRSJD, Temporally Reduced Search Joint Detection (TRSJD), that separates co-channel, asynchronous, partial response signals. The technique is demonstrated to separate two near equal power QPSK signals with r= .35 root raised-cosine pulse shapes." === Master of Science
author2 Electrical and Computer Engineering
author_facet Electrical and Computer Engineering
Hicks, James E. Jr.
author Hicks, James E. Jr.
author_sort Hicks, James E. Jr.
title Overloaded Array Processing with Spatially Reduced Search Joint Detection
title_short Overloaded Array Processing with Spatially Reduced Search Joint Detection
title_full Overloaded Array Processing with Spatially Reduced Search Joint Detection
title_fullStr Overloaded Array Processing with Spatially Reduced Search Joint Detection
title_full_unstemmed Overloaded Array Processing with Spatially Reduced Search Joint Detection
title_sort overloaded array processing with spatially reduced search joint detection
publisher Virginia Tech
publishDate 2011
url http://hdl.handle.net/10919/9611
http://scholar.lib.vt.edu/theses/available/etd-08152000-12590010
work_keys_str_mv AT hicksjamesejr overloadedarrayprocessingwithspatiallyreducedsearchjointdetection
_version_ 1719492535747870720