Abstract
We propose a decision-feedback decoder for coded signals transmitted over finite-state Markov channels. The decoder achieves maximum-likelihood sequence detection (in the absence of feedback errors) with very low complexity by exploiting previous bit decisions and the Markov structure of the channel. We also propose a similar decoder, the output-feedback decoder, that does not use previous bit decisions and therefore does not suffer from error propagation. The decoders' performance is determined using a new sliding window analysis technique as well as by simulation. Both decoders exhibit excellent bit error rate performance with a relatively low complexity that is independent of the channel decorrelation time.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 524-531 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Communications |
| Volume | 50 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2002 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
Keywords
- Coded modulation
- Decision-feedback decoding
- Finite-state Markov channel
- Maximum-likelihood decoding