Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.02640

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.02640 (cs)
[Submitted on 3 Oct 2025 ]

Title: Anti-Jamming Modulation for OFDM Systems under Jamming Attacks

Title: 抗干扰调制用于受到干扰攻击的OFDM系统

Authors:Jaewon Yun, Joohyuk Park, Yo-Seb Jeon
Abstract: In this paper, we propose an anti-jamming communication framework for orthogonal frequency-division multiplexing (OFDM) systems under jamming attacks. To this end, we first develop an anti-jamming modulation scheme that uses a spreading matrix to distribute each symbol across multiple subcarriers, enhancing robustness against jamming. For optimal demodulation at a receiver, we devise a maximum likelihood detection (MLD) method and its low-complexity variant tailored to our anti-jamming modulation scheme in scenarios with known jamming variance. We analyze the bit error rate (BER) of our modulation scheme to optimize its modulation order according to a jamming scenario. To adapt to dynamic and unknown jamming environments, we present a jamming-adaptive communication framework consisting of two phases: (i) a jamming-noncoherent phase and (ii) a jamming-coherent phase. In the jamming-noncoherent phase, we develop an approximate MLD method that operates without prior knowledge of jamming variance and enables the estimation of jamming parameters. In the jamming-coherent phase, we use these estimated parameters to optimize the proposed modulation scheme while employing the low-complexity MLD method. Simulation results demonstrate the superior BER performance of the proposed anti-jamming framework compared to existing OFDM communication frameworks across a wide range of communication and jamming scenarios.
Abstract: 在本文中,我们提出了一种抗干扰通信框架,用于在干扰攻击下的正交频分复用(OFDM)系统。 为此,我们首先开发了一种抗干扰调制方案,该方案使用扩展矩阵将每个符号分布在多个子载波上,从而提高对干扰的鲁棒性。 为了在接收端进行最优解调,我们设计了一种最大似然检测(MLD)方法及其低复杂度变体,专门针对已知干扰方差情况下的我们的抗干扰调制方案。 我们分析了我们调制方案的比特错误率(BER),并根据干扰场景优化其调制阶数。 为了适应动态和未知的干扰环境,我们提出了一种干扰自适应通信框架,包括两个阶段:(i)干扰非相干阶段和(ii)干扰相干阶段。 在干扰非相干阶段,我们开发了一种近似MLD方法,在无需先验干扰方差知识的情况下运行,并能够估计干扰参数。 在干扰相干阶段,我们利用这些估计的参数来优化所提出的调制方案,同时采用低复杂度的MLD方法。 仿真结果表明,与现有OFDM通信框架相比,所提出的抗干扰框架在广泛的通信和干扰场景中表现出优越的BER性能。
Subjects: Information Theory (cs.IT) ; Signal Processing (eess.SP)
Cite as: arXiv:2510.02640 [cs.IT]
  (or arXiv:2510.02640v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.02640
arXiv-issued DOI via DataCite

Submission history

From: Yo-Seb Jeon [view email]
[v1] Fri, 3 Oct 2025 00:39:41 UTC (3,008 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
eess.SP
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
cs.IT
eess
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号