4.7 Article

Likelihood-Based Modulation Classification for Multiple-Antenna Receiver

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 61, Issue 9, Pages 3816-3829

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2013.073113.121001

Keywords

Cramer-Rao lower bound; modulation classification; multiple antennas; non-data-aided estimation; rectangular QAM

Funding

  1. Defense Research and Development Canada (DRDC)
  2. Ministry of Knowledge Economy (MKE), Korea, under the Information Technology Research Center (ITRC) support program [NIPA-2012-(H0301-12-1005)]
  3. NRF
  4. Korea government (MEST) [2012-047720]
  5. Ministry of Public Safety & Security (MPSS), Republic of Korea [H0301-12-1005, H0301-13-1005] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

Likelihood-based algorithms for the classification of linear digital modulations are systematically investigated for a multiple receive antennas configuration. Existing modulation classification (MC) algorithms are first extended to the case of multiple receive antennas and then a critical problem is identified that the overall performance of the multiple antenna systems is dominated by the worst channel estimate of a particular antenna. To address the performance degradation issue, we propose a new MC algorithm by optimally combining the log likelihood functions (LLFs). Furthermore, to analyze the upper-bound performance of the existing and the proposed MC algorithms, the exact Cramer-Rao Lower Bound (CRLB) expressions of non-data-aided joint estimates of amplitude, phase, and noise variance are derived for general rectangular quadrature amplitude modulation (QAM). Numerical results demonstrate the accuracy of the CRLB expressions and verify that the results reported in the literature for quadrature phase-shift keying (QPSK) and 16-QAM are special cases of our derived expressions. Also, it is demonstrated that the probability of correct classification of the new algorithm approaches the theoretical bounds and a substantial performance improvement is achieved compared to the existing MC algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available