Sparse-DFT and WHT Precoding with Iterative Detection for Highly Frequency-Selective Channels

Various precoders have been recently studied by the wireless community to combat the channel fading effects. Two prominent precoders are implemented with the discrete Fourier transform (DFT) and Walsh-Hadamard transform (WHT). The WHT precoder is implemented with less complexity since it does not need complex multiplications. Also, spreading can be applied sparsely to decrease the transceiver complexity, leading to sparse DFT (SDFT) and sparse Walsh-Hadamard (SWH). Another relevant topic is the design of iterative receivers that deal with inter-symbol-interference (ISI). In particular, many detectors based on expectation propagation (EP) have been proposed recently for channels with high levels of ISI. An alternative is the maximum a-posterior (MAP) detector, although it leads to unfeasible high complexity in many cases. In this paper, we provide a relatively low-complexity \textcolor{black}{computation} of the MAP detector for the SWH. We also propose two \textcolor{black}{feasible methods} based on the Log-MAP and Max-Log-MAP. Additionally, the DFT, SDFT and SWH precoders are compared using an EP-based receiver with one-tap FD equalization. Lastly, SWH-Max-Log-MAP is compared to the (S)DFT with EP-based receiver in terms of performance and complexity. The results show that the proposed SWH-Max-Log-MAP has a better performance and complexity trade-off for QPSK and 16-QAM under highly selective channels, but has unfeasible complexity for higher QAM orders

Time Reversal with Post-Equalization for OFDM without CP in Massive MIMO

This paper studies the possibility of eliminating the redundant cyclic prefix (CP) of orthogonal frequency division multiplexing (OFDM) in massive multiple-input multiple-output systems. The absence of CP increases the bandwidth efficiency in expense of intersymbol interference (ISI) and intercarrier interference (ICI). It is known that in massive MIMO, different types of interference fade away as the number of base station (BS) antennas tends to infinity. In this paper, we investigate if the channel distortions in the absence of CP are averaged out in the large antenna regime. To this end, we analytically study the performance of the conventional maximum ratio combining (MRC) and realize that there always remains some residual interference leading to saturation of signal to interference (SIR). This saturation of SIR is quantified through mathematical equations. Moreover, to resolve the saturation problem, we propose a technique based on time-reversal MRC with zero forcing multiuser detection (TR-ZF). Thus, the SIR of our proposed TR-ZF does not saturate and is a linear function of the number of BS antennas. We also show that TR-ZF only needs one OFDM demodulator per user irrespective of the number of BS antennas; reducing the BS signal processing complexity significantly. Finally, we corroborate our claims as well as analytical results through simulations.Comment: 7 pages, 3 figure

Successive interference cancellation schemes for time-reversal space-time block codes

In this paper, we propose two simple signal detectors that are based on successive interference cancellation (SIC) for time-reversal space-time block codes to combat intersymbol interference in frequency-selective fading environments. The main idea is to treat undetected symbols and noise together as Gaussian noise with matching mean and variance and use the already-detected symbols to help current signal recovery. The first scheme is a simple SIC signal detector whose ordering is based on the channel powers. The second proposed SIC scheme, which is denoted parallel arbitrated SIC (PA-SIC), is a structure that concatenates in parallel a certain number of SIC detectors with different ordering sequences and then combines the soft output of each individual SIC to achieve performance gains. For the proposed PA-SIC, we describe the optimal ordering algorithm as a combinatorial problem and present a low-complexity ordering technique for signal decoding. Simulations show that the new schemes can provide a performance that is very close to maximum-likelihood sequence estimation (MLSE) decoding under time-invariant conditions. Results for frequency-selective and doubly selective fading channels show that the proposed schemes significantly outperform the conventional minimum mean square error-(MMSE) like receiver and that the new PA-SIC performs much better than the proposed conventional SIC and is not far in performance from the MLSE. The computational complexity of the SIC algorithms is only linear with the number of transmit antennas and transmission rates, which is very close to the MMSE and much lower than the MLSE. The PA-SIC also has a complexity that is linear with the number of SIC components that are in parallel, and the optimum tradeoff between performance and complexity can be easily determined according to the number of SIC detectors

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 providedThis work was supported by the Spanish Government under projects TEC2007-68020-C04-02/TCM (MultiMIMO) and CONSOLIDER-INGENIO 2010 CSD2008-00010 (COMONSENS)