Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systems
Paper in proceedings, 2012

The performance of maximum likelihood detection of a coded modulation scheme over an additive white Gaussian noise channel can be predicted precisely by its Euclidean distance spectrum. In this paper, three algorithms are developed to generate the Euclidean distance spectra. The first algorithm is an exhaustive tree-search algorithm which is simplified by exploiting the correspondence between a code tree and the trellis. This algorithm is then modified to incorporate the A* algorithm and results in two heuristic algorithms. Moreover, the technique of trellis minimization is further developed for the multi user case and employed to reduce the complexity and memory requirements. Numerical results confirm that the proposed algorithms can generate the distance spectra of all systems with lower complexity relative to previous methods and are particularly suited for multi user CPM systems.


Lower complexity

Numerical results

Coded modulation

Additive white Gaussian noise channel

Memory requirements


Distance spectra

Continuous phase modulation

Maximum likelihood detection

Euclidean distance


L. Bing

Xidian University

Tor Aulin

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Bo Bai

Xidian University

2012 IEEE International Symposium on Information Theory, ISIT 2012. Cambridge, MA, 1 - 6 July 2012

978-146732579-0 (ISBN)

Subject Categories

Computer and Information Science





More information