Exportar Publicação

Monteiro, F. A. & Wassell, I. J. (2004). The M-algorithm on the Detection of CPM Schemes on the Minimum Euclidian Distance Upper Bound. Proceedings of ECWT '04 – The European Conference on Wireless Technology - European Microwave Week. 1, 37-40

F. A. Monteiro and I. J. Wassell,  "The M-algorithm on the Detection of CPM Schemes on the Minimum Euclidian Distance Upper Bound", in Proc. of ECWT '04 – The European Conf. on Wireless Technology - European Microwave Week, Amesterdam, vol. 1, pp. 37-40, 2004

@misc{monteiro2004_1775401056808,
	author = "Monteiro, F. A. and Wassell, I. J.",
	title = "The M-algorithm on the Detection of CPM Schemes on the Minimum Euclidian Distance Upper Bound",
	year = "2004",
	howpublished = "Impresso",
	url = ""
}

TY  - CPAPER
TI  - The M-algorithm on the Detection of CPM Schemes on the Minimum Euclidian Distance Upper Bound
T2  - Proceedings of ECWT '04 – The European Conference on Wireless Technology - European Microwave Week
VL  - 1
AU  - Monteiro, F. A.
AU  - Wassell, I. J.
PY  - 2004
SP  - 37-40
CY  - Amesterdam
AB  - The impact of the M-algorithm on continuous
phase modulation (CPM) detection is analyzed when
replacing the common Viterbi algorithm (VA) on the
maximum likelihood sequence detection (MLSD) block. The algorithm is presented as a reduced complexity sequence detection algorithm in which not all transitions are propagated, being only retained a small subset of paths. A rule is found concerning the lower limit of the mandatory number of paths to retain, using simulations with additive white gaussian noise (AWGN) when detecting simple catastrophic schemes and two optimum gain schemes, in the sense they are two of the rare coincident with their respective minimum Euclidean upper bounds. The M-algorithm proves near optimum performance for very low ratios of number of traced states per total number of states.
ER  -