An asymptotic optimal algorithm for modulation classification

A suboptimal algorithm for modulation classification was proposed for classifying the modulation type of general M-ary phase-shifted keying (MPSK) signals. Yang and Soliman (see IEEE Trans. Aerosp. Electron. Syst., vol.33, no.1, p.38-45, 1997) approximated the phase probability density function of a...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 1998-05, Vol.2 (5), p.117-119
Main Authors: Yang, Yawpo, Liu, Ching-Hwa
Format: Article
Language:English
Subjects:
Additive white noise
AWGN
Binary phase shift keying
Classification algorithms
Phase modulation
Phase shift keying
Probability density function
Quadrature phase shift keying
Statistical analysis
Testing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A suboptimal algorithm for modulation classification was proposed for classifying the modulation type of general M-ary phase-shifted keying (MPSK) signals. Yang and Soliman (see IEEE Trans. Aerosp. Electron. Syst., vol.33, no.1, p.38-45, 1997) approximated the phase probability density function of a received signal to be the Tikhonov function. Instead, we employ the exact phase density function and derive an asymptotic optimal classification algorithm. We show a structure of this proposed classifier for continuous wave (CW), binary phase-shift keying (BPSK), quaternary phase-shift keying (QPSK), and 8PSK. Besides, we give an example to demonstrate the capability of this algorithm and compare its performance to that in Yang and Soliman. It is shown that the performance is more effective.
ISSN:1089-7798
1558-2558
DOI:10.1109/4234.673652