Thesis (M. App. Sc.)--Carleton University, 2003. / Includes bibliographical references (p. 95-97). Also available in electronic format on the Internet.

Thesis (Ph. D.)--Auburn University, 2008. / Abstract. Vita. Includes bibliographical references (p. 65-71).

Thesis (M.S.)--Florida State University, 2005. / Advisor: Dr. Frank B. Gross, Florida State University, College of Engineering, Dept. of Electrical and Computer Engineering. Title and description from dissertation home page (viewed June 7, 2005). Document formatted into pages; contains xix, 131 pages. Includes bibliographical references.

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 53-54). Also available in electronic version. Access restricted to campus users.

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 2002. / Thesis advisor(s): Tri T. Ha, Jovan Lebaric. Includes bibliographical references (p. 63). Also available online.

Thesis (MS)--Montana State University--Bozeman, 2010. / Typescript. Chairperson, Graduate Committee: Brock LaMeres. Includes bibliographical references (leaves 92-96).

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2003. / Thesis advisor(s): Ha, Tri T. ; Lebaric, Jovan. "March 2003." Includes bibliographical references (p. 57-58). Also available online.

No description available.

No description available.

The increasing demand for mobile communication services without a corresponding increase in RF spectrum allocation motivates the need for new techniques to improve spectrum utilization. The CDMA and adaptive antenna array are two approaches that shows real promise for increasing spectrum efficiency. In this research, we investigate the performance of different blind adaptive array algorithms in the CDMA systems. Two novel algorithms, least-squares despread respread multitarget array (LS-DRMTA) and least-squares despread respread multitarget constant modulus algorithm (LS-DRMTCMA), are developed, and a MATLAB simulation testbed is created to compare the performance of these two novel algorithms with those of the multitarget least-squares constant modulus algorithm (MT-LSCMA) and multitarget steepest-descent decision-directed (MT-SDDD) algorithm. It is shown from the simulation results that these two novel algorithms can outperform the other algorithms in all the test situations (e.g., AWGN channel, timing offset case, frequency offset case, and multipath environment). It is also shown that these two algorithms have less complexity and can converge faster than the other algorithms. / Master of Science