Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2018, Article ID 7318043, 12 pages
https://doi.org/10.1155/2018/7318043
Research Article

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

1Department of Electrical and Electronic Engineering, Yonsei University, Seoul 120-749, Republic of Korea
2Department of Electrical and Computer Engineering, Seoul National University, Seoul 151-742, Republic of Korea
3Agency for Defense Development, Daejeon 305-600, Republic of Korea

Correspondence should be addressed to Hong-Yeop Song; rk.ca.iesnoy@gnosyh

Received 4 September 2017; Accepted 27 December 2017; Published 24 January 2018

Academic Editor: Kiseon Kim

Copyright © 2018 Jinsoo Park et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

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.