## Abstract

In this paper we present a novel maximum-likelihood polynomial-time algorithm for noncoherent detection of PAM over fading channels. The algorithm is based on a geometric interpretation of the noncoherent detection metric. This interpretation leads to a novel low complexity decoder based on an angular criterion, rather than the usual Euclidean distance sense. We prove that the ML estimate of the data must lie in a reduced search space which is of log-linear complexity with the block length. We then provide an algorithm that enumerates the codewords and their corresponding metrics in an efficient, recursive manner. We also consider detection of ASK, by combining the maximum-likelihood algorithm with a simple phase estimator.

Original language | English |
---|---|

Title of host publication | 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Proceedings |

Place of Publication | Piscataway, NJ |

Publisher | Institute of Electrical and Electronics Engineers (IEEE) |

Pages | 1703-1707 |

Number of pages | 5 |

Volume | 4 |

ISBN (Print) | 0780393929, 9780780393929 |

Publication status | Published - 2006 |

Externally published | Yes |

Event | 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring - Melbourne, Australia Duration: 7 May 2006 → 10 Jul 2006 |

### Other

Other | 2006 IEEE 63rd Vehicular Technology Conference, VTC 2006-Spring |
---|---|

Country | Australia |

City | Melbourne |

Period | 7/05/06 → 10/07/06 |