A soft-decision decoding algorithm, successive-erasure decoding (SED), is presented for decoding of Reed-Solomon- (RS-) coded M-ary phase-shift-keying (MPSK) schemes. This decoding procedure, originally introduced by G.D. Forney (1963) in connection with generalized minimum-distance (GMD) decoding, utilizes channel measurement information, (CMI) in its algebraic decoding algorithm, The performance evaluation of some RS-coded MPSK schemes shows that the use of such information bridges the gap in performance between hard-decision decoding (HDD) and maximum-likelihood decoding (MLD). For example, for RS (7, 5)-coded, 8PSK, SED provides 3.5-6-dB coding gain, at P/sub b/=10/sup -5/, compared to errors-and-erasures and errors-only decodings, respectively. This coding gain is only 1.4 dB less than the gain achievable by MLD. The performance of the SED algorithm is improved by an additional 0.7 dB when the channel state information (CSI) is used.<<ETX>>
[1]
Jack K. Wolf,et al.
Efficient maximum likelihood decoding of linear block codes using a trellis
,
1978,
IEEE Trans. Inf. Theory.
[2]
T. Le-Ngoc,et al.
On the performance of bandwidth efficient RS coded MPSK signaling over a Rayleigh fading channel
,
1991,
ICC 91 International Conference on Communications Conference Record.
[3]
Carl-Erik W. Sundberg,et al.
A note on soft decision decoding with successive erasures (Corresp.)
,
1976,
IEEE Trans. Inf. Theory.
[4]
T. Le-Ngoc,et al.
Soft decision decoding for bandwidth efficient RS coded MPSK schemes over a Rayleigh fading channel
,
1991,
MILCOM 91 - Conference record.
[5]
David Chase,et al.
Class of algorithms for decoding block codes with channel measurement information
,
1972,
IEEE Trans. Inf. Theory.