Title
Theoretical bound on modulation classification for multiple-input multiple-output (MIMO) systems over unknown, flat fading channels
Abstract
Likelihood-based algorithms identify the modulation of the transmitted signal based on the computation of the likelihood function of received signals under different hypotheses (modulation formats). An important class of likelihood-based algorithms for modulation classification problems first treats the unknown channels as deterministic, and replaces the channels by their estimates. In this paper, a novel theoretical bound on the performance of this class of algorithms is proposed for multiple-input multiple-output (MIMO) systems over unknown, flat fading channels. The performance bound is developed from the Cramer-Rao bound (CRB) of blind channel estimation. It provides a useful benchmark against which it is possible to compare the performance of modulation classification algorithms, and is tighter than the theoretical bound derived based on perfect channel knowledge.
Year
DOI
Venue
2015
10.1109/CISS.2015.7086878
CISS
Keywords
Field
DocType
cramer-rao bounds,mimo,modulation classification,theoretical bound,fading,signal to noise ratio,upper bound,cramer rao bound,modulation
Mimo systems,Mathematical optimization,Likelihood function,Control theory,Fading,Computer science,MIMO,Algorithm,Communication channel,Modulation,Statistical classification,Computation
Conference
Citations 
PageRank 
References 
1
0.34
3
Authors
4
Name
Order
Citations
PageRank
Yu Liu110.68
Alexander M. Haimovich261869.28
Wei Su3252.21
Emmanuel Kanterakis410.68