Signal-perturbation-free semi-blind channel estimation for MIMO-OFDM systems

Multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) has been considered as a strong candidate for the beyond 3G (B3G) wireless communication systems, due to its high data-rate wireless transmission performance. It is well known that the advantages promised by MIMO-OFDM systems rely on the precise knowledge of the channel state information (CSI). In real wireless environments, however, the channel condition is unknown. Therefore, channel estimation is of crucial importance in MIMO-OFDM systems. Semi-blind channel estimation as a combination of the training-based or pilot-assisted method and the pure blind approach is considered to be a feasible solution for practical wireless systems due to its better estimation accuracy as well as spectral efficiency. In this thesis, we address the semi-blind channel estimation issue of MIMO-OFDM systems with an objective to develop very efficient channel estimation approaches. In the first part of the dissertation, several nulling-based semi-blind approaches are presented for the estimation of time-domain MIMO-OFDM channels. By incorporating a blind constraint that is derived from MIMO linear prediction (LP) into a training-based least-square method, a semi-blind solution for the time-domain channel estimation is first obtained. It is revealed through a perturbation analysis that the semi-blind solution is not subject to signal perturbation and therefore is superior to pure blind estimation methods. The LP-based semi-blind method is then extended for the channel estimation of MIMO-OFDM systems with pulse-shaping. By exploiting the pulse-shaping filter in the transmitter and the matched filter in the receiver, a very efficient semi-blind approach is developed for the estimation of sampling duration based multipath channels. A frequency-domain correlation matrix estimation algorithm is also presented to facilitate the computation of time-domain second-order statistics required in the LP-based method. The nulling-based semi-blind estimation issue of sparse MIMO-OFDM channels is also addressed. By disclosing and using a relationship between the positions of the most significant taps (MST) of the sparse channel and the lags of nonzero correlation matrices of the received signal, a novel estimation approach consisting of the MST detection and the sparse channel estimation, both in a semi-blind fashion, is developed. An intensive simulation study of all the proposed nulling-based methods with comparison to some existing techniques is conducted, showing a significant superiority of the new methodologies. The second part of the dissertation is dedicated to the development of two signal-perturbation-free (SPF) semi-blind channel estimation algorithms based on a novel transmit scheme that bears partial information of the second-order statistics of the transmitted signal to receiver. It is proved that the new transmit scheme can completely cancel the signal perturbation error in the noise-free case, thereby improving largely the estimation accuracy of correlation matrix for channel estimation in noisy conditions. It is also shown that the overhead caused by the transmission of the 8PF data is negligible as compared to that of regular pilot signals. By using the proposed transmit scheme, a whitening rotation (WR)-based algorithm is first developed for frequency-domain MIMO-OFDM channel estimation. It is shown through both theoretical analysis and simulation study that the new WR-based algorithm significantly outperforms the conventional WR-based method and the nulling-based semi-blind method. By using MIMO linear prediction, the new WR-based algorithm utilizing the 8PF transmit scheme is then extended for time-domain MIMO-OFDM channel estimation. Computer simulations show that the proposed signal-perturbation-free LP-based semi-blind solution performs much better than the LP semi-blind method without using the proposed transmit scheme, the LS method as well as the nulling-based semi-blind method in terms of the MSE of the channel estimate

Low-Complexity Joint Channel Estimation and List Decoding of Short Codes

A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a non-coherent decoding metric to the codewords composing the list. This allows one to use very few pilots, thus reducing the channel estimation overhead. The method is applied to an ordered statistics decoder for communication over a Rayleigh block-fading channel. Gains of up to $1.2$ dB as compared to traditional PAT schemes are demonstrated for short codes with QPSK signaling. The approach can be generalized to other list decoders, e.g., to list decoding of polar codes.Comment: Accepted at the 12th International ITG Conference on Systems, Communications and Coding (SCC 2019), Rostock, German

Iterative Joint Channel Estimation and Multi-User Detection for Multiple-Antenna Aided OFDM Systems

Multiple-Input-Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems have recently attracted substantial research interest. However, compared to Single-Input-Single-Output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In the context of the Bell LAyered Space-Time architecture (BLAST) or Space Division Multiple Access (SDMA) multi-user MIMO OFDM systems, none of the known channel estimation techniques allows the number of users to be higher than the number of receiver antennas, which is often referred to as a “rank-deficient” scenario, owing to the constraint imposed by the rank of the MIMO channel matrix. Against this background, in this paper we propose a new Genetic Algorithm (GA) assisted iterative Joint Channel Estimation and Multi-User Detection (GA-JCEMUD) approach for multi-user MIMO SDMA-OFDM systems, which provides an effective solution to the multi-user MIMO channel estimation problem in the above-mentioned rank-deficient scenario. Furthermore, the GAs invoked in the data detection literature can only provide a hard-decision output for the Forward Error Correction (FEC) or channel decoder, which inevitably limits the system’s achievable performance. By contrast, our proposed GA is capable of providing “soft” outputs and hence it becomes capable of achieving an improved performance with the aid of FEC decoders. A range of simulation results are provided to demonstrate the superiority of the proposed scheme. Index Terms—Channel estimation, genetic algorithm, multiple-input-multiple-output, multi-user detection, orthogonal frequency division multiplexing, space division multiple access

Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically relevant scenario in which there is no \emph{a priori} channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, for the case when a coded packet of $168$ symbols is transmitted using a channel code of rate $0.48$ bits/channel use, over a block-fading channel with block size equal to $8$ symbols, PAT requires an additional $1.2$ dB of energy per information bit to achieve a packet error probability of $10^{-3}$ compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance are close ($1$ dB gap at $10^{-3}$ packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa

Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols

In this paper, we describe direct-sequence code-division multiple-access (DS-CDMA) systems with quadriphase-shift keying in which channel estimation, coherent demodulation, and decoding are iteratively performed without the use of any training or pilot symbols. An expectation-maximization channel-estimation algorithm for the fading amplitude, phase, and the interference power spectral density (PSD) due to the combined interference and thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate codes. After initial estimates of the fading amplitude, phase, and interference PSD are obtained from the received symbols, subsequent values of these parameters are iteratively updated by using the soft feedback from the channel decoder. The updated estimates are combined with the received symbols and iteratively passed to the decoder. The elimination of pilot symbols simplifies the system design and allows either an enhanced information throughput, an improved bit error rate, or greater spectral efficiency. The interference-PSD estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication

Performance Analysis of Cognitive Radio Systems under QoS Constraints and Channel Uncertainty

In this paper, performance of cognitive transmission over time-selective flat fading channels is studied under quality of service (QoS) constraints and channel uncertainty. Cognitive secondary users (SUs) are assumed to initially perform channel sensing to detect the activities of the primary users, and then attempt to estimate the channel fading coefficients through training. Energy detection is employed for channel sensing, and different minimum mean-square-error (MMSE) estimation methods are considered for channel estimation. In both channel sensing and estimation, erroneous decisions can be made, and hence, channel uncertainty is not completely eliminated. In this setting, performance is studied and interactions between channel sensing and estimation are investigated. Following the channel sensing and estimation tasks, SUs engage in data transmission. Transmitter, being unaware of the channel fading coefficients, is assumed to send the data at fixed power and rate levels that depend on the channel sensing results. Under these assumptions, a state-transition model is constructed by considering the reliability of the transmissions, channel sensing decisions and their correctness, and the evolution of primary user activity which is modeled as a two-state Markov process. In the data transmission phase, an average power constraint on the secondary users is considered to limit the interference to the primary users, and statistical limitations on the buffer lengths are imposed to take into account the QoS constraints of the secondary traffic. The maximum throughput under these statistical QoS constraints is identified by finding the effective capacity of the cognitive radio channel. Numerical results are provided for the power and rate policies