Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.15935 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914345180463104 |
|---|---|
| author | Kanazawa, Yuta Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki |
| author_facet | Kanazawa, Yuta Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki |
| contents | Orthogonal time frequency space (OTFS) modulation is a promising solution to handle doubly-selective fading, but its channel estimation is a nontrivial task in terms of maximizing spectral efficiency. Conventional pilot assignment approaches face challenges: the standard embedded pilot-based scheme suffers from low transmission rates, and the single superimposed pilot (SP)-based scheme experiences inevitable data-pilot interference, leading to coarse channel estimation. To cope with this issue, focusing on the SP-based OTFS system in channel coded scenarios, we propose a novel pilot assignment scheme and an iterative algorithm. The proposed scheme allocates multiple SPs per frame to estimate channel coefficients accurately. Furthermore, the proposed algorithm performs refined interference cancellation, utilizing a replica of data symbols generated from soft-decision outputs provided by a decoder. Assuming fair and unified conditions, we evaluate each pilot assignment scheme in terms of reliability, channel estimation accuracy, effective throughput, and computational complexity. Our numerical simulations demonstrate that the multiple SP-based scheme, which balances the transmission rate and the interference cancellation performance, has the best throughput at the expense of slightly increased complexity. In addition, we confirm that the multiple SP-based scheme achieves further improved throughput due to the proposed interference cancellation algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15935 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Superimposed Pilot-Based OTFS: Will It Work? Kanazawa, Yuta Iimori, Hiroki Pradhan, Chandan Malomsoky, Szabolcs Ishikawa, Naoki Signal Processing Orthogonal time frequency space (OTFS) modulation is a promising solution to handle doubly-selective fading, but its channel estimation is a nontrivial task in terms of maximizing spectral efficiency. Conventional pilot assignment approaches face challenges: the standard embedded pilot-based scheme suffers from low transmission rates, and the single superimposed pilot (SP)-based scheme experiences inevitable data-pilot interference, leading to coarse channel estimation. To cope with this issue, focusing on the SP-based OTFS system in channel coded scenarios, we propose a novel pilot assignment scheme and an iterative algorithm. The proposed scheme allocates multiple SPs per frame to estimate channel coefficients accurately. Furthermore, the proposed algorithm performs refined interference cancellation, utilizing a replica of data symbols generated from soft-decision outputs provided by a decoder. Assuming fair and unified conditions, we evaluate each pilot assignment scheme in terms of reliability, channel estimation accuracy, effective throughput, and computational complexity. Our numerical simulations demonstrate that the multiple SP-based scheme, which balances the transmission rate and the interference cancellation performance, has the best throughput at the expense of slightly increased complexity. In addition, we confirm that the multiple SP-based scheme achieves further improved throughput due to the proposed interference cancellation algorithm. |
| title | Superimposed Pilot-Based OTFS: Will It Work? |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2501.15935 |