DocumentCode :
2368616
Title :
Decoding of severely filtered modulation codes using the M-algorithm
Author :
Seshadri, Nambirajan ; Anderson, John B.
Author_Institution :
AT&T Bell Lab., Murray Hill, NJ, USA
fYear :
1988
fDate :
12-15 June 1988
Firstpage :
1687
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 :
decoding; encoding; filtering and prediction theory; frequency shift keying; intersymbol interference; modulation; phase shift keying; Butterworth spectra; M-algorithm; binary phase-shift keying; continuous phase/frequency-shift-keyed signals; decoder tree; infinite intersymbol interference; linear system; narrowband filter; optimal receiver; rectangular baseband pulse shaping; severely filtered modulation codes; signal decoding; state-variable representation; Baseband; Computational modeling; Decoding; Filtering; Frequency; Intersymbol interference; Linear systems; Modulation coding; Phase shift keying; Pulse shaping methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 1988. ICC '88. Digital Technology - Spanning the Universe. Conference Record., IEEE International Conference on
Conference_Location :
Philadelphia, PA, USA
Type :
conf
DOI :
10.1109/ICC.1988.13833
Filename :
13833
Link To Document :
بازگشت