CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systems

L. Bing ; Tor Aulin (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; B. Bai
2012 IEEE International Symposium on Information Theory, ISIT 2012. Cambridge, MA, 1 - 6 July 2012 p. 2391-2395. (2012)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Additive white Gaussian noise channel, Coded modulation, Continuous phase modulation, Distance spectra, Euclidean distance, Lower complexity, Maximum likelihood detection, Memory requirements, Multi-user, Numerical results, Tree-search

Denna post skapades 2012-11-15. Senast ändrad 2016-08-16.
CPL Pubid: 166092


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)


Data- och informationsvetenskap

Chalmers infrastruktur