Answers are grounded in this paper and cite their sources.
This paper presents a reduced complexity Viterbi algorithm for use as sequence estimator for linear intersymbol interference channels with coarsely located coefficients. In particular, the complexity does not depend on the channel impulse response length but only on the number of nonzero coefficients. No approximations are used in the algorithm. We consider a multipath environment producing time spreads.
No takes yet. Share an insight, caveat, or question.
Benvenuto et al. (1996) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: