pith. sign in

arxiv: 1207.4680 · v3 · pith:4AFIEQNJnew · submitted 2012-07-19 · 💻 cs.IT · math.IT

Reduced Complexity Super-Trellis Decoding for Convolutionally Encoded Transmission Over ISI-Channels

classification 💻 cs.IT math.IT
keywords decodingcomplexityconvolutionallydescriptionenablesencodedestimationmatched
0
0 comments X
read the original abstract

In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-linear trellis description we can significantly reduce the number of states needed for the receiver-side Viterbi algorithm to perform maximum-likelihood sequence estimation. Further complexity reduction is achieved using the concept of reduced-state sequence estimation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.