Analysis of Iterative Erasure Insertion and Decoding of FH/MFSK Systems without Channel State Information

We analyze the symbol measures for iterative erasure insertion and decoding of a Reed-Solomon coded SFH/MFSK system over jamming channels. In contrast to conventional erasure insertion schemes, iterative schemes do not require any preoptimized threshold or channel state information at the receiver. We confirm the performance improvement using a generalized minimum distance (GMD) decoding method with three different symbol measures. To analyze performance, we propose a new analysis framework considering the "trapped-error" probability. From analysis and the simulation results, we show that ratio-based GMD decoding has the best performance among the one-dimensional iterative erasure insertion and decoding schemes.