Likelihood-Based AMC

The classifier computes the likelihood function for each candidate modulation scheme given the received I/Q samples. The modulation that maximizes this probability is selected as the classification output.

• Optimality: Achieves the theoretical lower bound on classification error probability under known channel conditions
• Decision metric: Typically uses the log-likelihood ratio (LLR) to avoid numerical underflow
• Observation length: Classification accuracy improves monotonically with more received symbols

ALRT treats unknown signal parameters—such as carrier phase offset, timing offset, and channel gain—as random variables and averages the likelihood function over their probability distributions.

• Marginalization: Integrates over nuisance parameter distributions to produce a modulation-dependent marginal likelihood
• Robustness: Handles composite hypothesis testing where parameters are not deterministically known
• Computational cost: Requires multi-dimensional integration, often addressed via numerical quadrature or Monte Carlo methods

GLRT jointly estimates unknown parameters via maximum likelihood estimation and plugs these estimates into the likelihood function, avoiding the computational burden of full marginalization.

• Two-stage process: First estimate channel parameters under each modulation hypothesis, then compare concentrated likelihoods
• Asymptotic equivalence: Converges to ALRT performance as observation length increases
• Practical trade-off: Lower computational complexity than ALRT with near-optimal performance at moderate to high SNR

HLRT combines ALRT and GLRT by averaging over a subset of unknown parameters while estimating the remainder via maximum likelihood. This balances computational tractability with statistical rigor.

• Selective marginalization: Averages over discrete parameters (e.g., transmitted symbols) while estimating continuous parameters (e.g., channel phase)
• Flexible framework: Allows the designer to allocate computational resources to the most impactful uncertainty sources
• Common application: Averaging over unknown data symbols while performing ML estimation of carrier phase and timing

QHLRT approximates the expectation in HLRT using Monte Carlo integration or importance sampling, making it feasible for modulation schemes with large constellation sizes where exact averaging is prohibitive.

• Stochastic approximation: Replaces analytical expectations with sample averages drawn from the prior distribution
• Bias-variance trade-off: Approximation quality depends on the number of Monte Carlo samples used
• Scalability: Extends likelihood-based methods to higher-order QAM (64-QAM, 256-QAM) where exact marginalization is combinatorially explosive

The primary vulnerability of likelihood-based AMC is model mismatch—when the assumed channel distribution diverges from reality, the classifier loses its optimality guarantees.

• Sensitivity analysis: Classification accuracy degrades sharply when the assumed noise variance or fading distribution is incorrect
• Robustness techniques: Composite hypothesis testing with non-informative priors can mitigate mismatch effects
• Comparison to deep learning: Feature-based and neural network classifiers often outperform likelihood-based methods when channel models are uncertain or non-stationary

The statistical engine driving likelihood-based AMC. MLE selects the modulation hypothesis that maximizes the probability of observing the received signal. Key characteristics:

• Computes the likelihood function for each candidate modulation scheme
• Requires a priori knowledge of channel parameters (noise variance, phase offset)
• Achieves the theoretical lower bound on classification error probability
• Computationally intensive due to multi-dimensional integration over unknown parameters

The gold-standard likelihood-based classifier that treats unknown signal parameters as random variables with known probability density functions. Operational mechanics:

• Averages the likelihood function over the prior distributions of nuisance parameters
• Produces a marginal likelihood for each modulation candidate
• Computationally prohibitive for high-dimensional parameter spaces
• Serves as the theoretical benchmark against which suboptimal classifiers are measured

A practical approximation to the ALRT that replaces integration with maximization. Implementation details:

• Estimates unknown parameters via maximum likelihood estimation under each hypothesis
• Substitutes estimated values into the likelihood function as if they were the true values
• Significantly reduces computational complexity compared to ALRT
• Performance approaches ALRT asymptotically as observation length increases
• Widely deployed in real-time systems where latency constraints preclude full integration

A balanced approach that averages over a subset of random parameters while maximizing over deterministic unknowns. Design philosophy:

• Treats phase offset as a uniformly distributed random variable (averaged)
• Treats symbol timing as a deterministic unknown (maximized)
• Strikes a complexity-performance tradeoff between ALRT and GLRT
• Particularly effective for constant-envelope modulations like M-PSK where phase uncertainty dominates
• Requires careful engineering judgment to partition parameters into random vs. deterministic categories

A simplified likelihood metric that approximates the full log-likelihood function using sufficient statistics. Computational advantages:

• Reduces the I/Q sample sequence to a compact set of summary statistics
• Enables recursive implementation for streaming signal processing
• Maintains near-optimal performance when the signal model assumptions hold
• Sensitive to model mismatch—performance degrades when actual channel conditions deviate from assumptions
• Commonly used in embedded systems with limited floating-point resources

The critical preprocessing step that determines the viability of likelihood-based AMC in real-world deployments. Essential parameters:

• Carrier Frequency Offset (CFO): Must be estimated to within fractions of the symbol rate to prevent constellation rotation
• Symbol Timing Recovery: Required to align sampling instants with optimal decision points
• Noise Variance Estimation: Directly impacts the likelihood computation and threshold setting
• Phase Offset Tracking: Critical for coherent modulation schemes like QAM
• Blind estimation techniques (e.g., cyclostationary analysis) are preferred when training sequences are unavailable