Yes / A rigorous model for automatic modulation
classification (AMC) in cognitive radio (CR) systems is proposed
in this paper. This is achieved by exploiting the Kalman filter
(KF) integrated with an adaptive interacting multiple model
(IMM) for resilient estimation of the channel state information
(CSI). A novel approach is proposed, in adding up the squareroot singular values (SRSV) of the decomposed channel using the
singular value decompositions (SVD) algorithm. This new
scheme, termed Frobenius eigenmode transmission (FET), is
chiefly intended to maintain the total power of all individual
effective eigenmodes, as opposed to keeping only the dominant
one. The analysis is applied over multiple-input multiple-output
(MIMO) antennas in combination with a Rayleigh fading channel
using a quasi likelihood ratio test (QLRT) algorithm for AMC.
The expectation-maximization (EM) is employed for recursive
computation of the underlying estimation and classification
algorithms. Novel simulations demonstrate the advantages of the
combined IMM-KF structure when compared to the perfectly
known channel and maximum likelihood estimate (MLE), in
terms of achieving the targeted optimal performance with the
desirable benefit of less computational complexity loads.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/17197 |
| Date | 26 July 2019 |
| Creators | Abdul Salam, Ahmed O., Sheriff, Ray E., Hu, Yim Fun, Al-Araji, S.R., Mezher, K. |
| Publisher | Institute of Electrical and Electronic Engineers |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, Accepted manuscript |
| Rights | © 2019 IEEE. Reproduced in accordance with the publisher's self-archiving policy. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 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 component of this work in other works. |
Page generated in 0.0022 seconds