High-Rate and Low-Complexity Space-Time Block Codes for 2x2 MIMO Systems

The main design criteria for space-time block codes (STBCs) are the code rate, diversity order, coding gain, and low decoder complexity. In this letter, we propose a full-rate full-diversity STBC for 2 × 2 multiple-input multiple-output (MIMO) systems with a substantially lower maximum likelihood (ML) detection complexity than that of existing schemes. This makes the implementation of high-performance full-rate codes feasible for practical systems. Our numerical evaluation shows that the proposed code achieves significantly lower decoding complexity while maintaining a similar performance compared to that of existing rate-2 STBCs

I/Q imbalance mitigation for space-time block coded communication systems

Multiple-input multiple-output (MIMO) space-time block coded (STBC) wireless communication systems provide reliable data transmissions by exploiting the spatial diversity in fading channels. However, due to component imperfections, the in-phase/quadrature (I/Q) imbalance caused by the non-ideal matching between the relative amplitudes and phases of the I and Q branches always exists in the practical implementation of MIMO STBC communication systems. Such distortion results in a complex conjugate term of the intended signal in the time domain, hence a mirror-image term in the frequency domain, in the data structure. Consequently, I/Q imbalance increases the symbol error rate (SER) drastically in MIMO STBC or STBC MIMO orthogonal frequency division multiplexing (OFDM) communication systems, where both the signal and its complex conjugate are utilized for the information transmission, hence should be mitigated effectively. In this dissertation, the impact of I/Q imbalance in MIMO STBC systems over flat fading channels, the impact of I/Q imbalance in STBC MIMO-OFDM systems and in time- reversal STBC (TR-STBC) systems over frequency-selective fading channels are studied systematically. With regard to the MIMO STBC and the STBC MIMO-OFDM systems with I/Q imbalance, orthogonal space-time block codes (OSTBCs), quasi-orthogonal STBCs (QOSTBCs) and rotated QOSTBCs (RQOSTBCs) are studied, respectively. By exploiting the special structure of the received signal, low-complexity solutions are provided to mitigate the distortion induced by I/Q imbalance successfully. In addition, to mitigate I/Q imbalance while at the same time to exploit the multipath diversity for STBC OFDM systems over frequency-selective fading channels, a new encoding/decoing scheme for the grouped linear constellation precoded (GLCP) OFDM systems with I/Q imbalance is studied. In Chapter 1, the objectives of the research are elaborated. In Chapter 2, the various I/Q imbalance models are introduced, and the model used in this dissertation is established. In Chapter 3, the performance degradation caused by I/Q imbalance of the transceivers in MIMO STBC wireless communication systems over flat fading channels and the solutions are studied. A 2 Tx Alamouti system, a 4 Tx quasi-orthogonal STBC (QOSTBC) system, and a 4 Tx rotated QOSTBC (RQOSTBC) system with I/Q imbalance are studied in detail. By exploiting the special structure of the received signal, low-complexity solutions are proposed to mitigate I/Q imbalance successfully. Since STBCs are developed for frequency-flat fading channels, to achieve the spatial diversity in frequency-selective fading channels, MIMO-OFDM arrangements have been suggested, where STBCs are used across different antennas in conjunction with OFDM. In Chapter 4, the performance degradation caused by I/Q imbalance in STBC MIMO-OFDM wireless systems over frequency-selective fading channels and the solutions are studied. Similarly, a 2 Tx Alamouti system, a 4 Tx quasi-orthogonal STBC (QOSTBC) system, and a 4 Tx rotated QOSTBC (RQOSTBC) system with I/Q imbalance are studied in detail, and low-complexity solutions are proposed to mitigate the distortion effectively. However, OFDM systems suffer from the loss of the multipath diversity by converting frequency-selective fading channels into parallel frequency-flat fading subchannels. To exploit the multipath diversity and reduce the decoding complexity, GLCP OFDM systems with I/Q imbalance are studied. By judiciously assigning the mirror-subcarrier pair into one group, a new encoding/decoding scheme with a low-complexity is proposed to mitigate I/Q imbalance for GLCP OFDM systems in Chapter 5. Since OFDM communication systems have high peak-to-average power ratio (PAPR) problem and are sensitive to carrier frequency offset (CFO), to achieve both the spatial and multipath diversity, time-reversal STBC (TR-STBC) communication systems are introduced. In Chapter 6, the I/Q imbalance mitigating solutions in TR-STBC systems, both in the time domain and in the frequency domain, are studied

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-MIMO systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16x16 and 32x32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.Comment: v3: Performance/complexity comparison of the proposed scheme with other large-MIMO architectures/detectors has been added (Sec. IV-D). The paper has been accepted for publication in IEEE Journal of Selected Topics in Signal Processing (JSTSP): Spl. Iss. on Managing Complexity in Multiuser MIMO Systems. v2: Section V on Channel Estimation is update

New Full-Diversity Space-Time-Frequency Block Codes with Simplified Decoders for MIMO-OFDM Systems

Multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) is known as a promising solution for wideband wireless communications. This is why it has been considered as a powerful candidate for IEEE 802.11n standard. Numerous space-frequency block codes (SFBCs) and space-time- frequency block codes (STFBCs) have been proposed so far for implementing MIMO-OFDM systems. In this paper, at first we propose new full-diversity STFBCs with high coding gain in time-varying channels; the construct method for this structure is using orthogonal space-time block code for any arbitrary number of transmit antenna and then we propose a decoder with linear complexity for our proposed coding scheme. Simulation results verify that the proposed STFBCs outperform other recently published STFBCs

Full Diversity Space-Time Block Codes with Low-Complexity Partial Interference Cancellation Group Decoding

Partial interference cancellation (PIC) group decoding proposed by Guo and Xia is an attractive low-complexity alternative to the optimal processing for multiple-input multiple-output (MIMO) wireless communications. It can well deal with the tradeoff among rate, diversity and complexity of space-time block codes (STBC). In this paper, a systematic design of full-diversity STBC with low-complexity PIC group decoding is proposed. The proposed code design is featured as a group-orthogonal STBC by replacing every element of an Alamouti code matrix with an elementary matrix composed of multiple diagonal layers of coded symbols. With the PIC group decoding and a particular grouping scheme, the proposed STBC can achieve full diversity, a rate of $(2M)/(M+2)$ and a low-complexity decoding for $M$ transmit antennas. Simulation results show that the proposed codes can achieve the full diversity with PIC group decoding while requiring half decoding complexity of the existing codes.Comment: 10 pages, 3 figures

Generalized Silver Codes

For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an example of a full-rate, full-diversity STBC for 2 transmit antennas. Its ML-decoding complexity is of the order of $M^{2.5}$ for square $M$-QAM. The Silver code for 2 transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of $M^2$. Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for $n_r \geq n_t$) but have a high ML-decoding complexity of the order of $M^{n_tn_{min}}$ (for $n_r < n_t$, the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for $2^a$ transmit antennas and any $n_r$ with reduced ML-decoding complexity of the order of $M^{n_t(n_{min}-(3/4))-0.5}$, is presented. The codes constructed are also information lossless for $n_r \geq n_t$, like the Perfect codes and allow higher mutual information than the comparable punctured Perfect codes for $n_r < n_t$. These codes are referred to as the {\it generalized Silver codes}, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver-Golden codes for 2 transmit antennas. Simulation results of the symbol error rates for 4 and 8 transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.Comment: Accepted for publication in the IEEE Transactions on Information Theory. This revised version has 30 pages, 7 figures and Section III has been completely revise

High Rate/Low Complexity Space-Time Block Codes for 2x2 Reconfigurable MIMO Systems

In this paper, we propose a full-rate full-diversity space-time block code (STBC) for 2x2 reconfigurable multiple-input multiple-output (MIMO) systems that require a low complexity maximum likelihood (ML) detector. We consider a transmitter equipped with a linear antenna array where each antenna element can be independently configured to create a directive radiation pattern toward a selected direction. This property of transmit antennas allow us to increase the data rate of the system, while reducing the computational complexity of the receiver. The proposed STBC achieves a coding rate of two in a 2x2 MIMO system and can be decoded via an ML detector with a complexity of order M, where M is the cardinality of the transmitted symbol constellation. Our simulations demonstrate the efficiency of the proposed code compared to existing STBCs in the literature.Comment: arXiv admin note: text overlap with arXiv:1505.0646

Iterative decoding for MIMO channels via modified sphere decoding

In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiantenna systems employing space-time codes, however, it is not clear what is the best way to obtain the soft information required of the iterative scheme with low complexity. In this paper, we propose a modification of the Fincke-Pohst (sphere decoding) algorithm to estimate the maximum a posteriori probability of the received symbol sequence. The new algorithm solves a nonlinear integer least squares problem and, over a wide range of rates and signal-to-noise ratios, has polynomial-time complexity. Performance of the algorithm, combined with convolutional, turbo, and low-density parity check codes, is demonstrated on several multiantenna channels. The results for systems that employ space-time modulation schemes seem to indicate that the best performing schemes are those that support the highest mutual information between the transmitted and received signals, rather than the best diversity gain