Answers are grounded in this paper and cite their sources.
This paper is concerned with <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</tex> -ary communication channels <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(m ≥ 2)</tex> having intersymbol interference between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</tex> time periods <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(L ≥ 2)</tex> . Receiver structures are developed for making jointly optimum (minimum probability of error) decisions about <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</tex> consecutive symbols on the basis of the complete message received. The decision statistics are computed by a sequential procedure, and the number of computations increases only linearly with the message length. The method can be applied to the general problem of making decisions about the states of a discrete-state Markov information source which is observable only through a channel with additive Gaussian or non-Gaussian noise.
No takes yet. Share an insight, caveat, or question.
Chang et al. (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: