Interblock-interference-free precoding using square-root decomposition for faster-than-Nyquist signaling^✩

Abstract

Precodings using square-root decomposition, including Cholesky and G-To-Minus-Half (GTMH) precodings, are promising for eliminating the Faster-Than-Nyquist (FTN)-induced Intersymbol-Interference (ISI). However, the existing precodings using square-root decomposition either ignore Interblock-Interference (IBI) or increase the signal power, deteriorating the Bit Error Rate (BER) performance for high-order modulations and severe ISI. To overcome these drawbacks, we adopt two approaches for constructing the circular ISI matrix. The first approach inserts a Cyclic Prefix/Suffix (CPS) after each precoded symbol block, while the second approach replaces the linear convolution of the FTN shaping and the matched filter by the circular convolution, resulting in the Circular FTN (CFTN). Using these two approaches, we propose three IBI-free precodings, i.e., CPS-Cholesky, CFTN-Cholesky and CFTN-GTMH precodings. Furthermore, employing QR decomposition shows that the GTMH and Cholesky precodings can be converted interchangeably. Thus, we demonstrate that the GTMH precoding is essentially equivalent to the Cholesky precoding. Simulation results indicate that the BER performance of three IBI-free precodings approaches Nyquist performance for moderate ISI. However, as ISI intensifies, the CPS-Cholesky scheme increases the transmit power, causing BER performance degradation. In contrast, the CFTN-Cholesky and CFTN-GTMH precodings maintain optimal BER performance even for severe ISI. Considering 128-amplitude phase shift keying with a code rate of 1/2, the BER loss of CFTN-Cholesky and CFTN-GTMH precodings for the ideal BER of 10-5 is approximately 0.002 dB and 0.005 dB when packing factor is 0.7 and roll-off factor is 0.3. To the best knowledge of the authors, this is the optimal performance achievable through precoding.

Keywords

Faster-than-Nyquist / Intersymbol-interference / Interblock-interference / Bit error rate / Precoding

References

[1] R.W. Lucky, Decision feedback and faster-than-Nyquist transmission, in: Proc. IEEE Int. Symp. Inf. Theory, 1970, pp. 15-19.

[2] J.E. Mazo, Faster-than-Nyquist signaling, Bell Syst. Tech. J. 54 (8) (1975) 1451-1462.

[3] J. Mazo, H. Landau, On the minimum distance problem for faster-than-Nyquist sig- naling, IEEE Trans. Inf. Theory 34 (6) (1988) 1420-1427.

[4] D. Hajela, On computing the minimum distance for faster-than-Nyquist signaling, IEEE Trans. Inf. Theory 36 (2) (1990) 289-295.

[5] A. Liveris, C. Georghiades, Exploiting faster-than-Nyquist signaling, IEEE Trans. Inf. Theory 51 (9) (2003) 1502-1511.

[6] F. Rusek, J.B. Anderson, Constrained capacities for faster-than-Nyquist signaling, IEEE Trans. Inf. Theory 55 (2) (2009) 764-775.

[7] J. Yu, J. Park, F. Rusek, B. Kudryashov, I. Bocharova,High order modulation in faster-than-Nyquist signaling communication systems, in:Proceedings of the 2014 IEEE 80th Vehicular Technology Conference, VTC2014-Fall, Sep. 2014, pp. 1-5.

[8] M. Ganji, X. Zou, H. Jafarkhani, On the capacity of faster-than-Nyquist signaling, IEEE Commun. Lett. 24 (6) (2020) 1197-1201.

[9] F. Rusek, J.B. Anderson, The two dimensional Mazo limit, in: Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, IEEE, 2005, pp. 970-974.

[10] F. Rusek, J.B. Anderson, Multistream faster-than- Nyquist signaling, IEEE Trans. Commun. 57 (5) (2009) 1329-1340.

[11] Q. Li, F.-K. Gong, P.-Y. Song, G. Li, S.-H. Zhai, Joint channel estimation and pre- coding for faster-than-Nyquist signaling, IEEE Trans. Veh. Technol. 69 (11) (2020) 13139-13147.

[12] Y. Zhang, Y. Li, W. Xiang, J. Wang, S. Xiao, X. Li, W. Tang, The optimal precoded faster-than-Nyquist signaling for covert communications, IEEE Wirel. Commun. Lett. 26 (6) (2022) 1249-1253.

[13] Q. Li, L. Li, Y. Li, W. Han, X. Li, D.B. da Costa, Low-complexity SVD precoding for faster-than-Nyquist signaling using high-order modulations, IEEE Trans. Aerosp. Electron. Syst. 60 (1) (2024) 591-603.

[14] T. Ishihara, S. Sugiura, SVD-precoded faster-than-Nyquist signaling with optimal and truncated power allocation, IEEE Trans. Wirel. Commun. 18 (12) (2019) 5909-5923.

[15] S. Nie, M. Guo, Y. Shen,Precoding based on matrix decomposition for faster-than- Nyquist signaling, in:Proceedings of the IEEE 5th International Conference on Elec- tronics Information and Emergency Communication, 2015, pp. 194-197.

[16] G. Zhang, M. Guo, Y. Shen, Simulation of precoding algorithms based on matrix decomposition for faster-than-Nyquist signaling, in: Proceedings of the 25th Wireless and Optical Communication Conference, WOCC, 2016, pp. 1-5.

[17] P. Chaki, T. Ishihara, S. Sugiura, Eigendecomposition-precoded faster-than-Nyquist signaling with index modulation, IEEE Trans. Commun. 70 (7) (2022) 4822-4836.

[18] T. Ishihara, S. Sugiura, Eigendecomposition-precoded faster-than-Nyquist signaling with optimal power allocation in frequency-selective fading channels, IEEE Trans. Wirel. Commun. 21 (3) (2022) 1681-1693.

[19] J. Zhou, T. Ishihara, S. Sugiura, Precoded faster-than-Nyquist signaling for doubly selective underwater acoustic communication channel, IEEE Wirel. Commun. Lett. 11 (10) (2022) 2041-2045.

[20] Y. Li, S. Xiao, J. Wang, W. Tang, Cholesky-decomposition aided linear precoding and decoding for FTN signaling, IEEE Wirel. Commun. Lett. 10 (6) (2021) 1163-1167.

[21] H. Wang, A. Liu, X. Liang, S. Peng, K. Wang, Linear precoding for faster-than-Nyquist signaling, in: Proceedings of the 3rd IEEE International Conference on Computer and Communications, ICCC, 2017, pp. 52-56.

[22] Y. Zhang, J. Lei, W. Liu, An improved GTMH precoding algorithm in faster-than- Nyquist signaling system, in: Proceedings of the International Conference on Elec- tronics Technology, ICET, 2018, pp. 341-344.

[23] R. Tajan, C. Poulliat, M.-L. Boucheret, Circular faster-than-Nyquist: transmitter and iterative receiver design,in:Proceedings of the 2016 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC, IEEE, 2016, pp. 241-245.

[24] T. Petitpied, R. Tajan, P. Chevalier, S. Traverso, G. Ferré, Circular faster-than-Nyquist signaling for high spectral efficiencies: optimized EP-based receivers, IEEE Trans. Commun. 69 (8) (2021) 5487-5501.

[25] Q. Li, F.-K. Gong, P.-Y. Song, G. Li, S.-H. Zhai, Beyond DVB-S2X: faster-than-Nyquist signaling with linear precoding, IEEE Trans. Broadcast. 66 (3) (2020) 620-629.

[26] K. Ouahada, H.C. Ferreira, L. Cheng, Distance-optimality study for permutation codes using cyclic-shift prefix/suffix technique, in: AFRICON 2009, 2009, pp. 1-6.

[27] J. Fan, S. Guo, X. Zhou, Y. Ren, G.Y. Li, X. Chen, Faster-than-Nyquist signaling: an overview, IEEE Access 5 (2017) 1925-1940.

[28] X. Li, J. Zhao, G. Chen, W. Hao, D.B. Da Costa, A. Nallanathan, H. Shin, C. Yuen, Star- RIS assisted covert wireless communications with randomly distributed blockages, IEEE Trans. Wirel. Commun. 24 (6) (2025) 4690-4705.

[29] X. Li, J. Li, Y. Liu, Z. Ding, A. Nallanathan, Residual transceiver hardware impair- ments on cooperative noma networks, IEEE Trans. Wirel. Commun. 19 (1) (2020) 680-695.

[30] X. Li, Z. Tian, W. He, G. Chen, M.C. Gursoy, S. Mumtaz, A. Nallanathan, Covert communication of star-RIS aided NOMA networks, IEEE Trans. Veh. Technol. 73 (6) (2024) 9055-9060.

[31] R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge Univ. Press, 1985.

[32] G.H. Golub, C.F. Van Loan, Matrix Computations, Johns Hopkins Univ. Press, Balti- more, 1996.

[33] Y. Ma, N. Wu, J.A. Zhang, B. Li, L. Hanzo, Parametric bilinear iterative generalized approximate message passing reception of FTN multi-carrier signaling, IEEE Trans. Commun. 69 (12) (2021) 8443-8458.

[34] Y. Ma, N. Wu, J.A. Zhang, B. Li, L. Hanzo, Generalized approximate message passing equalization for multi-carrier faster-than-Nyquist signaling, IEEE Trans. Veh. Tech- nol. 71 (3) (2022) 3309-3314.