Recently, a class of generalized Reed-Muller (RM) codes has been suggested
for use in orthogonal frequency-division multiplexing. These codes offer er
ror correcting capability combined with substantially reduced peak-to-mean
power ratios. A number of approaches to decoding these codes have already b
een developed. Here, we present low complexity, suboptimal alternatives whi
ch are inspired by the classical Reed decoding algorithm for binary RM code
s. We simulate these new algorithms along with the existing decoding algori
thms using additive white Gaussian noise and two-path fading models for a p
articular choice of code. The simulations show that one of our new algorith
ms outperforms all existing suboptimal algorithms and offers performance th
at is within 0.5 dB of maximum-likelihood decoding, get has complexity comp
arable to or lower than existing decoding approaches.