8 July 2009 in Numerical Algorithms
24 September 2011 in BIT Numerical Mathematics
21 June 2010 in IEEE Transactions on Vehicular Technology
We investigate link-quality metrics (LQMs) based on raw bit-error-rate, effective signal-to-interference-plus-noise ratio, and mutual information (MI) for the purpose of fast link adaptation (LA) in communication systems employing orthogonal frequency-division multiplexing and multiple-input-multiple-output (MIMO) antenna technology. From these LQMs, the packet error rate (PER) can be estimated and exploited to select the modulation and coding scheme (MCS) among a class of candidate MCSs that achieves the maximum throughput for the current channel state under a specified target PER objective. We propose a novel MI-based LQM and compare the PER-estimation accuracy obtained with this LQM with that resulting from using other LQMs by means of comprehensive Monte Carlo simulations. Search methods for the MCS in the class that is most suitable for a given channel state are presented. An algorithm for obtaining a practical upper bound on the throughput of any LA scheme is proposed. The investigated LQMs are applied to the IEEE 802.11n standard with a 2 × 2 MIMO configuration and practical channel estimation. The proposed MI-based LQM yields the highest PER estimation accuracy, and its throughput shows only 1.7 dB signal-to-noise-ratio (SNR) loss with respect to the upper bound but up to 9.5 dB SNR gain, compared to the MCS maximizing the throughput for the current noise variance.
1 June 2017 in Signal Processing
4 July 2017 in IEEE Transactions on Signal Processing
The analysis of (approximately) periodic signals is an important element in numerous applications. One generalization of standard periodic signals often occurring in practice is harmonic chirp signals where the instantaneous frequency increases/decreases linearly as a function of time. A statistically efficient estimator for extracting the parameters of the harmonic chirp model in additive white Gaussian noise is the maximum-likelihood (ML) estimator, which recently has been demonstrated to be robust to noise and accurate-even when the model order is unknown. The main drawback of the ML estimator is that only very computationally demanding algorithms for computing an estimate are known. In this paper, we give an algorithm for computing an estimate to the ML estimator for a number of candidate model orders with a much lower computational complexity than previously reported in the literature. The lower computational complexity is achieved by exploiting recursive matrix structures, including a block Toeplitz-plus-Hankel structure, the fast Fourier transform, and using a two-step approach composed of a grid and refinement step to reduce the number of required function evaluations. The proposed algorithms are assessed via Monte Carlo and timing studies. The timing studies show that the proposed algorithm is orders of magnitude faster than a recently proposed algorithm for practical sizes of the number of harmonics and the length of the signal.