Matched Filtering-Based Channel Estimation for AFDM Systems in Doubly Selective Channels
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911451513356288 |
|---|---|
| author | Li, Xiangjun Liu, Zilong Zhou, Zhengchun Fan, Pingzhi |
| author_facet | Li, Xiangjun Liu, Zilong Zhou, Zhengchun Fan, Pingzhi |
| contents | Affine frequency division multiplexing (AFDM) has recently emerged as an excellent backward-compatible 6G waveform. In this paper, we study matched filtering (MF) assisted channel estimation (CE) for AFDM systems in complex doubly selective channels. By deriving the complete input-output relationship of the continuous-time signal, the inter-chirp-carrier interference, signal-to-interference-plus-noise ratio (SINR), and the effective SINR loss of AFDM, are investigated in discrete affine Fourier transform (DAFT) domain. Further, we propose two low-complexity methods for constructing the channel matrix by taking advantage of its inherent discrete Fourier transform structure and the staircase structure of the piecewise functions in the channel matrix, respectively. It is shown that complexity reduction by at least two orders of magnitude can be achieved for a large number of chirp subcarriers. For the CE problem in doubly selective channels, we introduce an MF assisted CE scheme. This allows us to sequentially estimate the parameters of each path by exploiting the separability and approximate orthogonality of different paths in the DAFT domain, thus leading to significantly reduced complexity. Furthermore, based on generalized Fibonacci search (GFS), an MF-GFS scheme is proposed to avoid significantly redundant computation, which can be extended to typical wide-band systems. Extensive simulation results indicate that the proposed schemes offer superior advantages in terms of their improved communication performance and lower complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_09268 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Matched Filtering-Based Channel Estimation for AFDM Systems in Doubly Selective Channels Li, Xiangjun Liu, Zilong Zhou, Zhengchun Fan, Pingzhi Signal Processing Affine frequency division multiplexing (AFDM) has recently emerged as an excellent backward-compatible 6G waveform. In this paper, we study matched filtering (MF) assisted channel estimation (CE) for AFDM systems in complex doubly selective channels. By deriving the complete input-output relationship of the continuous-time signal, the inter-chirp-carrier interference, signal-to-interference-plus-noise ratio (SINR), and the effective SINR loss of AFDM, are investigated in discrete affine Fourier transform (DAFT) domain. Further, we propose two low-complexity methods for constructing the channel matrix by taking advantage of its inherent discrete Fourier transform structure and the staircase structure of the piecewise functions in the channel matrix, respectively. It is shown that complexity reduction by at least two orders of magnitude can be achieved for a large number of chirp subcarriers. For the CE problem in doubly selective channels, we introduce an MF assisted CE scheme. This allows us to sequentially estimate the parameters of each path by exploiting the separability and approximate orthogonality of different paths in the DAFT domain, thus leading to significantly reduced complexity. Furthermore, based on generalized Fibonacci search (GFS), an MF-GFS scheme is proposed to avoid significantly redundant computation, which can be extended to typical wide-band systems. Extensive simulation results indicate that the proposed schemes offer superior advantages in terms of their improved communication performance and lower complexity. |
| title | Matched Filtering-Based Channel Estimation for AFDM Systems in Doubly Selective Channels |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2507.09268 |