Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel
In this paper, we propose novel reduced-complexity fast Fourier transform (FFT)-spread multicarrier faster-than-Nyquist (MFTN) signaling with power allocation for a frequency-selective fading channel. The information rate of the proposed MFTN signaling is derived by relying on the circulant approxim...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Open Journal of the Communications Society |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9738814/ |
| _version_ | 1818349331099418624 |
|---|---|
| author | Takumi Ishihara Shinya Sugiura |
| author_facet | Takumi Ishihara Shinya Sugiura |
| author_sort | Takumi Ishihara |
| collection | DOAJ |
| description | In this paper, we propose novel reduced-complexity fast Fourier transform (FFT)-spread multicarrier faster-than-Nyquist (MFTN) signaling with power allocation for a frequency-selective fading channel. The information rate of the proposed MFTN signaling is derived by relying on the circulant approximation of the FTN-specific intersymbol interference matrix and noise covariance matrix. This allows us to constitute efficient calculations of precoding and weighting matrices. The power allocation coefficients are optimized such that the approximated information rate is maximized. Our simulation results demonstrate that the proposed scheme with power allocation achieves the bit error ratio (BER) performance close to the conventional eigenvalue-decomposition (EVD)-precoded FTN signaling counterpart that is optimal in terms of an achievable information rate while significantly reducing the computational complexity as low as the order of <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N\log N)$ </tex-math></inline-formula>. While the proposed scheme exhibits a high peak-to-average-power ratio similar to the conventional EVD-precoded counterpart due to the effects of FFT-based precoding, it achieves better BER performance than the conventional open-loop single-carrier FTN signaling scheme and the Nyquist signaling scheme, employing the same root-raised cosine shaping filter. It is also confirmed that the proposed MFTN signaling scheme does not suffer from any significant bandwidth broadening. |
| first_indexed | 2024-12-13T18:04:15Z |
| format | Article |
| id | doaj.art-6f1fb47d029c4864940a5965f77865ca |
| institution | Directory Open Access Journal |
| issn | 2644-125X |
| language | English |
| last_indexed | 2024-12-13T18:04:15Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of the Communications Society |
| spelling | doaj.art-6f1fb47d029c4864940a5965f77865ca2022-12-21T23:36:06ZengIEEEIEEE Open Journal of the Communications Society2644-125X2022-01-01353054210.1109/OJCOMS.2022.31607219738814Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading ChannelTakumi Ishihara0https://orcid.org/0000-0002-3335-285XShinya Sugiura1https://orcid.org/0000-0001-7736-8696Institute of Industrial Science, The University of Tokyo, Tokyo, JapanInstitute of Industrial Science, The University of Tokyo, Tokyo, JapanIn this paper, we propose novel reduced-complexity fast Fourier transform (FFT)-spread multicarrier faster-than-Nyquist (MFTN) signaling with power allocation for a frequency-selective fading channel. The information rate of the proposed MFTN signaling is derived by relying on the circulant approximation of the FTN-specific intersymbol interference matrix and noise covariance matrix. This allows us to constitute efficient calculations of precoding and weighting matrices. The power allocation coefficients are optimized such that the approximated information rate is maximized. Our simulation results demonstrate that the proposed scheme with power allocation achieves the bit error ratio (BER) performance close to the conventional eigenvalue-decomposition (EVD)-precoded FTN signaling counterpart that is optimal in terms of an achievable information rate while significantly reducing the computational complexity as low as the order of <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N\log N)$ </tex-math></inline-formula>. While the proposed scheme exhibits a high peak-to-average-power ratio similar to the conventional EVD-precoded counterpart due to the effects of FFT-based precoding, it achieves better BER performance than the conventional open-loop single-carrier FTN signaling scheme and the Nyquist signaling scheme, employing the same root-raised cosine shaping filter. It is also confirmed that the proposed MFTN signaling scheme does not suffer from any significant bandwidth broadening.https://ieeexplore.ieee.org/document/9738814/Cyclic prefixeigenvalue decompositionfaster-than-Nyquist signalingfast Fourier transformfrequency-selective channellow-complexity detection |
| spellingShingle | Takumi Ishihara Shinya Sugiura Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel IEEE Open Journal of the Communications Society Cyclic prefix eigenvalue decomposition faster-than-Nyquist signaling fast Fourier transform frequency-selective channel low-complexity detection |
| title | Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel |
| title_full | Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel |
| title_fullStr | Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel |
| title_full_unstemmed | Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel |
| title_short | Reduced-Complexity FFT-Spread Multicarrier Faster-Than-Nyquist Signaling in Frequency-Selective Fading Channel |
| title_sort | reduced complexity fft spread multicarrier faster than nyquist signaling in frequency selective fading channel |
| topic | Cyclic prefix eigenvalue decomposition faster-than-Nyquist signaling fast Fourier transform frequency-selective channel low-complexity detection |
| url | https://ieeexplore.ieee.org/document/9738814/ |
| work_keys_str_mv | AT takumiishihara reducedcomplexityfftspreadmulticarrierfasterthannyquistsignalinginfrequencyselectivefadingchannel AT shinyasugiura reducedcomplexityfftspreadmulticarrierfasterthannyquistsignalinginfrequencyselectivefadingchannel |