Partitioning for SA(B,C) for CPM signals

Author

Cedergren, Andreas ; Aulin, Tor M.

Author_Institution

Ericsson Mobile Commun. AB, Lund, Sweden

Volume

1

fYear

2001

fDate

11-14 Jun 2001

Firstpage

290

Abstract

The SA(B,C) algorithm is considered for continuous phase modulation (CPM). The SA(B,C) detector performs a breadth first maximum likelihood sequence detection in the trellis under structural and complexity constraints. Given a trellis, the SA(B,C) detector partitions the states into C classes and for every time interval selects B paths into each class. To find a partition that minimizes C for a given B and CPM system, such that the performance (error event probability) approaches unconstrained MLSD when the signal to noise ratio goes to infinity, is an NP-hard problem. Here a suboptimum method for finding the partitioning is considered. Substantial savings in complexity can be made by using the SA(B,C), while achieving almost optimal (unconstrained) error performance

Keywords

computational complexity; continuous phase modulation; error statistics; maximum likelihood detection; search problems; BER; CPM signals; NP-hard problem; SA(B,C) algorithm; SA(B,C) detector; breadth first maximum likelihood sequence detection; complexity constraints; continuous phase modulation; error event probability; optimal error performance; partitioning; search algorithm; signal to noise ratio; structural constraints; suboptimum method; trellis; unconstrained MLSD; unconstrained error performance; AWGN; Additive noise; Additive white noise; Continuous phase modulation; Detectors; Maximum likelihood detection; Mobile communication; NP-hard problem; Partitioning algorithms; Signal to noise ratio;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2001. ICC 2001. IEEE International Conference on

Conference_Location

Helsinki

Print_ISBN

0-7803-7097-1

Type

conf

DOI

10.1109/ICC.2001.936319

Filename

936319