BER Analysis of Uplink OFDMA in the Presence of Carrier Frequency and Timing Offsets on Rician Fading Channels

In orthogonal frequency-division multiple access (OFDMA) on the uplink, the carrier frequency offsets (CFOs) and/or timing offsets (TOs) of other users with respect to a desired user can cause multiuser interference (MUI). Analytically evaluating the effect of these CFO/TO-induced MUI on the bit error rate (BER) performance is of interest. In this paper, we analyze the BER performance of uplink OFDMA in the presence of CFOs and TOs on Rician fading channels. A multicluster multipath channel model that is typical in indoor/ultrawideband and underwater acoustic channels is considered. Analytical BER expressions that quantify the degradation in BER due to the combined effect of both CFOs and TOs in uplink OFDMA with M-state quadrature amplitude modulation (QAM) are derived. Analytical and simulation BER results are shown to match very well. The derived BER expressions are shown to accurately quantify the performance degradation due to nonzero CFOs and TOs, which can serve as a useful tool in OFDMA system design.

Spatial Modulation and Space Shift Keying in Single Carrier Communication

Spatial modulation (SM) and space shift keying (SSK) are relatively new modulation techniques which are attractive in multi-antenna communications. Single carrier (SC) systems can avoid the peak-to-average power ratio (PAPR) problem encountered in multicarrier systems. In this paper, we study SM and SSK signaling in cyclic-prefixed SC (CPSC) systems on MIMO-ISI channels. We present a diversity analysis of MIMO-CPSC systems under SSK and SM signaling. Our analysis shows that the diversity order achieved by (n(t), n(r)) SSK scheme and (n(t), n(r), Theta(M)) SM scheme in MIMO-CPSC systems under maximum-likelihood (ML) detection is n(r), where n(t), n(r) denote the number of transmit and receive antennas and Theta(M) denotes the modulation alphabet of size M. Bit error rate (BER) simulation results validate this predicted diversity order. Simulation results also show that MIMO-CPSC with SM and SSK achieves much better performance than MIMO-OFDM with SM and SSK.

Increasing System Capacity in Uplink Multiuser MIMO Using Sparsity Exploiting Receiver

In multiuser communication on the uplink, all subscribed users may not be active simultaneously. This leads to sparsity in the activity pattern in the users' transmissions, which can be exploited in the multiuser MIMO receiver at the base station (BS). Because of no transmissions from inactive users, joint detection at the BS has to consider an augmented signal set that includes zero. In this paper, we propose a receiver that exploits this inactivity-induced sparsity and considers the zero-augmented signal set. The proposed receiver is based on Markov Chain Monte Carlo techniques. Near-optimal performance and increased system capacity (in terms of number of users in the system) are demonstrated. For example, a multiuser MIMO system with N = 32 receive antennas at the BS and an user activity factor of 0.2 supports 51 uplink users meeting a QoS of 10(-3) coded bit error rate.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

SC-FDMA for multiuser communication on the downlink

Single-carrier frequency division multiple access (SC-FDMA) has become a popular alternative to orthogonal frequency division multiple access (OFDMA) in multiuser communication on the uplink. This is mainly due to the low peak-to-average power ratio (PAPR) of SC-FDMA compared to that of OFDMA. Long-term evolution (LTE) uses SC-FDMA on the uplink to exploit this PAPR advantage to reduce transmit power amplifier backoff in user terminals. In this paper, we show that SC-FDMA can be beneficially used for multiuser communication on the downlink as well. We present SC-FDMA transmit and receive signaling architectures for multiuser communication on the downlink. The benefits of using SC-FDMA on the downlink are that SC-FDMA can achieve i) significantly better bit error rate (BER) performance at the user terminal compared to OFDMA, and ii) improved PAPR compared to OFDMA which reduces base station (BS) power amplifier backoff (making BSs more green). SC-FDMA receiver needs to do joint equalization, which can be carried out using low complexity equalization techniques. For this, we present a local neighborhood search based equalization algorithm for SC-FDMA. This algorithm is very attractive both in complexity as well as performance. We present simulation results that establish the PAPR and BER performance advantage of SC-FDMA over OFDMA in multiuser SISO/MIMO downlink as well as in large-scale multiuser MISO downlink with tens to hundreds of antennas at the BS.

Asynchronous Measurement of Transient Phase-Shift Resulting From RF Receiver State-Change

In a wireless receiver, a down-converted RF signal undergoes a transient phase shift, when the gain state is changed to adjust for varying conditions in transmission and propagation. A method is developed, in which such phase shifts are detected asynchronously, and their undesirable effects on the bit error rate are corrected. The method was developed for and used in, the system-level characterization and calibration of a 65-nm CMOS UHF receiver. The phase-shifts associated with specific gain-state transitions were measured within a test framework, and used in the baseband signal processing blocks to compensate for errors, whenever the receiver anticipated a gain-state transition.

Cooperative Particle Swarm Optimization Based Receiver for Large-Dimension MIMO-ZPSC Systems

In this paper, we propose a cooperative particle swarm optimization (CPSO) based channel estimation/equalization scheme for multiple-input multiple-output zero-padded single-carrier (MIMO-ZPSC) systems with large dimensions in frequency selective channels. We estimate the channel state information at the receiver in time domain using a PSO based algorithm during training phase. Using the estimated channel, we perform information symbol detection in the frequency domain using FFT based processing. For this detection, we use a low complexity OLA (OverLap Add) likelihood ascent search equalizer which uses minimum mean square (MMSE) equalizer solution as the initial solution. Multiple iterations between channel estimation and data detection are carried out which significantly improves the mean square error and bit error rate performance of the receiver.

On Generalized Spatial Modulation

Generalized spatial modulation (GSM) is a relatively new modulation scheme for multi-antenna wireless communications. It is quite attractive because of its ability to work with less number of transmit RF chains compared to traditional spatial multiplexing (V-BLAST system). In this paper, we show that, by using an optimum combination of number of transmit antennas (N-t) and number of transmit RF chains (N-rf), GSM can achieve better throughput and/or bit error rate (BER) than spatial multiplexing. First, we quantify the percentage savings in the number of transmit RF chains as well as the percentage increase in the rate achieved in GSM compared to spatial multiplexing; 18.75% savings in number of RF chains and 9.375% increase in rate are possible with 16 transmit antennas and 4-QAM modulation. A bottleneck, however, is the complexity of maximum-likelihood (ML) detection of GSM signals, particularly in large MIMO systems where the number of antennas is large. We address this detection complexity issue next. Specifically, we propose a Gibbs sampling based algorithm suited to detect GSM signals. The proposed algorithm yields impressive BER performance and complexity results. For the same spectral efficiency and number of transmit RF chains, GSM with the proposed detection algorithm achieves better performance than spatial multiplexing with ML detection.

End-to-End BER Analysis of Space Shift Keying in Decode-and-Forward Cooperative Relaying

Space shift keying (SSK) is a special case of spatial modulation (SM), which is a relatively new modulation technique that is getting recognized to be attractive in multi-antenna communications. Our new contribution in this paper is an analytical derivation of exact closed-form expression for the end-to-end bit error rate (BER) performance of SSK in decode-and-forward (1)1,) cooperative relaying. An incremental relaying (IR) scheme with selection combining (SC) at the destination is considered. In SSK, since the information is carried by the transmit antenna index, traditional selection combining methods based on instantaneous SNRs can not be directly used. To overcome this problem, we propose to do selection between direct and relayed paths based on the Euclidean distance between columns of the channel matrix. With this selection metric, an exact analytical expression for the end-to-end BER is derived in closed-form. Analytical results are shown to match with simulation results.

Large-MIMO Receiver based on Linear Regression of MMSE Residual

Multiple input multiple output (MIMO) systems with large number of antennas have been gaining wide attention as they enable very high throughputs. A major impediment is the complexity at the receiver needed to detect the transmitted data. To this end we propose a new receiver, called LRR (Linear Regression of MMSE Residual), which improves the MMSE receiver by learning a linear regression model for the error of the MMSE receiver. The LRR receiver uses pilot data to estimate the channel, and then uses locally generated training data (not transmitted over the channel), to find the linear regression parameters. The proposed receiver is suitable for applications where the channel remains constant for a long period (slow-fading channels) and performs quite well: at a bit error rate (BER) of 10(-3), the SNR gain over MMSE receiver is about 7 dB for a 16 x 16 system; for a 64 x 64 system the gain is about 8.5 dB. For large coherence time, the complexity order of the LRR receiver is the same as that of the MMSE receiver, and in simulations we find that it needs about 4 times as many floating point operations. We also show that further gain of about 4 dB is obtained by local search around the estimate given by the LRR receiver.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems

In this paper, we propose a multiple-input multiple-output (MIMO) receiver algorithm that exploits channel hardening that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the matrix become increasingly weaker compared to the diagonal terms as the size of the channel gain matrix increases. Specifically, we propose a message passing detection (MPD) algorithm which works with the real-valued matched filtered received vector (whose signal term becomes, where is the transmitted vector), and uses a Gaussian approximation on the off-diagonal terms of the matrix. We also propose a simple estimation scheme which directly obtains an estimate of (instead of an estimate of), which is used as an effective channel estimate in the MPD algorithm. We refer to this receiver as the channel hardening-exploiting message passing (CHEMP) receiver. The proposed CHEMP receiver achieves very good performance in large-scaleMIMO systems (e.g., in systems with 16 to 128 uplink users and 128 base station antennas). For the considered large MIMO settings, the complexity of the proposed MPD algorithm is almost the same as or less than that of the minimum mean square error (MMSE) detection. This is because the MPD algorithm does not need a matrix inversion. It also achieves a significantly better performance compared to MMSE and other message passing detection algorithms using MMSE estimate of. Further, we design optimized irregular low density parity check (LDPC) codes specific to the considered large MIMO channel and the CHEMP receiver through EXIT chart matching. The LDPC codes thus obtained achieve improved coded bit error rate performance compared to off-the-shelf irregular LDPC codes.

Performance analysis of FSO links under strong atmospheric turbulence conditions using various modulation schemes

Strong atmospheric turbulence is a major hindrance in wireless optical communication systems. In this paper, the performance of a wireless optical communication system is analyzed using different modulation formats such as, binary phase shift keying-subcarrier intensity modulation (BPSK-SIM), differential phase shift keying (DPSK), differential phase shift keying-subcarrier intensity modulation (DPSK-SIM), Mary pulse position modulation (M-PPM) and polarization shift keying (PoISK). The atmospheric channel is modeled for strong atmospheric turbulences with combined effect of turbulence and pointing errors. Novel closed-form analytical expressions for average bit error rate (BER), channel capacity and outage probability for the various modulation techniques, viz. BPSK-SIM, DPSK, DPSK-SIM, PoISK and M-PPM are derived. The simulated results for BER, channel capacity and outage probability of various modulation techniques are plotted and analyzed. (C) 2014 Elsevier GmbH. All rights reserved.

Performance Analysis of Space-Shift Keying in Decode-and-Forward Multihop MIMO Networks

In this paper, space-shift keying (SSK) is considered for multihop multiple-input-multiple-output (MIMO) networks. In SSK, only one among n(s) = 2(m) available transmit antennas, chosen on the basis of m information bits, is activated during transmission. We consider two different systems of multihop co-operation, where each node has multiple antennas and employs SSK. In system I, a multihop diversity relaying scheme is considered. In system II, a multihop multibranch relaying scheme is considered. In both systems, we adopt decode-and-forward (DF) relaying, where each relay forwards the signal only when it correctly decodes. We analyze the end-to-end bit error rate (BER) and diversity order of both the systems with SSK. For binary SSK (n(s) = 2), our analytical BER expression is exact, and our numerical results show that the BERs evaluated through the analytical expression overlap with those obtained through Monte Carlo simulations. For nonbinary SSK (n(s) > 2), we derive an approximate BER expression, where the analytically evaluated BER results closely follow the simulated BER results. We show the comparison of the BERs of SSK and conventional phase-shift keying (PSK) and also show the instances where SSK outperforms PSK. We also present the diversity analyses for SSK in systems I and II, which predict the achievable diversity orders as a function of system parameters.