Spectrally Correlated Frequency Spreading Codes for FRESH Filtering-based Interference Cancellation

Frequency shift (FRESH) filters can achieve co-channel interference cancellation by exploiting spectral correlation statistics of both the desired and interfering signals. In orthogonal frequency division multiplexing (OFDM) signals, spectral correlation can be introduced in a structured way by symbol repetition across subcarriers. While this repetition generally requires duplicating symbols by an integer multiple of 2+ times (significantly impacting spectral efficiency), in this work it is shown that applying an incomplete spreading code, that trades spectral efficiency, to the desired signal can control its spectral correlation properties at redundancy factors less than 2. The distribution of the spectral correlation across frequencies determines the level of protection against interference at a given frequency. We introduce the design of frequency spreading codes that provide uniform spectral correlation distribution across frequencies, which provides equal interference cancellation capability independent of the center frequency of the interfering signal. The introduced spreading code can achieve arbitrary code rates while possessing two important properties: 1) semi-orthogonality and 2) spectral correlation uniformity. We evaluate the BER performance at very low signal-to-interference levels SIR$=0, 5 $ dB comparing spreading, LDPC, and LDPC+spreading at equal code rates.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24693
Primary Topic
Advanced Wireless Communication Techniques
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Spectrally Correlated Frequency Spreading Codes for FRESH Filtering-based Interference Cancellation

Daniel J. Jakubisin, Jeffrey H. Reed, Karim Said, Xinrui Li
arXiv (Cornell University)
Advanced Wireless Communication Techniques
preprint

Spectrally Correlated Frequency Spreading Codes for FRESH Filtering-based Interference Cancellation

Daniel J. Jakubisin, Jeffrey H. Reed, Karim Said, Xinrui Li
preprint en

Abstract

Frequency shift (FRESH) filters can achieve co-channel interference cancellation by exploiting spectral correlation statistics of both the desired and interfering signals. In orthogonal frequency division multiplexing (OFDM) signals, spectral correlation can be introduced in a structured way by symbol repetition across subcarriers. While this repetition generally requires duplicating symbols by an integer multiple of 2+ times (significantly impacting spectral efficiency), in this work it is shown that applying an incomplete spreading code, that trades spectral efficiency, to the desired signal can control its spectral correlation properties at redundancy factors less than 2. The distribution of the spectral correlation across frequencies determines the level of protection against interference at a given frequency. We introduce the design of frequency spreading codes that provide uniform spectral correlation distribution across frequencies, which provides equal interference cancellation capability independent of the center frequency of the interfering signal. The introduced spreading code can achieve arbitrary code rates while possessing two important properties: 1) semi-orthogonality and 2) spectral correlation uniformity. We evaluate the BER performance at very low signal-to-interference levels SIR$=0, 5 $ dB comparing spreading, LDPC, and LDPC+spreading at equal code rates.

arXiv (Cornell University)
Advanced Wireless Communication Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon