A unified framework for finite-memory detection
- 6 September 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 23 (9) , 1697-1706
Abstract
In this paper, we present a general approach to finite-memory detection. From a semi-tutorial perspective, a number of previous results are rederived and new insights are gained within a unified framework. A probabilistic derivation of the well-known Viterbi algorithm, forward-backward, and sum-product algorithms, shows that a basic metric emerges naturally under very general causality and finite-memory conditions. This result implies that detection solutions based on one algorithm can be systematically extended to other algorithms. For stochastic channels described by a suitable parametric model, a conditional Markov property is shown to imply this finite-memory condition. This conditional Markov property, although seldom met exactly in practice, is shown to represent a reasonable and useful approximation in all considered cases. We consider, as examples, linear predictive and noncoherent detection schemes. While good performance for increasing complexity can often be achieved with a finite-memory detection strategy, key issues in the design of detection algorithms are the computational efficiency and the performance for limited complexity.Keywords
This publication has 35 references indexed in Scilit:
- On the Application of Factor Graphs and the Sum–Product Algorithm to ISI ChannelsIEEE Transactions on Communications, 2005
- Reduced-state BCJR-type algorithmsIEEE Journal on Selected Areas in Communications, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Optimal and sub‐optimal maximum a posteriori algorithms suitable for turbo decodingEuropean Transactions on Telecommunications, 1997
- Noncoherent coded modulationIEEE Transactions on Communications, 1996
- Optimal decoding of coded PSK and QAM signals in correlated fast fading channels and AWGN: a combined envelope, multiple differential and coherent detection approachIEEE Transactions on Communications, 1994
- Maximum likelihood sequence estimation of CPM signals transmitted over Rayleigh flat-fading channelsIEEE Transactions on Communications, 1990
- Channel coding with multilevel/phase signalsIEEE Transactions on Information Theory, 1982
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974