Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/5925
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorLuo, Zhi-Quan (Tom)en_US
dc.contributor.authorLu, Junen_US
dc.date.accessioned2014-06-18T16:33:31Z-
dc.date.available2014-06-18T16:33:31Z-
dc.date.created2010-05-04en_US
dc.date.issued2004-04en_US
dc.identifier.otheropendissertations/1267en_US
dc.identifier.other2431en_US
dc.identifier.other1297443en_US
dc.identifier.urihttp://hdl.handle.net/11375/5925-
dc.description.abstract<p>This thesis addresses the blind signal separation (BSS) problem. The essence of the BSS problem is to recover a set of source signals from a group of sensor observations. These observations can be modeled as instantaneous or convolutive mixtures of the sources. Accordingly, the BSS problem is known as blind separation of instantaneously mixed signals or blind separation of convolutively mixed signals. In this thesis, we tackle both problems. For blind separation of instantaneously mixed signals, we first cast the separation problem as an optimization problem using mutual information based criterion, and solve it with an extended Newton's method on the Stiefel manifold. Then, for a special case in which the sources are constant modulus (CM) signals, we formulate the separation problem a constrained minimization problem utilizing the constant modulus property of the signal. Again, we solve it using the Newton's method on the Stiefel manifold. For the problem of blind separation of convolutively mixed signals, which is also known as blind deconvolution problem, we first propose a time domain method. We cast the separation problem as an optimization problem using a mutual information based criterion and solve it using a sequential quadratic programming (SQP) method. Then, we propose a set of higher-order statistics (HOS) based criteria for blind deconvolution. We also discuss the relationship of our proposed criteria and other HOS based criteria. We then propose a frequency domain HOS based blind channel identification approach. In this approach, we identify the channel frequency response by jointly diagonalizing a set of so called polyspectrnm matrices. Finally, we propose a second-order statistics (SOS) based method for blind channel identification. Assuming the channel inputs are cyclostationary signals, we identify the channel frequency response through the singular value decomposition (SVD) of a cyclic cross-spectrum based matrix. Numerical simulations are used throughout this thesis to compare our proposed methods with other methods from the literature and to demonstrate the validity and competitiveness of our proposed methods.</p>en_US
dc.subjectElectrical and Computer Engineeringen_US
dc.subjectElectrical and Computer Engineeringen_US
dc.titleBlind Signal Separationen_US
dc.typethesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
11.47 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue