Frame Partitioning and Interleaving-Based Low PAPR OTFS

In this letter, we propose a simple and efficient low peak-to-average power ratio (PAPR) orthogonal time frequency space (OTFS) scheme, named low PAPR (LP)-OTFS, which does not require side information or signal pre-distortion. The proposed method involves a two-step process. First, the M×N delay-Doppler (DD) domain data frame is partitioned into S sub-blocks along the Doppler axis. Each sub-block is then transformed into the delay-time (DT) domain using a reduced size, i.e., an L(=N/S)-point inverse discrete Fourier transform (IDFT) along the Doppler axis. Next, by performing signal interleaving between sub-blocks, we compensate for the reduced time-domain diversity caused by the smaller sub-block size. Through simulations, we compare the proposed LP-OTFS scheme with both the conventional OTFS and the recently proposed discrete Fourier transform spread OTFS (DFT-s-OTFS) in terms of PAPR and bit error rate (BER). The results demonstrate that the proposed scheme achieves improved BER performance and reduced PAPR. Additionally, a complexity comparison with OTFS and DFT-s-OTFS shows that our proposed method has the lowest complexity.

Authors

Institutions

Publication Details

Journal
IEEE Wireless Communications Letters
Published
2025-06-02
DOI
https://doi.org/10.1109/lwc.2025.3575741
Citations
2
Primary Topic
PAPR reduction in OFDM
Type
article
Field-Weighted Citation Impact
1.46
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Frame Partitioning and Interleaving-Based Low PAPR OTFS

C. G. Kim, Hyeongwon Lee, Kwonhue Choi, Kwanwoong Ryu
2 citations
IEEE Wireless Communications Letters
PAPR reduction in OFDM
1.46
article

Frame Partitioning and Interleaving-Based Low PAPR OTFS

C. G. Kim, Hyeongwon Lee, Kwonhue Choi, Kwanwoong Ryu
article en
2 citations

Abstract

In this letter, we propose a simple and efficient low peak-to-average power ratio (PAPR) orthogonal time frequency space (OTFS) scheme, named low PAPR (LP)-OTFS, which does not require side information or signal pre-distortion. The proposed method involves a two-step process. First, the M×N delay-Doppler (DD) domain data frame is partitioned into S sub-blocks along the Doppler axis. Each sub-block is then transformed into the delay-time (DT) domain using a reduced size, i.e., an L(=N/S)-point inverse discrete Fourier transform (IDFT) along the Doppler axis. Next, by performing signal interleaving between sub-blocks, we compensate for the reduced time-domain diversity caused by the smaller sub-block size. Through simulations, we compare the proposed LP-OTFS scheme with both the conventional OTFS and the recently proposed discrete Fourier transform spread OTFS (DFT-s-OTFS) in terms of PAPR and bit error rate (BER). The results demonstrate that the proposed scheme achieves improved BER performance and reduced PAPR. Additionally, a complexity comparison with OTFS and DFT-s-OTFS shows that our proposed method has the lowest complexity.

IEEE Wireless Communications LettersVol. 14(8)
Electronics and Telecommunications Research Institute (KR), Yeungnam University (KR)
Affordable and clean energy
Openalex Percentile: Top 17%
PAPR reduction in OFDM
1.46
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.

Frame Partitioning and Interleaving-Based Low PAPR OTFS — C. G. Kim, Hyeongwon Lee, et al. · IEEE Wireless Communications Letters (2025) | TGRS Research Map | TGRS