Type of Document Master's Thesis Author Bayram, Saffet Author's Email Address firstname.lastname@example.org URN etd-12102000-183343 Title Overloaded Array Processing: System Analysis, Signal Extraction Techniques, and Time-delay Estimation Degree Master of Science Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title Reed, Jeffrey Hugh Committee Chair Boyle, Robert J. Committee Member Woerner, Brian D. Committee Member Keywords
- Joint Detection
- Interference Mitigation
- Antenna Array
- Overloaded Array
Date of Defense 2000-12-08 Availability unrestricted AbstractIn airborne communication systems such as airborne cell-extender repeaters the receiver faces the challenge of demodulating the signal of interest (SOI) in the presence of excessive amounts of Co-Channel Interference (CCI) from a large number of sources. This results in the overloaded environment where the number of near-equal power co-channel interferers exceeds the number of antenna array elements. This thesis first analyzes the interference environment experienced by an airborne cellular repeater flying at high altitudes. Link budget analysis using a two-ray propagation model shows that the antenna array mounted on an airborne receiver has to recover the SOI out of hundreds of co-channel interfering signals. This necessitates use of complex overloaded array signal processing techniques. An extensive literature survey on narrowband signal extraction algorithms shows that joint detection schemes, coupled with antenna arrays, provide a solution for narrowband overloaded array problem where as traditional beamforming techniques fail. Simulation results in this thesis investigates three "promising" overloaded array processing algorithms, Multi-User Decision Feedback Equalizer (MU-DFE), Iterative Least Squares with Projection (ILSP), and Iterative Least Squares with Enumeration (ILSE). ILSE is a non-linear joint maximum-likelihood detector, is shown to demodulate many more signals than elements even when the users are closely spaced and the channel is blindly estimated.
Multi-user time delay estimation is one of the most important aspects of channel estimation for overloaded array processing. The final chapter of the thesis proposes a low-complexity data-aided time-delay estimation structure for embedding in a Per Survivor Processing (PSP) trellis for overloaded array processing. An extensive analysis proves that the multi-user delay estimation is separable, which leads to the proposed multi-user algorithm that estimates the user delays with a bank of simple data-aided synchronization loops to reduce the complexity. This thesis shows simulation results for the single-user case where the low-complexity Delay Locked Loop (DLL) structure, working at a low oversampling rate of 2 samples per symbol, estimates and compensates for any integer or non-integer sample delay within ±Tsym(symbol period).
Two extensions to this technique are proposed to provide efficient multi-user delay estimation. The first multi-user structure employs a bank of DLLs, which compensate for the timing offset of each user simultaneously. This multi-user algorithm is suitable for CDMA-type applications, where each user has a distinct PN-code with good auto- and cross-correlation properties. We show that for spreading gain of 31, the presence of an interpolator enables us to reduce the oversampling factor from 4 to 2 samples per chip. Thus, the requirements of the A/D converter are relaxed without sacrificing system performance. Furthermore, we show that the proposed scheme meets the requirements of multi-user interference cancellation techniques for residual worst-case timing errors, i.e., residual timing error < 0.2 Tc, as reported in . Finally, the thesis recommends a similar multi-user structure for narrowband TDMA-type system, which is based on bank of DLLs with whitening pre-filters at the front end of each branch.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access thesis_etd1.pdf 1.40 Mb 00:06:30 00:03:20 00:02:55 00:01:27 00:00:07
If you have questions or technical problems, please Contact DLA.