Affiliation:
1. FIRAT ÜNİVERSİTESİ, MÜHENDİSLİK FAKÜLTESİ, ELEKTRİK-ELEKTRONİK MÜHENDİSLİĞİ BÖLÜMÜ
Abstract
Modern receivers apply smooth demodulation and demapping processes to received symbols, using bit log-likelihood ratios (LLRs). Known as “LLRnet" demodulator architecture is offered that is a global educatable neural network attributed in this paper. The calculation of the optimal LLR algorithm includes the calculation of each bit in the LLR value and requires the assessment of whole lattice points as high dimensional which is unpractical for the QAM modulation. Known the most in the literature the Maximum Likelihood (ML) detector shows very high computational complexity that is used in the QAM scheme. Besides LLRnet developed achievement importantly, all calculational complexity is also reduced. Via estimating exact log-likelihood, how to create symbols, and channel corruptions for training a neural network LLRNet is shown in this paper. New and contemporary radio communication systems, such as 5G- NR (New Radio) and DVB (Digital Video Broadcasting) for satellite, DVB (S.2 Second Generation) utilize the LLR approach that calculates soft bit values with FEC (Forward Error Correction) algorithms and utilizes demodulated smooth bit values. This article aims a link-level simulation study to implement of LLRnet to DVB S2 and 5G-NR. The motivation of this study is seen that performing machine learning techniques on physical layer scheme, makes LLRNet a powerful example for practicability. This paper offers to compare Max-Log Approximate LLR, Exact LLR, and LLRNet methods for 16, 32 and 128 QAM.
Publisher
International Journal of Innovative Engineering Applications
Subject
Applied Mathematics,General Mathematics
Reference15 articles.
1. Erfanian, J., Pasupathy, S., & Gulak, G. (1994). Reduced complexity symbol detectors with parallel structure for ISI channels. IEEE Transactions on Communications, 42(234) 1661–1671.
2. Robertson, P., Villebrun, E., & Hoeher, P. (1995, June). A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain. Proceedings IEEE International Conference on Communications ICC 95, ( pp. 1009–1013).
3. Tosato, F., & Bisaglia, P. (2002, April). Simplified soft-output demapper for binary interleaved COFDM with application to HIPERLAN/2. IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), (vol. 2, pp. 664–668).
4. Wang, Q., Xie, Q., Wang, Z., Chen, S., & Hanzo, L. (2014). A universal low-complexity symbol-to-bit soft demapper. IEEE Transactions on Vehicular Technology, 63(1), 119–130.
5. Cybenko, G. (1989). Approximation by superpositions of a sigmoidal function. Mathematics of control, signals and systems, 2 (4), 303–314.