On the Proximity Factors of Lattice Reduction-Aided Decoding

Lattice reduction-aided decoding features reduced decoding complexity and near-optimum performance in multi-input multi-output communications. In this paper, a quantitative analysis of lattice reduction-aided decoding is presented. To this aim, the proximity factors are defined to measure the worst-case losses in distances relative to closest point search (in an infinite lattice). Upper bounds on the proximity factors are derived, which are functions of the dimension $n$ of the lattice alone. The study is then extended to the dual-basis reduction. It is found that the bounds for dual basis reduction may be smaller. Reasonably good bounds are derived in many cases. The constant bounds on proximity factors not only imply the same diversity order in fading channels, but also relate the error probabilities of (infinite) lattice decoding and lattice reduction-aided decoding.Comment: remove redundant figure

A new estimate for the approximation of functions by Hermite-Fejér interpolation polynomials

AbstractA new estimate is derived for the error committed in approximating a continuous function by Hermite-Fejér interpolation polynomials on the Chebyshev nodes of the first kind. The estimate obtained reflects the fact that the polynomials interpolate the function which is being approximated

Fractional smoothness and applications in Finance

This overview article concerns the notion of fractional smoothness of random variables of the form $g(X_T)$, where $X=(X_t)_{t\in [0,T]}$ is a certain diffusion process. We review the connection to the real interpolation theory, give examples and applications of this concept. The applications in stochastic finance mainly concern the analysis of discrete time hedging errors. We close the review by indicating some further developments.Fractional smoothness; Discrete time hedging; Interpolation