اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLow-Complexity Linear Equalizers for OTFS Exploiting Two-Dimensional Fast Fourier Transform
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Orthogonal time frequency space (OTFS) modulation can effectively convert a doubly dispersive channel into an almost non-fading channel in the delay-Doppler domain. However, one critical issue for OTFS is the very high complexity of equalizers. In this letter, we first reveal the doubly block circulant feature of OTFS channel represented in the delay-Doppler domain. By exploiting this unique feature, we further propose zero-forcing (ZF) and minimum mean squared error (MMSE) equalizers that can be efficiently implemented with the two-dimensional fast Fourier transform. The complexity of our proposed equalizers is gracefully reduced from $mathcal{O}left(left(NMright)^{3}right)$ to $mathcal{O}left(NMmathrm{log_{2}}left(NMright)right)$, where $N$ and $M$ are the number of OTFS symbols and subcarriers, respectively. Analysis and simulation results show that compared with other existing linear equalizers for OTFS, our proposed linear equalizers enjoy a much lower computational complexity without any performance loss.
قيم البحث
اقرأ أيضاً
Wireless communications over fast fading channels are challenging, requiring either frequent channel tracking or complicated signaling schemes such as orthogonal time frequency space (OTFS) modulation. In this paper, we propose low-complexity frequen
cy domain equalizations to combat fast fading, based on novel discrete delay-time and frequency-Doppler channel models. Exploiting the circular stripe diagonal nature of the frequency-Doppler channel matrix, we introduce low-complexity frequency domain minimum mean square error (MMSE) equalization for OTFS systems with fully resolvable Doppler spreads. We also demonstrate that the proposed MMSE equalization is applicable to conventional orthogonal frequency division multiplexing (OFDM) and single carrier frequency domain equalization (SC-FDE) systems with short signal frames and partially resolvable Doppler spreads. After generalizing the input-output data symbol relationship, we analyze the equalization performance via channel matrix eigenvalue decomposition and derive a closed-form expression for the theoretical bit-error-rate. Simulation results for OTFS, OFDM, and SC-FDE modulations verify that the proposed low-complexity frequency domain equalization methods can effectively exploit the time diversity over fast fading channels. Even with partially resolvable Doppler spread, the conventional SC-FDE can achieve performance close to OTFS, especially in fast fading channels with a dominating line-of-sight path.
In this theoretical work, the DSP-perceived channel in optical coherent communications is first simplified, based on which we categorize linear MIMO equalizers into four classes according to their reference locations. The entire channel inverse can b
e represented by a complex conjugate-dependent system, coinciding with the widely linear equalization theory. Suboptimally removing FO dynamics, relatively static channel inverses parameterized with common device and channel parameters are presented for monitoring or calibration purposes.
We investigate a coded uplink non-orthogonal multiple access (NOMA) configuration in which groups of co-channel users are modulated in accordance with orthogonal time frequency space (OTFS). We take advantage of OTFS characteristics to achieve NOMA s
pectrum sharing in the delay-Doppler domain between stationary and mobile users. We develop an efficient iterative turbo receiver based on the principle of successive interference cancellation (SIC) to overcome the co-channel interference (CCI). We propose two turbo detector algorithms: orthogonal approximate message passing with linear minimum mean squared error (OAMP-LMMSE) and Gaussian approximate message passing with expectation propagation (GAMP-EP). The interactive OAMP-LMMSE detector and GAMP-EP detector are respectively assigned for the reception of the stationary and mobile users. We analyze the convergence performance of our proposed iterative SIC turbo receiver by utilizing a customized extrinsic information transfer (EXIT) chart and simplify the corresponding detector algorithms to further reduce receiver complexity. Our proposed iterative SIC turbo receiver demonstrates performance improvement over existing receivers and robustness against imperfect SIC process and channel state information uncertainty.
The recent emergence of orthogonal time frequency space (OTFS) modulation as a novel PHY-layer mechanism is more suitable in high-mobility wireless communication scenarios than traditional orthogonal frequency division multiplexing (OFDM). Although m
ultiple studies have analyzed OTFS performance using theoretical and ideal baseband pulseshapes, a challenging and open problem is the development of effective receivers for practical OTFS systems that must rely on non-ideal pulseshapes for transmission. This work focuses on the design of practical receivers for OTFS. We consider a fractionally spaced sampling (FSS) receiver in which the sampling rate is an integer multiple of the symbol rate. For rectangular pulses used in OTFS transmission, we derive a general channel input-output relationship of OTFS in delay-Doppler domain without the common reliance on impractical assumptions such as ideal bi-orthogonal pulses and on-the-grid delay/Doppler shifts. We propose two equalization algorithms: iterative combining message passing (ICMP) and turbo message passing (TMP) for symbol detection by exploiting delay-Doppler channel sparsity and the frequency diversity gain via FSS. We analyze the convergence performance of TMP receiver and propose simplified message passing (MP) receivers to further reduce complexity. Our FSS receivers demonstrate stronger performance than traditional receivers and robustness to the imperfect channel state information knowledge.
Intelligent reflecting surfaces (IRSs) are revolutionary enablers for next-generation wireless communication networks, with the ability to customize the radio propagation environment. To fully exploit the potential of IRS-assisted wireless systems, r
eflective elements have to be jointly optimized with conventional communication techniques. However, the resulting optimization problems pose significant algorithmic challenges, mainly due to the large-scale non-convex constraints induced by the passive hardware implementations. In this paper, we propose a low-complexity algorithmic framework incorporating alternating optimization and gradient-based methods for large-scale IRS-assisted wireless systems. The proposed algorithm provably converges to a stationary point of the optimization problem. Extensive simulation results demonstrate that the proposed framework provides significant speedups compared with existing algorithms, while achieving a comparable or better performance.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
