Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, The views expressed in this thesis are those of the author and do not reflect the official policy or position of the Department of Defense or the U.S. Government.Approved for public release; distribution is unlimited.Reception of one or more signals, overlapping in frequency and time with the desired signal, is commonly called cochannel interference. Joint detection is the optimal minimum probability of error decision rule for cochannel interference. This dissertation investigates the optimum approach and a number of suboptimum approaches to joint detection when a priori information based in fields, or sets of transmitted symbols, is available. In the general case the solution presents itself as a time-varying estimation problem that may be efficiently solved with a modified Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm. The low-entropy properties of a particular signal of interest, the Automatic Identification System (AIS), are presented. Prediction methods are developed for this signal to be used as a priori information for a joint field-based maximum a posteriori (MAP) detector. Advanced joint detection techniques to mitigate cochannel interference are found to have superior bit error rate (BER) performance than can be obtained compared to traditional methods.
ABSTRACTReception of one or more signals, overlapping in frequency and time with the desired signal, is commonly called cochannel interference. Joint detection is the optimal minimum probability of error decision rule for cochannel interference. This dissertation investigates the optimum approach and a number of suboptimum approaches to joint detection when a priori information based in fields, or sets of transmitted symbols, is available. In the general case the solution presents itself as a time-varying estimation problem that may be efficiently solved with a modified Bahl, Cocke, Jelinek and Raviv (BCJR) algorithm.