### Abstract

Existing maximum-likelihood sequence estimation (MLSE) schemes for channels with memory, resulting in intersymbol interference (ISI), have typically been implemented using the Viterbi algorithm (VA). For memoryless modulation schemes the resulting search complexity is O(M^{L}), where M is the alphabet size and L is the length of the ISI span in channel signaling intervals. This complexity renders the VA impractical for large M and/or L. In this paper we describe the structure and properties of a novel reduced-complexity iterative MLSE scheme based upon the expectation-maximization (EM) algorithm. This reduced-complexity iterative MLSE scheme is shown to have complexity O(LM) at each iteration. The approach provides an attractive alternative to the VA for large signaling alphabets and/or ISI span.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 1993 IEEE International Symposium on Information Theory |

Publisher | Publ by IEEE |

Number of pages | 1 |

ISBN (Print) | 0780308786 |

State | Published - Jan 1 1993 |

Event | Proceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA Duration: Jan 17 1993 → Jan 22 1993 |

### Publication series

Name | Proceedings of the 1993 IEEE International Symposium on Information Theory |
---|

### Other

Other | Proceedings of the 1993 IEEE International Symposium on Information Theory |
---|---|

City | San Antonio, TX, USA |

Period | 1/17/93 → 1/22/93 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 1993 IEEE International Symposium on Information Theory*(Proceedings of the 1993 IEEE International Symposium on Information Theory). Publ by IEEE.