Component-wise conditionally unbiased widely linear MMSE estimation

AbstractBiased estimators can outperform unbiased ones in terms of the mean square error (MSE). The best linear unbiased estimator (BLUE) fulfills the so called global conditional unbiased constraint when treated in the Bayesian framework. Recently, the component-wise conditionally unbiased linear minimum mean square error (CWCU LMMSE) estimator has been introduced. This estimator preserves a quite strong (namely the CWCU) unbiased condition which in effect sufficiently represents the intuitive view of unbiasedness. Generally, it is global conditionally biased and outperforms the BLUE in a Bayesian MSE sense. In this work we briefly recapitulate CWCU LMMSE estimation under linear model assumptions, and additionally derive the CWCU LMMSE estimator under the (only) assumption of jointly Gaussian parameters and measurements. The main intent of this work, however, is the extension of the theory of CWCU estimation to CWCU widely linear estimators. We derive the CWCU WLMMSE estimator for different model assumptions and address the analytical relationships between CWCU WLMMSE and WLMMSE estimators. The properties of the CWCU WLMMSE estimator are deduced analytically, and compared by simulation to global conditionally unbiased as well as WLMMSE counterparts with the help of a parameter estimation example and a data estimation/channel equalization application

Evaluating multiple imputation methods for longitudinal healthy aging index - a score variable with data missing due to death, dropout and several missing data mechanisms

The healthy aging index (HAI) is a score variable based on five clinical components. I assess how well it predicts mortality in a sample of older adults from the Framingham Heart Study (FHS). Over 30% of FHS participants have missing HAI across time; I investigate how well imputation methods perform in this setting. I run simulations to compare four methods of multiple imputation (MI) by fully conditional specification (FCS) and the complete case (CC) approach on estimation of means, correlations, and slopes of the HAI over time. I simulate multivariate normal data for each component of HAI at four time points, along with age and sex, using within and across-time correlation patterns at the percent of missing data seen in observed FHS data. My methods of MI are cross-sectional FCS (XFCS, imputation model uses other components at same time), longitudinal FCS (LFCS, uses same component at all times ignoring cross-component correlation), all FCS (AFCS, uses all components at all times) and 2-fold FCS (2fFCS, uses all components at current and adjacent times). I compare percent bias, confidence interval width, coverage probability and relative efficiency for three mechanisms of missing data (MCAR,MAR,MNAR), two sample sizes (n=1000,100), and two numbers of imputed datasets (m=5,20). All longitudinal methods (not XFCS) yield nearly identical results with unbiased estimates of means, correlations and slopes. Increase in precision and relative efficiency is small when augmenting from 5 to 20 imputations. Finally, I compare the imputation methods and CC analysis in survival models using HAI as a time-dependent variable to predict mortality. I simulate HAI data as described above, time-to-death using piece-wise exponential models, and I impose type I and random censoring on 32% of observations. CC analysis reduces sample size by 10%, produces unbiased estimates, but inflates standard errors. The three longitudinal imputation methods introduce minimal bias (<5%) in the hazard ratio estimates, while reducing the standard error up to 10% compared with CC. Overall, I show that multiple imputation using longitudinal methods is beneficial in the setting of repeated measurements of a score variable. It works well in analyzing changes over time and in time-dependent survival analyses

Multiple-Input Multiple-Output Detection Algorithms for Generalized Frequency Division Multiplexing

Since its invention, cellular communication has dramatically transformed personal lifes and the evolution of mobile networks is still ongoing. Evergrowing demand for higher data rates has driven development of 3G and 4G systems, but foreseen 5G requirements also address diverse characteristics such as low latency or massive connectivity. It is speculated that the 4G plain cyclic prefix (CP)-orthogonal frequency division multiplexing (OFDM) cannot sufficiently fulfill all requirements and hence alternative waveforms have been in-vestigated, where generalized frequency division multiplexing (GFDM) is one popular option. An important aspect for any modern wireless communication system is the application of multi-antenna, i.e. MIMO techiques, as MIMO can deliver gains in terms of capacity, reliability and connectivity. Due to its channel-independent orthogonality, CP-OFDM straightforwardly supports broadband MIMO techniques, as the resulting inter-antenna interference (IAI) can readily be resolved. In this regard, CP-OFDM is unique among multicarrier waveforms. Other waveforms suffer from additional inter-carrier interference (ICI), inter-symbol interference (ISI) or both. This possibly 3-dimensional interference renders an optimal MIMO detection much more complex. In this thesis, weinvestigate how GFDM can support an efficient multiple-input multiple-output (MIMO) operation given its 3-dimensional interference structure. To this end, we first connect the mathematical theory of time-frequency analysis (TFA) with multicarrier waveforms in general, leading to theoretical insights into GFDM. Second, we show that the detection problem can be seen as a detection problem on a large, banded linear model under Gaussian noise. Basing on this observation, we propose methods for applying both space-time code (STC) and spatial multiplexing techniques to GFDM. Subsequently, we propose methods to decode the transmitted signals and numerically and theoretically analyze their performance in terms of complexiy and achieved frame error rate (FER). After showing that GFDM modulation and linear demodulation is a direct application of Gabor expansion and transform, we apply results from TFA to explain singularities of the modulation matrix and derive low-complexity expressions for receiver filters. We derive two linear detection algorithms for STC encoded GFDM signals and we show that their performance is equal to OFDM. In the case of spatial multiplexing, we derive both non-iterative and iterative detection algorithms which base on successive interference cancellation (SIC) and minimum mean squared error (MMSE)-parallel interference cancellation (PIC) detection, respectively. By analyzing the error propagation of the SIC algorithm, we explain its significantly inferior performance compared to OFDM. Using feedback information from the channel decoder, we can eventually show that near-optimal GFDM detection can outperform an optimal OFDM detector by up to 3dB for high SNR regions. We conclude that GFDM, given the obtained results, is not a general-purpose replacement for CP-OFDM, due to higher complexity and varying performance. Instead, we can propose GFDM for scenarios with strong frequency-selectivity and stringent spectral and FER requirements

Incremental Refinements and Multiple Descriptions with Feedback

It is well known that independent (separate) encoding of K correlated sources may incur some rate loss compared to joint encoding, even if the decoding is done jointly. This loss is particularly evident in the multiple descriptions problem, where the sources are repetitions of the same source, but each description must be individually good. We observe that under mild conditions about the source and distortion measure, the rate ratio Rindependent(K)/Rjoint goes to one in the limit of small rate/high distortion. Moreover, we consider the excess rate with respect to the rate-distortion function, Rindependent(K, M) - R(D), in M rounds of K independent encodings with a final distortion level D. We provide two examples - a Gaussian source with mean-squared error and an exponential source with one-sided error - for which the excess rate vanishes in the limit as the number of rounds M goes to infinity, for any fixed D and K. This result has an interesting interpretation for a multi-round variant of the multiple descriptions problem, where after each round the encoder gets a (block) feedback regarding which of the descriptions arrived: In the limit as the number of rounds M goes to infinity (i.e., many incremental rounds), the total rate of received descriptions approaches the rate-distortion function. We provide theoretical and experimental evidence showing that this phenomenon is in fact more general than in the two examples above.Comment: 62 pages. Accepted in the IEEE Transactions on Information Theor

Advanced Channel Estimation Techniques for Multiple-Input Multiple-Output Multi-Carrier Systems in Doubly-Dispersive Channels

Flexible numerology of the physical layer has been introduced in the latest release of 5G new radio (NR) and the baseline waveform generation is chosen to be cyclic-prefix based orthogonal frequency division multiplexing (CP-OFDM). Thanks to the narrow subcarrier spacing and low complexity one tap equalization (EQ) of OFDM, it suits well to time-dispersive channels. For the upcoming 5G and beyond use-case scenarios, it is foreseen that the users might experience high mobility conditions. While the frame structure of the 5G NR is designed for long coherence times, the synchronization and channel estimation (CE) procedures are not fully and reliably covered for diverse applications. The research on alternative multi-carrier waveforms has brought up valuable results in terms of spectral efficiency, applications coexistence and flexibility. Nevertheless, the receiver design becomes more challenging for multiple-input multiple-output (MIMO) non-orthogonal multi-carriers because the receiver must deal with multiple dimensions of interference. This thesis aims to deliver accurate pilot-aided estimations of the wireless channel for coherent detection. Considering a MIMO non-orthogonal multi-carrier, e.g. generalized frequency division multiplexing (GFDM), we initially derive the classical and Bayesian estimators for rich multi-path fading channels, where we theoretically assess the choice of pilot design. Moreover, the well time- and frequency-localization of the pilots in non-orthogonal multi-carriers allows to reuse their energy from cyclic-prefix (CP). Taking advantage of this feature, we derive an iterative approach for joint CE and EQ of MIMO systems. Furthermore, exploiting the block-circularity of GFDM, we comprehensively analyze the complexity aspects, and propose a solution for low complexity implementation. Assuming very high mobility use-cases where the channel varies within the symbol duration, further considerations, particularly the channel coherence time must be taken into account. A promising candidate that is fully independent of the multi-carrier choice is unique word (UW) transmission, where the CP of random nature is replaced by a deterministic sequence. This feature, allows per-block synchronization and channel estimation for robust transmission over extremely doubly-dispersive channels. In this thesis, we propose a novel approach to extend the UW-based physical layer design to MIMO systems and we provide an in-depth study of their out-of-band emission, synchronization, CE and EQ procedures. Via theoretical derivations and simulation results, and comparisons with respect to the state-of-the-art CP-OFDM systems, we show that the proposed UW-based frame design facilitates robust transmission over extremely doubly-dispersive channels.:1 Introduction 1 1.1 Multi-Carrier Waveforms 1 1.2 MIMO Systems 3 1.3 Contributions and Thesis Structure 4 1.4 Notations 6 2 State-of-the-art and Fundamentals 9 2.1 Linear Systems and Problem Statement 9 2.2 GFDM Modulation 11 2.3 MIMO Wireless Channel 12 2.4 Classical and Bayesian Channel Estimation in MIMO OFDM Systems 15 2.5 UW-Based Transmission in SISO Systems 17 2.6 Summary 19 3 Channel Estimation for MIMO Non-Orthogonal Waveforms 21 3.1 Classical and Bayesian Channel Estimation in MIMO GFDM Systems 22 3.1.1 MIMO LS Channel Estimation 23 3.1.2 MIMO LMMSE Channel Estimation 24 3.1.3 Simulation Results 25 3.2 Basic Pilot Designs for GFDM Channel Estimation 29 3.2.1 LS/HM Channel Estimation 31 3.2.2 LMMSE Channel Estimation for GFDM 32 3.2.3 Error Characterization 33 3.2.4 Simulation Results 36 3.3 Interference-Free Pilot Insertion for MIMO GFDM Channel Estimation 39 3.3.1 Interference-Free Pilot Insertion 39 3.3.2 Pilot Observation 40 3.3.3 Complexity 41 3.3.4 Simulation Results 41 3.4 Bayesian Pilot- and CP-aided Channel Estimation in MIMO NonOrthogonal Multi-Carriers 45 3.4.1 Review on System Model 46 3.4.2 Single-Input-Single-Output Systems 47 3.4.3 Extension to MIMO 50 3.4.4 Application to GFDM 51 3.4.5 Joint Channel Estimation and Equalization via LMMSE Parallel Interference Cancellation 57 3.4.6 Complexity Analysis 61 3.4.7 Simulation Results 61 3.5 Pilot- and CP-aided Channel Estimation in Time-Varying Scenarios 67 3.5.1 Adaptive Filtering based on Wiener-Hopf Approac 68 3.5.2 Simulation Results 69 3.6 Summary 72 4 Design of UW-Based Transmission for MIMO Multi-Carriers 73 4.1 Frame Design, Efficiency and Overhead Analysis 74 4.1.1 Illustrative Scenario 74 4.1.2 CP vs. UW Efficiency Analysis 76 4.1.3 Numerical Results 77 4.2 Sequences for UW and OOB Radiation 78 4.2.1 Orthogonal Polyphase Sequences 79 4.2.2 Waveform Engineering for UW Sequences combined with GFDM 79 4.2.3 Simulation Results for OOB Emission of UW-GFDM 81 4.3 Synchronization 82 4.3.1 Transmission over a Centralized MIMO Wireless Channel 82 4.3.2 Coarse Time Acquisition 83 4.3.3 CFO Estimation and Removal 85 4.3.4 Fine Time Acquisition 86 4.3.5 Simulation Results 88 4.4 Channel Estimation 92 4.4.1 MIMO UW-based LMMSE CE 92 4.4.2 Adaptive Filtering 93 4.4.3 Circular UW Transmission 94 4.4.4 Simulation Results 95 4.5 Equalization with Imperfect Channel Knowledge 96 4.5.1 UW-Free Equalization 97 4.5.2 Simulation Results 99 4.6 Summary 102 5 Conclusions and Perspectives 103 5.1 Main Outcomes in Short 103 5.2 Open Challenges 105 A Complementary Materials 107 A.1 Linear Algebra Identities 107 A.2 Proof of lower triangular Toeplitz channel matrix being defective 108 A.3 Calculation of noise-plus-interference covariance matrix for Pilot- and CPaided CE 108 A.4 Bock diagonalization of the effective channel for GFDM 109 A.5 Detailed complexity analysis of Sec. 3.4 109 A.6 CRLB derivations for the pdf (4.24) 113 A.7 Proof that (4.45) emulates a circular CIR at the receiver 11

Bayesian nonlinear hyperspectral unmixing with spatial residual component analysis

This paper presents a new Bayesian model and algorithm for nonlinear unmixing of hyperspectral images. The model proposed represents the pixel reflectances as linear combinations of the endmembers, corrupted by nonlinear (with respect to the endmembers) terms and additive Gaussian noise. Prior knowledge about the problem is embedded in a hierarchical model that describes the dependence structure between the model parameters and their constraints. In particular, a gamma Markov random field is used to model the joint distribution of the nonlinear terms, which are expected to exhibit significant spatial correlations. An adaptive Markov chain Monte Carlo algorithm is then proposed to compute the Bayesian estimates of interest and perform Bayesian inference. This algorithm is equipped with a stochastic optimisation adaptation mechanism that automatically adjusts the parameters of the gamma Markov random field by maximum marginal likelihood estimation. Finally, the proposed methodology is demonstrated through a series of experiments with comparisons using synthetic and real data and with competing state-of-the-art approaches

Bayesian Varying-Coefficient Model with Missing Data

Ph.DDOCTOR OF PHILOSOPH