An Optimal Detector for Hierarchical $2^n$ QAM

TL;DR

This paper presents a scalable, optimal detection algorithm for hierarchical Gray-coded 2^n QAM, utilizing successive interference cancellation, which improves efficiency and storage requirements in software-defined communication systems.

Contribution

It introduces a novel optimal detection algorithm based on successive interference cancellation for hierarchical 2^n QAM, reducing storage needs compared to traditional methods.

Findings

Performs well in additive white Gaussian noise channels

Requires less storage than conventional detection algorithms

Equivalent to a SAR-ADC in successive approximation

Abstract

A practical and scalable, optimal detection algorithm is introduced for hierarchical Gray-coded $2^n$ QAM for application in software defined communications. The introduced optimal detection algorithm is based on successive interference cancellation and is equivalent to a successive approximation analog to digital conversion (SAR-ADC). The performance of the optimal detector is discussed in additive white Gaussian noise channels. The proposed detection algorithm needs much less storage space than the conventional optimal detection algorithm followed by table lookup.