TY - GEN
T1 - Sequential sequence estimation for CPM
AU - Kramer, Gerhard
AU - Shwedyk, Ed
PY - 1994
Y1 - 1994
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84894364922&partnerID=8YFLogxK
U2 - 10.1109/ISIT.1994.394684
DO - 10.1109/ISIT.1994.394684
M3 - Conference contribution
AN - SCOPUS:84894364922
SN - 0780320158
SN - 9780780320154
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 334
BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Y2 - 27 June 1994 through 1 July 1994
ER -