Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory

J. W. Modestino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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(ML), 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 languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
ISBN (Print)0780308786
StatePublished - Jan 1 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: Jan 17 1993Jan 22 1993

Other

OtherProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period1/17/931/22/93

Fingerprint

Viterbi algorithm
Intersymbol interference
Maximum likelihood
Data storage equipment
Modulation

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Modestino, J. W. (1993). Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory. In Proceedings of the 1993 IEEE International Symposium on Information Theory Piscataway, NJ, United States: Publ by IEEE.

Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory. / Modestino, J. W.

Proceedings of the 1993 IEEE International Symposium on Information Theory. Piscataway, NJ, United States : Publ by IEEE, 1993.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Modestino, JW 1993, Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory. in Proceedings of the 1993 IEEE International Symposium on Information Theory. Publ by IEEE, Piscataway, NJ, United States, Proceedings of the 1993 IEEE International Symposium on Information Theory, San Antonio, TX, USA, 1/17/93.
Modestino JW. Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory. In Proceedings of the 1993 IEEE International Symposium on Information Theory. Piscataway, NJ, United States: Publ by IEEE. 1993
Modestino, J. W. / Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory. Proceedings of the 1993 IEEE International Symposium on Information Theory. Piscataway, NJ, United States : Publ by IEEE, 1993.
@inproceedings{c1e2afe557c141b8b36881c8920567e2,
title = "Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory",
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(ML), 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.",
author = "Modestino, {J. W.}",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "0780308786",
booktitle = "Proceedings of the 1993 IEEE International Symposium on Information Theory",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Reduced-complexity iterative maximum-likelihood sequence estimation on channels with memory

AU - Modestino, J. W.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - 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(ML), 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.

AB - 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(ML), 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.

UR - http://www.scopus.com/inward/record.url?scp=0027191646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027191646&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780308786

BT - Proceedings of the 1993 IEEE International Symposium on Information Theory

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -