Blind Source Separation Algorithms Using Hyperbolic and Givens Rotations for High-Order QAM Constellations

Handle URI:
http://hdl.handle.net/10754/626225
Title:
Blind Source Separation Algorithms Using Hyperbolic and Givens Rotations for High-Order QAM Constellations
Authors:
Shah, Syed Awais Wahab; Abed-Meraim, Karim; Al-Naffouri, Tareq Y.
Abstract:
This paper addresses the problem of blind demixing of instantaneous mixtures in a multiple-input multiple-output communication system. The main objective is to present efficient blind source separation (BSS) algorithms dedicated to moderate or high-order QAM constellations. Four new iterative batch BSS algorithms are presented dealing with the multimodulus (MM) and alphabet matched (AM) criteria. For the optimization of these cost functions, iterative methods of Givens and hyperbolic rotations are used. A pre-whitening operation is also utilized to reduce the complexity of design problem. It is noticed that the designed algorithms using Givens rotations gives satisfactory performance only for large number of samples. However, for small number of samples, the algorithms designed by combining both Givens and hyperbolic rotations compensate for the ill-whitening that occurs in this case and thus improves the performance. Two algorithms dealing with the MM criterion are presented for moderate order QAM signals such as 16-QAM. The other two dealing with the AM criterion are presented for high-order QAM signals. These methods are finally compared with the state of art batch BSS algorithms in terms of signal-to-interference and noise ratio, symbol error rate and convergence rate. Simulation results show that the proposed methods outperform the contemporary batch BSS algorithms.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Shah SAW, Abed-Meraim K, Al-Naffouri TY (2017) Blind Source Separation Algorithms Using Hyperbolic and Givens Rotations for High-Order QAM Constellations. IEEE Transactions on Signal Processing: 1–1. Available: http://dx.doi.org/10.1109/TSP.2017.2777392.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Signal Processing
Issue Date:
24-Nov-2017
DOI:
10.1109/TSP.2017.2777392
Type:
Article
ISSN:
1053-587X; 1941-0476
Sponsors:
King Abdullah University of Science and Technology[OSR-2016-KKI-2899]
Additional Links:
http://ieeexplore.ieee.org/document/8119869/
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorShah, Syed Awais Wahaben
dc.contributor.authorAbed-Meraim, Karimen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.date.accessioned2017-11-29T11:13:55Z-
dc.date.available2017-11-29T11:13:55Z-
dc.date.issued2017-11-24en
dc.identifier.citationShah SAW, Abed-Meraim K, Al-Naffouri TY (2017) Blind Source Separation Algorithms Using Hyperbolic and Givens Rotations for High-Order QAM Constellations. IEEE Transactions on Signal Processing: 1–1. Available: http://dx.doi.org/10.1109/TSP.2017.2777392.en
dc.identifier.issn1053-587Xen
dc.identifier.issn1941-0476en
dc.identifier.doi10.1109/TSP.2017.2777392en
dc.identifier.urihttp://hdl.handle.net/10754/626225-
dc.description.abstractThis paper addresses the problem of blind demixing of instantaneous mixtures in a multiple-input multiple-output communication system. The main objective is to present efficient blind source separation (BSS) algorithms dedicated to moderate or high-order QAM constellations. Four new iterative batch BSS algorithms are presented dealing with the multimodulus (MM) and alphabet matched (AM) criteria. For the optimization of these cost functions, iterative methods of Givens and hyperbolic rotations are used. A pre-whitening operation is also utilized to reduce the complexity of design problem. It is noticed that the designed algorithms using Givens rotations gives satisfactory performance only for large number of samples. However, for small number of samples, the algorithms designed by combining both Givens and hyperbolic rotations compensate for the ill-whitening that occurs in this case and thus improves the performance. Two algorithms dealing with the MM criterion are presented for moderate order QAM signals such as 16-QAM. The other two dealing with the AM criterion are presented for high-order QAM signals. These methods are finally compared with the state of art batch BSS algorithms in terms of signal-to-interference and noise ratio, symbol error rate and convergence rate. Simulation results show that the proposed methods outperform the contemporary batch BSS algorithms.en
dc.description.sponsorshipKing Abdullah University of Science and Technology[OSR-2016-KKI-2899]en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/8119869/en
dc.rights(c) 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectblind source separationen
dc.subjectconstant modulus algorithmen
dc.subjectmultimodulus algorithmen
dc.subjectconstellation matched erroren
dc.subjectalphabet matched algorithmen
dc.subjectGivens and hyperbolic rotationsen
dc.titleBlind Source Separation Algorithms Using Hyperbolic and Givens Rotations for High-Order QAM Constellationsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Signal Processingen
dc.eprint.versionPost-printen
dc.contributor.institutionElectrical Engineering, King Fahd University of Petroleum and Minerals, Dhahran Saudi Arabiaen
dc.contributor.institutionPolytech Orléans, Orleans Franceen
kaust.authorAl-Naffouri, Tareq Y.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.