Search

This paper presents a pre-coding scheme for recently proposed differential spatial modulation (DSM) systems. It employs a lattice reduction (LR) aided pre-coding approach. An approximated upper bound on average bit error rate (BER) is semi-analytically derived. It is analytically shown that it can achieve a full diversity gain. That is, the performance analysis demonstrates that the LR-aided pre-coding DSM (LR-PDSM) systems with $ {N_T} $ N T transmit antennas and $ {N_R} $ N R receive antennas can achieve the maximum transmit diversity order of $ {N_T} $ N T . Meanwhile, it is well-known that the diversity order attained by the conventional zero-forcing (ZF) pre-coding is given as $ {N_T} - {N_R} + 1 $ N T − N R + 1. Simulation results verify the approximated theoretical analysis and show that LR-aided ZF pre-coding is capable of improving the BER performance of the conventional ZF pre-coding based DSM systems under the same spectral efficiency. [ABSTRACT FROM AUTHOR]

In this paper, a new receive antenna subset (RAS) selection scheme is proposed for precoding-aided spatial modulation (PSM). First, a lattice reduction (LR)-based precoder is employed instead of a conventional zero-forcing (ZF) precoder. It is analytically shown that a full diversity gain can be achieved by the LR-based ZF precoder without RAS selection. Then, an optimal LR-based RAS selection criterion is derived for the over-determined LR-based PSM systems, and a suboptimal selection algorithm is additionally presented. It is also shown that optimal and suboptimal RAS selection algorithms based on LR improve the BER performance of the LR-based PSM system. Further, the overall diversity order of the over-determined LR-based PSM systems with optimal LR-based RAS selection is analyzed. Finally, diversity analysis and simulation results show that the LR-ZF-based PSM system with optimal LR-based RAS selection outperforms the conventional ZF-based PSM system with conventional optimal RAS selection. [ABSTRACT FROM AUTHOR]

A multiple-signal-classification (MUSIC) approach of estimating the code timings of a desired user is considered for direct-sequence code-division multiple-access (DS-CDMA) multipath-fading channels when exploiting multiple receive antennas with either spatially uncorrelated or fully correlated fading. The acquisition performance of the conventional MUSIC timing estimator employing a single antenna is not good for the small size of observation windows and low signal-to-noise ratios (SNRs). Multiple antennas allow for rapid acquisition and lowers the range of detectable SNR. An efficient and improved MUSIC algorithm of estimating the multipath timings of a desired user for DS-CDMA systems is presented. In multipath-fading channels, the solution of the proposed algorithm is based on successively optimizing the cost function for increasing numbers of multipath delays, which does not require a multidimensional search for multidelay paths. Furthermore, the estimate of code timing at each path is obtained by finding the zeros of second-order polynomials, which is computationally efficient. The proposed MUSIC algorithm significantly improves the acquisition performance of conventional MUSIC algorithm in the presence of multipath time-varying Rayleigh-fading channels with arbitrary time delays. The acquisition performance of multiple antennas-based MUSIC timing estimators is much better than that of a single-antenna-based timing estimator. The Cramer-Rao bound for the code-timing estimator based on multiple antennas is presented. Index Terms--Code-division multiple access (CDMA), code-timing estimation, Cramer-Rao bound, multiantenna, multipath fading, synchronization.

This paper discusses the code-acquisition problem for preamble search in the code-division multiple-access (CDMA) uplink when multiple antennas are employed for signal reception. The multiple antennas are used either in the form of antenna array for beamforming or in the form of antenna diversity. The performance of a maximum-likelihood (ML) code-acquisition technique utilizing beamforming is analyzed by considering the detection, miss, and false-alarm probabilities. This analysis is based on the statistics of the CDMA noncoherent demodulator and beamformer output. In the case of a code-acquisition scheme utilizing antenna diversity, the probability density function of a decision variable is analytically derived for multiple antennas. The expressions for the probabilities of detection, miss, and false alarm are also presented. The acquisition performance and mean acquisition time for both code-acquisition techniques are numerically evaluated and compared. The code-acquisition approaches with multiple antennas are shown to provide much better performance than the corresponding scheme with a single antenna in a frequency-selective fading channel. Index Terms--Antenna array, code acquisition, code-division multiple access (CDMA).

Multiple‐input multiple‐output systems can achieve a full sum rate (SR) via full duplex (FD). However, its performance is degraded by self‐interference (SI) that occurs between the transmitter and receiver at the same node and thus is constrained by error floors. Conversely, half duplex (HD) can avoid the SI albeit at lower spectral efficiency, and the slope of its error curve is determined by the diversity order. In this study, a link selection scheme based on switching between FD and HD is examined as a simple method to improve the bit error rate (BER) performance of FD systems. In the proposed link selection algorithm, either FD or HD is selected based on the received minimum distance and signal‐to‐interference plus noise ratio. Simulation results indicate that the proposed hybrid FD/HD switching system offers significant BER performance improvement when compared with that of the conventional FD and FD based on only the received minimum distance under the same fixed SR. Under relatively sufficient SI cancellation, it is demonstrated to outperform the HD with a diversity advantage in low and medium signal‐to‐noise ratio region. [ABSTRACT FROM AUTHOR]

A power scaling (PS) scheme is examined in quadrature spatial modulation (QSM) systems with limited feedback. Here, a scaling factor is introduced for weighing the modulated symbols in the transmitter. The minimum Euclidean distance metric is exploited to select scaling factors for QSM systems. It is shown via simulation results that the proposed power scaling‐based quadrature spatial modulation systems provide better error performance than the conventional QSM with the limited feedback amount. Additionally, their error performance is compared with that of the PS‐assisted spatial modulation systems. © 2019 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

In this paper, a new transmit antenna selection algorithm for spatial multiplexing ultra-wideband multiple-input multiple-output systems is proposed. It utilizes the null space of the channel matrix spatially and temporally combined for available transmit antennas. A selection strategy is used to successively find and remove the transmit antennas having the largest contribution to the null space. Its error performance is shown to be close to that of the optimal antenna selection algorithm with low complexity. © 2017 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc. [ABSTRACT FROM AUTHOR]

We consider the problem of the efficient transmit antenna subset (TAS) selection for maximizing the signal-to-interference-plus-noise ratio (SINR) of multiuser space–time line code (MU–STLC) systems. The exhaustive search for optimal TAS selection is impractical since the total number of transmit antennas increases. We propose two efficient TAS selection schemes based on the Woodbury formula. The first is to incrementally select N S active transmit antennas among the available N T transmit antennas. To reduce the complexity of the incremental selection scheme, the Woodbury formula is employed in the optimization process. The second is to perform the decremental strategy in which the Woodbury formula is also applied to develop the low-complexity TAS selection procedure for the MU–STLC systems. Simulation results show that the proposed incremental and decremental TAS selection algorithms offer better alternatives than the existing greedy TAS selection algorithm for the MU–STLC systems. Furthermore, in terms of bit error rate, the proposed minimum mean square error decremental TAS selection algorithm turns out to outperform the existing greedy algorithm with significantly lower computational complexity. Finally, we analyze the detection SINR penalty experienced from TAS selection and the analytical quantity is shown to be well matched with simulation results. [ABSTRACT FROM AUTHOR]