15 September 2021 in IEEE Transactions on Wireless Communications
We propose a superimposed pilot (SP)-based channel estimation and data detection framework for orthogonal time-frequency space (OTFS) systems, which superimposes low-powered pilots on to data symbols in the delay-Doppler domain. We propose two channel estimation and data detection designs for SP-OTFS systems which, unlike the existing OTFS designs, do not designate any slots for pilots, and consequently have higher spectral efficiency (SE). The first SP design estimates channel by treating data as interference, which degrades its performance at high signal to noise ratio. The second SP design alleviates this problem by iterating between channel estimation and data detection. Both these designs detect data using message passing algorithm which exploits OTFS channel sparsity, and consequently has low computational complexity. We also derive a lower bound on the signal-to-interference-plus-noise ratio of the proposed designs and maximize it by optimally allocating power between data and pilot symbols. We numerically validate the derived analytical results, and show that the proposed designs have superior SE than the existing OTFS channel estimation and data detection designs.
31 January 2022 in IEEE Open Journal of the Communications Society
Orthogonal time-frequency space (OTFS) scheme, which transforms a time and frequency selective channel into an almost non-selective channel in the delay-Doppler domain, establishes reliable wireless communication for high-speed moving devices. This work designs and analyzes low-complexity zero-forcing (LZ) and minimum mean square error (LM) receivers for multiple-input multiple-output (MIMO)-OTFS systems with perfect and imperfect receive channel state information (CSI). The proposed receivers provide exactly the same solution as that of their conventional counterparts, and reduce the complexity by exploiting the doubly-circulant nature of the MIMO-OTFS channel matrix, the block-wise inverse, and Schur complement. We also derive, by exploiting the Taylor expansion and results from random matrix theory, a tight approximation of the post-processing signal-to-noise-plus-interference-ratio (SINR) expressions in closed-form for both LZ and LM receivers. We show that the derived SINR expressions, when averaged over multiple channel realizations, accurately characterize their respective bit error rate (BER) with both perfect and imperfect receive CSI. We numerically show the lower BER and lower complexity of the proposed designs over state-of-the-art exiting solutions.
29 October 2019 in IEEE Transactions on Communications
1 February 2022 in IEEE Transactions on Communications
We derive closed form bit error rate (BER) expression for orthogonal time frequency space (OTFS) zero-forcing (ZF) receiver with perfect and imperfect receive channel information. Depending on the delay-Doppler locations of the propagation paths of the OTFS channel H, the expression $\mathrm {H}^{H}\mathrm {H}$ is shown to have either distinct or repetitive eigenvalues. When $\mathrm {H}^{H}\mathrm {H}$ has two or less distinct eigenvalues and the remaining ones are repetitive, we derive the probability distribution function (pdf) of the signal-to-noise-plus-interference-ratio (SINR) of the ZF receiver. A closed form BER expression is then derived by averaging the conditional BER over the SINR pdf. When $\mathrm {H}^{H}\mathrm {H}$ has $n$ distinct eigenvalues, we use numerical integration to derive a generalized expression for the SINR pdf. We show that this pdf can be tightly approximated by the Gamma pdf, and then use it to derive the BER expression. The derived OTFS ZF BER expression therefore, unlike the existing ones in the literature, does not require averaging over multiple channel realizations. We show, for different modulation schemes and OTFS system parameters, that the BER calculated using the derived expressions closely matches the one calculated numerically.
27 June 2023 in IEEE Communications Letters
Since a typical intelligent reflecting surface (IRS) comprises a large number of passive reflecting elements, it is crucial to update the reflection coefficients using a fast optimization algorithm. In this letter, we propose a Gradient Ascent (GA) based IRS coefficient optimization algorithm, to obtain the optimal IRS phase shifts that maximizes the achievable rate of IRS-Orthogonal frequency division multiplexing (OFDM) systems. We first transform the conventional complex phase optimization problem into a real-valued maximization problem with box constraints containing real variables. This transformation enables optimization through low-complexity real valued operations. We demonstrate the efficacy of the proposed GA method over the state-of-the-art solutions in terms of convergence speed, computational complexity and achievable rate through numerical simulations.
16 February 2023 in Journal of Signal Processing Systems