Bhattacharyya Distance

The Bhattacharyya distance measures the amount of overlap between two probability distributions. In signal constellation classification, it quantifies how much the Gaussian noise clouds surrounding two adjacent IQ constellation points intersect. A distance of zero indicates complete overlap (identical distributions), while a larger distance signifies high separability and lower classification error.

The Bhattacharyya distance provides a theoretical upper bound on the probability of error in a binary hypothesis test. For modulation classification, this translates to a tight bound on the likelihood of confusing two candidate constellation points. This property makes it a superior feature selection criterion compared to simple Euclidean distance, as it accounts for the shape and spread of the noise distribution.

When the received IQ clusters are modeled as multivariate Gaussian distributions, the Bhattacharyya distance has a closed-form analytical expression. It is computed directly from the mean vectors (centroids) and covariance matrices (cluster shapes) of the two signal states. This analytical tractability makes it a practical tool for theoretical performance analysis of modulation classifiers.

The Bhattacharyya distance is a special case of the Chernoff information, specifically when the Chernoff parameter is set to 0.5. It represents the exponential rate at which the Bayesian error probability decays with the number of independent observations. This connection grounds the metric in fundamental information theory and decision theory.

In automatic modulation classification systems, the Bhattacharyya distance is used as a feature ranking metric. By computing the distance between all pairs of modulation classes in a candidate feature space (e.g., cumulants, spectral features), engineers can select the feature subset that maximizes the minimum inter-class distance, guaranteeing the best theoretical classification performance.

Unlike the Mahalanobis distance, the Bhattacharyya distance accounts for differences in both the means and the covariances of the two distributions. This is critical in realistic RF channels where different constellation points may experience varying levels of distortion, causing their noise clouds to have different shapes and orientations in the IQ plane.

A geometric threshold in the IQ plane partitioning the signal space into distinct Voronoi regions. The Bhattacharyya distance directly quantifies the overlap of conditional probability densities across these boundaries. A lower Bhattacharyya coefficient between two constellation points indicates a clearer, more robust decision boundary and a lower probability of symbol error.

An optimal detection strategy classifying a received signal point by selecting the constellation symbol with the smallest Euclidean distance. While minimum distance decoding is optimal for AWGN, the Bhattacharyya distance provides a more general bound on error probability that accounts for the full shape of the noise distribution, not just the distance between centroids.

Statistical measures invariant to Gaussian noise and phase rotation, used as robust feature vectors for hierarchical modulation classification. The Bhattacharyya distance is often employed in feature selection to rank the discriminative power of individual cumulants by measuring the overlap between their empirical distributions for different modulation candidates.

A metric measuring the Euclidean distance between the ideal reference constellation point and the actual received signal point. While EVM quantifies signal fidelity, the Bhattacharyya distance provides a theoretical performance bound by modeling the statistical overlap of received clusters, enabling system designers to predict classification error floors before deployment.