Search

This work deals with turbo coded single user massive multiple input multiple output (SU-MMIMO) systems, with and without precoding. SU-MMIMO has a much higher spectral efficiency compared to multi-user massive MIMO (MU-MMIMO) since independent signals are transmitted from each of the antenna elements (spatial multiplexing). MU-MMIMO that uses beamforming has a much lower spectral efficiency, since the same signal (with a delay) is transmitted from each of the antenna elements. In this work, expressions for the upper bound on the average signal-to-noise ratio (SNR) per bit and spectral efficiency are derived for SU-MMIMO with and without precoding. We propose a performance index $f(N_t)$, which is a function of the number of transmit antennas $N_t$. Here $f(N_t)$ is the sum of the upper bound on the average SNR per bit and the spectral efficiency. We demonstrate that when the total number of antennas ($N_{\mathrm{tot}}$) in the transmitter and receiver is fixed, there exists a minimum value of $f(N_t)$, which has to be avoided. Computer simulations show that the bit-error-rate (BER) is nearly insensitive to a wide range of the number of transmit antennas and re-transmissions, when $N_{\mathrm{tot}}$ is large and kept constant. Thus, the spectral efficiency can be made as large as possible, for a given BER and $N_{\mathrm{tot}}$., Comment: 12 pages, 8 figures, journal. arXiv admin note: substantial text overlap with arXiv:2007.15959

Precoding is a method of compensating the channel at the transmitter. This work presents a novel method of data detection in turbo coded single user massive multiple input multiple output (MIMO) systems using precoding. We show via computer simulations that, when precoding is used, re-transmitting the data does not result in significant reduction in bit-error-rate (BER), thus increasing the spectral efficiency, compared to the case without precoding. Moreover, increasing the number of transmit and receive antennas results in improved BER., Comment: 6 pages, 4 figures, conference

Detecting the presence of a valid signal is an important task of a telecommunication receiver. When the receiver is unable to detect the presence of a valid signal, due to noise and fading, it is referred to as an erasure. This work deals with the probability of erasure computation for orthogonal frequency division multiplexed (OFDM) signals used by multiple input multiple output (MIMO) systems. The theoretical results are validated by computer simulations. OFDM is widely used in present day wireless communication systems due to its ability to mitigate intersymbol interference (ISI) caused by frequency selective fading channels. MIMO systems offer the advantage of spatial multiplexing, resulting in increased bit-rate, which is the main requirement of the recent wireless standards like 5G and beyond., Comment: 6 pages, 3 figures, journal

This paper analyses the performance of filter bank multicarrier (FBMC) signaling in conjunction with offset quadrature amplitude modulation (OQAM) in multi-user (MU) massive multiple-input multiple-output (MIMO) systems. Initially, closed form expressions are derived for tight lower bounds corresponding to the achievable uplink sum-rates for FBMC-based single-cell MU massive MIMO systems relying on maximum ratio combining (MRC), zero forcing (ZF) and minimum mean square error (MMSE) receiver processing with/without perfect channel state information (CSI) at the base station (BS). This is achieved by exploiting the statistical properties of the intrinsic interference that is characteristic of FBMC systems. Analytical results are also developed for power scaling in the uplink of MU massive MIMO-FBMC systems. The above analysis of the achievable sum-rates and corresponding power scaling laws is subsequently extended to multi-cell scenarios considering both perfect as well as imperfect CSI, and the effect of pilot contamination. The delay-spread-induced performance erosion imposed on the linear processing aided BS receiver is numerically quantified by simulations. Numerical results are presented to demonstrate the close match between our analysis and simulations, and to illustrate and compare the performance of FBMC and traditional orthogonal frequency division multiplexing (OFDM)-based MU massive MIMO systems.

Single user massive multiple input multiple output (MIMO) can be used to increase the spectral efficiency, since the data is transmitted simultaneously from a large number of antennas located at both the base station and mobile. It is feasible to have a large number of antennas in the mobile, in the millimeter wave frequencies. However, the major drawback of single user massive MIMO is the high complexity of data recovery at the receiver. In this work, we propose a low complexity method of data detection with the help of re-transmissions. A turbo code is used to improve the bit-error-rate (BER). Simulation results indicate significant improvement in BER with just two re-transmissions as compared to the single transmission case. We also show that the minimum average SNR per bit required for error free propagation over a massive MIMO channel with re-transmissions is identical to that of the additive white Gaussian noise (AWGN) channel, which is equal to $-1.6$ dB., Comment: 13 pages, 4 figures, 1 table

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB. Discrete-time algorithms are presented for timing and carrier synchronization, as well as channel estimation, for turbo coded multiple input multiple output (MIMO) orthogonal frequency division multiplexed (OFDM) systems. Simulation results show that it is possible to achieve a bit error rate of $10^{-5}$ at an average SNR per bit of 5.5 dB, using two transmit and two receive antennas. We then propose a near-capacity signaling method in which each transmit antenna uses a different carrier frequency. Using the near-capacity approach, we show that it is possible to achieve a BER of $2\times 10^{-5}$ at an average SNR per bit of just 2.5 dB, with one receive antenna for each transmit antenna. When the number of receive antennas for each transmit antenna is increased to 128, then a BER of $2\times 10^{-5}$ is attained at an average SNR per bit of 1.25 dB. In all cases, the number of transmit antennas is two and the spectral efficiency is 1 bit/transmission or 1 bit/sec/Hz. In other words, each transmit antenna sends 0.5 bit/transmission. It is possible to obtain higher spectral efficiency by increasing the number of transmit antennas, with no loss in BER performance, as long as each transmit antenna uses a different carrier frequency. The transmitted signal spectrum for the near-capacity approach can be restricted by pulse-shaping. In all the simulations, a four-state turbo code is used. The corresponding turbo decoder uses eight iterations. The algorithms can be implemented on programmable hardware and there is a large scope for parallel processing., Comment: 16 pages, 12 figures, 5 tables, journal

Data detection of convolutional coded differential quaternary phase shift keyed (DQPSK) signals using a predictive Viterbi algorithm (VA) based receiver, is presented for single input, multiple output - orthogonal frequency division multiplexed (OFDM) systems. The receiver has both error correcting capability and also the ability to perform channel estimation (prediction). The predictive VA operates on a supertrellis with just $S_{\mathrm{ST}}=S_{\mathrm{E}}\times 2^{P-1}$ states instead of $S_{\mathrm{ST}}=S_{\mathrm{E}}\times 2^{P}$ states, where the complexity reduction is achieved by using the concept of isometry (here $S_{\mathrm{E}}$ denotes the number of states in the encoder trellis and $P$ denotes the prediction order). Though the linear prediction based data detection in turbo coded OFDM and the bit interleaved coded (BIC) OFDM systems perform better than the proposed approach in terms of bit error rate (BER) for a given signal to noise ratio (SNR), the decoding delay of the proposed approach is significantly lower than that of the BIC and the turbo coded OFDM systems., Comment: The Viterbi algorithm is used to detect convolutionally coded DQPSK in SIMO-OFDM, Wireless Personal Communications, Springer. Online first, 2017

We consider two-way amplify and forward relaying, where multiple full-duplex user pairs exchange information via a shared full-duplex massive multiple-input multiple-output (MIMO) relay. We derive closed-form lower bound for the spectral efficiency with zero-forcing processing at the relay, by using minimum mean squared error channel estimation. The zero-forcing lower bound for the system model considered herein, which is valid for arbitrary number of antennas, is not yet derived in the massive MIMO relaying literature. We numerically demonstrate the accuracy of the derived lower bound and the performance improvement achieved using zero-forcing processing. We also numerically demonstrate the spectral gains achieved by a full-duplex system over a half-duplex one for various antenna regimes., Comment: Conference paper, 6 pages

We consider two-way amplify and forward relaying, where multiple full-duplex user pairs exchange information via a shared full-duplex massive multiple-input multiple-output (MIMO) relay. Most of the previous massive MIMO relaying works maximize the spectral efficiency (SE). By contrast, we maximize the non-convex energy efficiency (EE) metric by approximating it as a pseudo-concave problem, which is then solved using the classic Dinkelbach approach. We also maximize the EE of the least energy-efficient user {relying} on the max-min approach. For solving these optimization problems, we derive closed-form lower bounds for the ergodic achievable rate both for maximal-ratio combining and zero-forcing processing at the relay, by using minimum mean squared error channel estimation. We numerically characterize the accuracy of the lower bounds derived. We also compare the SE and EE of the proposed design to those of the existing full-duplex systems and quantify the significant improvement achieved by the proposed algorithm. We also compare the EE of the proposed full-duplex system to that of its half-duplex counterparts, and characterize the self-loop and inter-user interference regimes, for which the proposed full-duplex system succeeds in outperforming the half-duplex ones., Comment: 30 pages, Updated paper

In this work, we discuss techniques for coherently detecting turbo coded orthogonal frequency division multiplexed (OFDM) signals, transmitted through frequency selective Rayleigh (the magnitude of each channel tap is Rayleigh distributed) fading channels having a uniform power delay profile. The channel output is further distorted by a carrier frequency and phase offset, besides additive white Gaussian noise (AWGN). A new frame structure for OFDM, consisting of a known preamble, cyclic prefix, data and known postamble is proposed, which has a higher throughput compared to the earlier work. A robust turbo decoder is proposed, which functions effectively over a wide range of signal-to-noise ratio (SNR). The key contribution to the good performance of the practical coherent receiver is due to the use of a long preamble (512 QPSK symbols), which is perhaps not specified in any of the current wireless communication standards. We have also shown from computer simulations that, it is possible to obtain even better BER performance, using a better code. A simple and approximate Cramer-Rao bound on the variance of the frequency offset estimation error for coherent detection, is derived. The proposed algorithms are well suited for implementation on a DSP-platform., Comment: 15 pages, 16 figures, 3 tables

The key contribution of this work is to develop transmitter and receiver algorithms in discrete-time for turbo- coded offset QPSK signals. The proposed synchronization and detection techniques perform effectively at an SNR per bit close to 1.5 dB, in the presence of a frequency offset as large as 30 % of the symbol-rate and a clock offset of 25 ppm (parts per million). Due to the use of up-sampling and matched filtering and a feedforward approach, the acquisition time for clock recovery is just equal to the length of the preamble. The carrier recovery algorithm does not exhibit any phase ambiguity, alleviating the need for differentially encoding the data at the transmitter. The proposed techniques are well suited for discrete-time implementation., Comment: 29 pages, 14 figures, 7 tables