An Ordered Successive Interference Cancellation Scheme in UWB MIMO Systems

In this letter, an ordered successive interference cancellation (OSIC) scheme is applied for multiple‐input multiple‐output (MIMO) detection in ultra‐wideband (UWB) communication systems. The error rate expression of an OSIC receiver on a log‐normal multipath fading channel is theoretically derived in a closed form solution. Its bit error rate performance is analytically compared with that of a zero forcing receiver in the UWB MIMO detection scheme followed by RAKE combining.     

Efficient Near‐Optimal Detection with Generalized Sphere Decoder for Blind MU‐MIMO Systems

In this letter, we propose an efficient near‐optimal detection scheme (that makes use of a generalized sphere decoder (GSD)) for blind multi‐user multiple‐input multiple‐output (MU‐MIMO) systems. In practical MU‐MIMO systems, a receiver suffers from interference because the precoding matrix, the result of the precoding technique used, is quantized with limited feedback and is thus imperfect. The proposed scheme can achieve near‐optimal performance with low complexity by using a GSD to detect several additional interference signals. In addition, the proposed scheme is suitable for use in blind systems.     

Graph‐based resource allocation algorithms for multiuser downlink MIMO‐OFDMA networks

Multiuser multiple‐input multiple‐output orthogonal frequency division multiple access (MIMO‐OFDMA) is considered as the practical method to attain the capacity promised by multiple antennas in the downlink direction. However, the joint calculation of precoding/beamforming and resource allocation required by the optimal algorithms is computationally prohibitive. This paper proposes computationally efficient resource allocation algorithms that can be invoked after the precoding and beamforming operations. To support stringent and diverse quality of service requirements, previous works have shown that the resource allocation algorithm must be able to guarantee a specific data rate to each user. The constraint matrix defined by the resource allocation problem with these data rate constraints provides a special structure that lends to efficient solution of the problem. On the basis of the standard graph theory and the Lagrangian relaxation, we develop an optimal resource allocation algorithm that exploits this structure to reduce the required execution time. Moreover, a lower‐complexity suboptimal algorithm is introduced. Extensive simulations are conducted to evaluate the computational and system‐level performance. It is shown that the proposed resource allocation algorithms attain the optimal solution at a much lower computational overhead compared with general‐purpose optimization algorithms used by previous MIMO‐OFDMA resource allocation approaches. Copyright © 2012 John Wiley & Sons, Ltd.     

Efficient LDPC‐Based,Threaded Layered Space‐Time‐Frequency System with Iterative Receiver

We present a low‐density parity‐check (LDPC)‐based, threaded layered space‐time‐frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean‐squared‐error iterative‐tree‐search (U‐MMSE‐ITS) detector, which is known to be one of the most efficient multi‐input multi‐output (MIMO) detectors available, is improved by augmentation of the partial‐length paths and by the addition of one‐bit complement sequences. Compared with the U‐MMSE‐ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low‐complexity belief‐propagation (BP) decoding algorithm for LDPC‐codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low‐complexity BP decoder, the proposed system is a promising solution to high‐data‐rate transmission over selective‐fading channels.     

Bandwidth‐Efficient Selective Retransmission for MIMO‐OFDM Systems

In this work, we propose an efficient selective retransmission method for multiple‐input and multiple‐output (MIMO) wireless systems under orthogonal frequency‐division multiplexing (OFDM) signaling. A typical received OFDM frame may have some symbols in error, which results in a retransmission of the entire frame. Such a retransmission is often unnecessary, and to avoid this, we propose a method to selectively retransmit symbols that correspond to poor‐quality subcarriers. We use the condition numbers of the subcarrier channel matrices of the MIMO‐OFDM system as a quality measure. The proposed scheme is embedded in the modulation layer and is independent of conventional hybrid automatic repeat request (HARQ) methods. The receiver integrates the original OFDM and the punctured retransmitted OFDM signals for more reliable detection. The targeted retransmission results in fewer negative acknowledgements from conventional HARQ algorithms, which results in increasing bandwidth and power efficiency. We investigate the efficacy of the proposed method for optimal and suboptimal receivers. The simulation results demonstrate the efficacy of the proposed method on throughput for MIMO‐OFDM systems.     

Low‐complexity turbo detection for single‐carrier low‐density parity‐check‐coded multiple‐input multiple‐output underwater acoustic communications

A low‐complexity turbo detection scheme is proposed for single‐carrier multiple‐input multiple‐output (MIMO) underwater acoustic (UWA) communications using low‐density parity‐check (LDPC) channel coding. The low complexity of the proposed detection algorithm is achieved in two aspects: first, the frequency‐domain equalization technique is adopted, and it maintains a low complexity irrespective of the highly dispersive UWA channels; second, the computation of the soft equalizer output, in the form of extrinsic log‐likelihood ratio, is performed with an approximating method, which further reduces the complexity. Moreover, attributed to the LDPC decoding, the turbo detection converges within only a few iterations. The proposed turbo detection scheme has been used for processing real‐world data collected in two different undersea trials: WHOI09 and ACOMM09. Experimental results show that it provides robust detection for MIMO UWA communications with different modulations and different symbol rates, at different transmission ranges. Copyright © 2011 John Wiley & Sons, Ltd.     

Low‐Power Channel‐Adaptive Reconfigurable 4×4 QRM‐MLD MIMO Detector

This paper presents a low‐complexity channel‐adaptive reconfigurable QR‐decomposition and M‐algorithm‐based maximum likelihood detection (QRM‐MLD) multiple‐input and multiple‐output (MIMO) detector. Two novel design approaches for low‐power QRM‐MLD hardware are proposed in this work. First, an approximate survivor metric (ASM) generation technique is presented to achieve considerable computational complexity reduction with minor BER degradation. A reconfigurable QRM‐MLD MIMO detector (where the M‐value represents the number of survival branches in a stage) for dynamically adapting to time‐varying channels is also proposed in this work. The proposed reconfigurable QRM‐MLD MIMO detector is implemented using a Samsung 65 nm CMOS process. The experimental results show that our ASM‐based QRM‐MLD MIMO detector shows a maximum throughput of 288 Mbps with a normalized power efficiency of 10.18 Mbps/mW in the case of MIMO with 64‐QAM. Under time‐varying channel conditions, the proposed reconfigurable MIMO detector also achieves average power savings of up to 35% while maintaining a required BER performance.     

User scheduling based on angles with block diagonalization in MU‐MIMO broadcast

This paper investigates user selection scheme in the multiuser multiple‐input multiple‐output (MU‐MIMO) broadcast (BC) scene with block diagonalization precoding. Block diagonalization is a suboptimal but practical linear precoding method, which can eliminate the multiuser interference by turning the MU‐MIMO BC channel into parallel MIMO channels. With this precoding method, we propose the best user from the user subset to maximize the total throughput in the MU‐MIMO BC system. The angles between subspaces used in this paper are induced from n ‐inner product, an extension from norm space to the n ‐dimensional space, which characterizes the orthogonality between subspaces. One of the algorithms achieves good performance by comparing the capacity greedily, the other one attains high capacity by reducing the cardinality of the user subset to improve the orthogonality between the user channels, which could be seen as a complexity reduction algorithm with respect to the former one. Indeed, they are all based on the angles between subspaces. Analysis shows that both of the proposed algorithms have lower complexity and better performance than the classical algorithms. The numerical results also confirm our analysis.     

Adaptive joint maximum‐likelihood detection and minimum‐mean‐square error with successive interference canceler over spatially correlated multiple‐input multiple‐output channels

We develop an efficient hard detector for multiple‐input multiple‐output (MIMO) channels, which adaptively combines maximum‐likelihood detection (MLD) and minimum‐mean‐square error with a successive interference canceler together. Unlike the conventional joint combination scheme, which may suffer from considerable degradation in bit‐error‐rate (BER) performance over correlated channels and where only one data stream is detected by MLD, our proposed scheme adaptively controls the number of data streams to be detected by MLD based on an analytical characterization of reliability for the detection. Simulation results illustrate that near‐optimal BER performance can be obtained at much lower computational complexity by the proposed method as compared with existing techniques, regardless of the spatial correlation of the MIMO channels. Copyright © 2012 John Wiley & Sons, Ltd.     

ICI problem and compensation in MIMO SC‐FDMA system with SC‐SFBC scheme

In this paper, we address the ICI (intercarrier interference) problem and compensation in MIMO (multiple input multiple output) SC‐FDMA (single carrier frequency division multiple access) system that exploits SC‐SFBC (single carrier‐space frequency block coding) scheme. Recently, SC‐FDMA technique has received more attention due to the low PAPR (peak to average power ratio) property. However, SC‐FDMA system is sensitive to phase noise and CFO (carrier frequency offset) which is unavoidable in wireless communication systems. Phase noise and CFO introduce CPE (common phase error) as well as ICI into the received signal and seriously degrade the system performance. Therefore, analysis and suppression of these interferences are of great importance. In this paper, we analyze the interferences in MIMO SC‐FDMA system with SC‐SFBC. Then a new ICI estimation and suppression method is proposed to suppress the interferences. Instead of directly estimating the CFO and phase noise, which is pretty difficult and complex, this algorithm exploits block‐type pilots, which is a common pilot pattern in wireless communication systems, such as LTE standard, to estimate the interferences. After that the interferences are suppressed by the inverse matrix method. Simulation results show that the system performance is significantly improved. Copyright © 2010 John Wiley & Sons, Ltd.     

A simple soft linear detection for coded multi‐input multi‐output systems

We propose a very simple and efficient soft linear multi‐input multi‐output (MIMO) detection scheme. The detection process is divided into two separate problems. The proposed scheme first detects MIMO symbols using conventional linear detection methods and produces soft bit information using a simple soft demapping method. Next, we refine the soft information by accounting for uneven post‐detection noise variance across MIMO layers. From the simulation result investigated in this paper, we first emphasize that powerful channel coding may suppress the differences of diversity gains among various MIMO detection schemes. This implies that the channel decoding operation may not be transparent to performance gain that resulted from MIMO detection process. The proposed scheme concentrates on accurate estimation of soft post‐MIMO detected information in a very simple manner, rather than concentrating on a complex MIMO detection scheme prior to decoding process. In combination with turbo codes, the proposed scheme produces comparable performance to maximum likelihood detection, even with the simplest scheme such as zero forcing detection, with drastically reduced complexity. Copyright © 2011 John Wiley & Sons, Ltd.     

A new subspace method for blind estimation of selective MIMO‐STBC channels

In this paper, a new technique for the blind estimation of frequency and/or time‐selective multiple‐input multiple‐output (MIMO) channels under space‐time block coding (STBC) transmissions is presented. The proposed method relies on a basis expansion model (BEM) of the MIMO channel, which reduces the number of parameters to be estimated, and includes many practical STBC‐based transmission scenarios, such as STBC‐orthogonal frequency division multiplexing (OFDM), space‐frequency block coding (SFBC), time‐reversal STBC, and time‐varying STBC encoded systems. Inspired by the unconstrained blind maximum likelihood (UML) decoder, the proposed criterion is a subspace method that efficiently exploits all the information provided by the STBC structure, as well as by the reduced‐rank representation of the MIMO channel. The method, which is independent of the specific signal constellation, is able to blindly recover the MIMO channel within a small number of available blocks at the receiver side. In fact, for some particular cases of interest such as orthogonal STBC‐OFDM schemes, the proposed technique blindly identifies the channel using just one data block. The complexity of the proposed approach reduces to the solution of a generalized eigenvalue (GEV) problem and its computational cost is linear in the number of sub‐channels. An identifiability analysis and some numerical examples illustrating the performance of the proposed algorithm are also provided. Copyright © 2009 John Wiley & Sons, Ltd.     

A new DOA estimation approach for QPSK Alamouti STBC using ICA technique‐based PSO algorithm

Alamouti space time block code (STBC) has been a revolutionary technology in multiple‐input multiple‐output (MIMO) wireless communication since it provides full transmission diversity. To reduce a multi‐path effect and a consumed power, the dynamic beam‐forming technique should be used to enable antennas focusing on a particular area. The aim of this paper is how to reduce the computational complexities of independent component analysis (ICA) and speed up the algorithm used in estimating the direction of arrival (DOA) angles. First, we derive a simple formula to reduce the number of unknown DOA to be one only. Then, real‐imaginary (Re‐Im) decomposition for MIMO system is used to reduce the computational complexities of ICA algorithm. The novel criteria used in this paper is that the kurtosis measuring for the extracted source will be minimum at one of the unknown values of DOA angles. Finally, particle swarm optimization (PSO) will be used as an effective tool to locate the DOA angle positions that minimize the kurtosis measuring. Performance analysis of the proposed approach with QPSK Alamouti STBC in MIMO channel was implemented using MATLAB. The validated criterions for the new approach were first examined. Then, root‐mean‐square‐error (RMSE) was employed to test the proposed approach at different SNR levels. The main parameters that influence on this approach were evaluated. It was found that superior performance could be obtained at ?DOA > 10⁰ when antenna spacing set to be λ/2 using at least 10³ snapshots. The important point observed during simulations was computational complexity (and latency) of the proposed approach was reduced to the minimum by employing Re‐Im decomposition model and PSO algorithm. Consequently, this approach is very efficient for hardware implementations.     

Reliability feedback–aided low‐complexity detection in uplink massive MIMO systems

Massive multiple‐input multiple‐output (MIMO) plays a crucial role in realizing the demand for higher data rates and improved quality of service for 5G and beyond communication systems. Reliable detection of transmitted information bits from all the users is one of the challenging tasks for practical implementation of massive‐MIMO systems. The conventional linear detectors such as zero forcing (ZF) and minimum mean square error (MMSE) achieve near‐optimal bit error rate (BER) performance. However, ZF and MMSE require large dimensional matrix inversion which induces high computational complexity for symbol detection in such systems. This motivates for devising alternate low‐complexity near‐optimal detection algorithms for uplink massive‐MIMO systems. In this work, we propose an ordered sequential detection algorithm that exploits the concept of reliability feedback for achieving near‐optimal performance in uplink massive‐MIMO systems. In the proposed algorithm, symbol corresponding to each user is detected in an ordered sequence by canceling the interference from all the other users, followed by reliability feedback‐based decision. Incorporation of the sequence ordering and the reliability feedback‐based decision enhances the interference cancellation, which reduces the error propagation in sequential detection, and thus, improves the BER performance. Simulation results show that the proposed algorithm significantly outperforms recently reported massive‐MIMO detection techniques in terms of BER performance. In addition, the computational complexity of the proposed algorithm is substantially lower than that of the existing algorithms for the same BER. This indicates that the proposed algorithm exhibits a desirable trade‐off between the complexity and the performance for massive‐MIMO systems.     

Compressed sensing channel estimation for STBC‐SM based hybrid MIMO‐OFDM system for visible light communication

This paper presents the idea of sparse channel estimation using compressed sensing (CS) method for space–time block coding (STBC), and spatially multiplexing (SM) derived hybrid multiple‐input multiple‐output (MIMO) Asymmetrically clipped optical‐orthogonal frequency division multiplexing (ACO‐OFDM) optical wireless communication system. This hybrid system accounts multiplexing gain of SM and diversity gain of STBC technique. We present a new variant of sparsity adaptive matching pursuit (SaMP) algorithm called dynamic step‐size SaMP (DSS‐SaMP) algorithm. It makes use of the inherent and implicit structure of SaMP, along with dynamic adaptivity of step‐size feature which is compatible with the energy of the input signal, thus the name dynamic step size. Existing CS‐based recovery algorithms like orthogonal matching pursuit, SaMP, adaptive step‐size SaMP, and proposed DSS‐SaMP were compared for hybrid MIMO‐ACO‐OFDM visible light communication system. The performance analysis is demonstrated through simulation results with respect to bit error rate, symbol error rate, mean square error, computational complexity, and peak‐to‐average power ratio. Simulation results show that the proposed technique gives improved performance and lesser computational complexity in comparison with conventional estimation algorithms.     

On the blind channel identifiability of multiple‐input multiple‐output space–time block code systems using Joint Approximate Diagonalization of Eigenmatrices

Channel identifiability for multiple‐input multiple‐output space–time block code (MIMO‐STBC) systems using Joint Approximate Diagonalization of Eigenmatrices (JADE) is studied in this paper. Compared with the previous blind MIMO‐STBC channel estimation methods in literature, the method proposed in this paper is more suitable for non‐cooperative scenario because it needs less prior information and can be applied to a general class of STBCs. The main contribution of the paper consists in the theoretical proof that, although the sources transmitted by different antennas of MIMO‐STBC systems are not independent, they can be retrieved from the received data by directly using JADE in most cases. The conclusion is also demonstrated by a simulation. This shows that the classical JADE algorithm can be applied to a wider range of situations rather than strictly independent sources. Copyright © 2013 John Wiley & Sons, Ltd.     

An Efficient Scheme to Achieve Differential Unitary Space‐Time Modulation on MIMO‐OFDM Systems

Differential unitary space‐time modulation (DUSTM) has emerged as a promising technique to obtain spatial diversity without intractable channel estimation. This paper presents a study of the application of DUSTM on multiple‐input multiple‐output orthogonal frequency division multiplexing (MIMO‐OFDM) systems with frequency‐selective fading channels. From the view of a correlation analysis between subcarriers of OFDM, we obtain the maximum achievable diversity of DUSTM on MIMO‐OFDM systems. Moreover, an efficient implementation strategy based on subcarrier reconstruction is proposed, which transmits all the signals of one signal matrix in one OFDM transmission and performs differential processing between two adjacent OFDM blocks. The proposed method is capable of obtaining both spatial and multipath diversity while reducing the effect of time variation of channels to a minimum. The performance improvement is confirmed by simulation results.     

Cross‐layer design for MIMO systems over spatially correlated and keyhole Nakagami‐m fading channels

Cross‐layer design is a generic designation for a set of efficient adaptive transmission schemes, across multiple layers of the protocol stack, that are aimed at enhancing the spectral efficiency and increasing the transmission reliability of wireless communication systems. In this paper, one such cross‐layer design scheme that combines physical layer adaptive modulation and coding (AMC) with link layer truncated automatic repeat request (T‐ARQ) is proposed for multiple‐input multiple‐output (MIMO) systems employing orthogonal space‐‐time block coding (OSTBC). The performance of the proposed cross‐layer design is evaluated in terms of achievable average spectral efficiency (ASE), average packet loss rate (PLR) and outage probability, for which analytical expressions are derived, considering transmission over two types of MIMO fading channels, namely, spatially correlated Nakagami‐m fading channels and keyhole Nakagami‐m fading channels. Furthermore, the effects of the maximum number of ARQ retransmissions, numbers of transmit and receive antennas, Nakagami fading parameter and spatial correlation parameters, are studied and discussed based on numerical results and comparisons. Copyright © 2009 John Wiley & Sons, Ltd.     

Soft‐output MMSE V‐BLAST receiver with MMSE channel estimation under correlated Rician fading MIMO channels

For wireless multiple‐input multiple‐output (MIMO) communications systems, both channel estimation error and spatial channel correlation should be considered when designing an effective signal detection system. In this paper, we propose a new soft‐output MMSE based Vertical Bell Laboratories Layered Space‐Time (V‐BLAST) receiver for spatially‐correlated Rician fading MIMO channels. In this novel receiver, not only the channel estimation errors and channel correlation but also the residual interference cancellation errors are taken into consideration in the computation of the MMSE filter and the log‐likelihood ratio (LLR) of each coded bit. More importantly, our proposed receiver generalizes all existing soft‐output MMSE V‐BLAST receivers, in the sense that, previously proposed soft‐output MMSE V‐BLAST receivers can be derived as the reduced forms of our receiver when the above three considered factors are partially or fully simplified. Simulation results show that the proposed soft‐output MMSE V‐BLAST receiver outperforms the existing receivers with a considerable gain in terms of bit‐error‐rate (BER) performance. Copyright © 2011 John Wiley & Sons, Ltd.     

System‐Level Performance of Limited Feedback Schemes for Massive MIMO

To implement high‐order multiuser multiple input and multiple output (MU‐MIMO) for massive MIMO systems, there must be a feedback scheme that can warrant its performance with a limited signaling overhead. The interference‐to‐noise ratio can be a basis for a novel form of Codebook (CB)‐based MU‐MIMO feedback scheme. The objective of this paper is to verify such a scheme's performance under a practical system configuration with a 3D channel model in various radio environments. We evaluate the performance of various CB‐based feedback schemes with different types of overhead reduction approaches, providing an experimental ground with which to optimize a CB‐based MU‐MIMO feedback scheme while identifying the design constraints for a massive MIMO system.