Sequential sequence estimation for CPM

Gerhard Kramer, Ed Shwedyk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A major disadvantage of CPM is the complexity of the optimal receiver. The number of states in the trellis repesentation are on the order of ML, where M is the modulation alphabet size and L the memory imposed by the modulation scheme. Here we investigate the reduction of the graph search by using a sequential search.

Original languageEnglish
Title of host publicationProceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages334
Number of pages1
ISBN (Print)0780320158, 9780780320154
DOIs
StatePublished - 1994
Externally publishedYes
Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway
Duration: 27 Jun 19941 Jul 1994

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/TerritoryNorway
CityTrondheim
Period27/06/941/07/94

Fingerprint

Dive into the research topics of 'Sequential sequence estimation for CPM'. Together they form a unique fingerprint.

Cite this