Iterative channel estimation and decoding receivers have evolved over the years, most especially with Turbo and LPDC codes. Nevertheless, few works have determined the performance of symbol level Reed-Solomon (RS) codes in iterative receiver structures. The iterative channel estimation and symbol level RS decoding receiver structure found in literature concentrate on M-QAM systems over flat Rayleigh fading channels. In this paper, attention is focused on the performance of RS codes in iterative channel estimation and decoding receiver structures for Orthogonal Frequency Division Multiplexing (OFDM) systems on frequency-selective Rayleigh fading channels. Firstly, the paper extends the Koetter and Vardy (KV) RS iterative receiver structure over flat Rayleigh fading channels to frequency-selective Rayleigh fading channels. In addition, the paper develops a symbol level RS iterative receiver structure for OFDM systems on frequency-selective Rayleigh fading channels based on the Parity-check matrix Transformation Algorithm (PTA). The performance of the RS-KV and RS-PTA iterative receiver structures for OFDM systems are documented through computer simulation. The simulation results verify that both iterative receiver structures are suitable for real time RS OFDM wireless applications. The results also show that the developed RS-PTA iterative receiver structure is a low complexity and high performance alternative to the RS-KV iterative receiver structure.

A direct short proof of Horiguchi's formula for error values in alternant codes is provided. Horiguchi's formula employs only output polynomials of Berlekamp-Massey algorithm, which has less computational complexity than extended Euclidean algorithm for decoding alternant codes. As an application of our proof, we provide an explicit formula for the generator and parity check matrices of alternant codes and their singly- and doubly-extended codes.

In this paper, we propose a partial erasure decoding scheme with erasure-decision threshold for Reed-Solomon (RS) codes and analyze its performance in frequency-hopped multiple-access communications. RS code is used to correct erasures and errors caused by other-user interference. Binary FSK is employed to transmit the channel symbol. The proposed decoder decides whether to erase the received RS code symbol based on the ersure decsion threshold. The approximated formula for optimal erasure decision threshold is derived in such a way that packet error probability can be minimized. Numerical results show that the employment of adaptive erasure decision threshold attains the higher normalized throughput in the areas of high channel traffic cases.

We analyze the error probability performance of multi-pulse pulse position modulation (MPPM) in noisy photon counting channel. Moreover we investigate the error perofrmance of convolutional coded MPPM and RS coded MPPM in noisy photon counting channel. We define a distance between symbols as the number of nonoverlapping pulses in one symbol, and by using the distance we analyze the error performance of MPPM in noisy photon counting channel. It is shown that MPPM has better performance than PPM in the error probability performance in noisy photon counting channel. For PPM in noisy photon counting channel, convolutional codes are more effective than RS codes to reduce the average transmitting power. For MPPM in noisy photon counting channel, however, RS codes are shown to be more effective than convolutional codes.