Decoding of severely filtered modulation codes using the M-algorithm
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The decoding of signals in infinite intersymbol interference caused by severe filtering is considered. A state-variable representation of a linear system is used to define the decoder tree. Tree decoding is then performed by the M-algorithm. It is shown through simulations that performance close to the optimal receiver can be obtained while realizing significant computational savings. Binary phase-shift keying with rectangular baseband pulse shaping and continuous phase/frequency-shift-keyed signals are considered. The channel is modeled as a narrowband filter with two and four-pole Butterworth spectra with symbol-rate normalized 3-dB bandwidths of 0.1 and 0.25.Keywords
This publication has 6 references indexed in Scilit:
- Asymptotic error performance of modulation codes in the presence of severe intersymbol interferenceIEEE Transactions on Information Theory, 1988
- Digital Phase ModulationPublished by Springer Nature ,1986
- Sequential Coding Algorithms: A Survey and Cost AnalysisIEEE Transactions on Communications, 1984
- A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratiosIEEE Transactions on Information Theory, 1977
- The viterbi algorithmProceedings of the IEEE, 1973
- Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interferenceIEEE Transactions on Information Theory, 1972