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

Jinsoo Park; Gangsan Kim; Hong Yeop Song; Chanki Kim; Jong Seon No; Suil Kim

doi:10.1155/2018/7318043

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

Jinsoo Park, Gangsan Kim, Hong Yeop Song, Chanki Kim, Jong Seon No, Suil Kim

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	7318043
Journal	Security and Communication Networks
Volume	2018
DOIs	https://doi.org/10.1155/2018/7318043
Publication status	Published - 2018

Bibliographical note

Funding Information:
funded by the Defense Acquisition Program Administration (DAPA)

Publisher Copyright:
© 2018 Jinsoo Park et al.

All Science Journal Classification (ASJC) codes

Information Systems
Computer Networks and Communications

Access to Document

10.1155/2018/7318043

Cite this

@article{f850a262ab3a4ac7918e563c364a7568,

title = "Analysis of Iterative Erasure Insertion and Decoding of FH/MFSK Systems without Channel State Information",

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.",

author = "Jinsoo Park and Gangsan Kim and Song, {Hong Yeop} and Chanki Kim and No, {Jong Seon} and Suil Kim",

note = "Funding Information: funded by the Defense Acquisition Program Administration (DAPA) Publisher Copyright: {\textcopyright} 2018 Jinsoo Park et al.",

year = "2018",

doi = "10.1155/2018/7318043",

language = "English",

volume = "2018",

journal = "Security and Communication Networks",

issn = "1939-0114",

publisher = "John Wiley and Sons Inc.",

}

TY - JOUR

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

AU - Park, Jinsoo

AU - Kim, Gangsan

AU - Song, Hong Yeop

AU - Kim, Chanki

AU - No, Jong Seon

AU - Kim, Suil

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85041720392&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041720392&partnerID=8YFLogxK

U2 - 10.1155/2018/7318043

DO - 10.1155/2018/7318043

M3 - Article

AN - SCOPUS:85041720392

SN - 1939-0114

VL - 2018

JO - Security and Communication Networks

JF - Security and Communication Networks

M1 - 7318043

ER -

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

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this