Efficient LLR Calculation for Non-Binary Modulations over Fading Channels

Log-likelihood ratio (LLR) computation for non-binary modulations over fading channels is complicated. A measure of LLR accuracy on asymmetric binary channels is introduced to facilitate good LLR approximations for non-binary modulations. Considering piecewise linear LLR approximations, we prove convexity of optimizing the coefficients according to this measure. For the optimized approximate LLRs, we report negligible performance losses compared to true LLRs.Comment: Submitted to IEEE Transactions on Communication

On causal extrapolation of sequences with applications to forecasting

The paper suggests a method of extrapolation of notion of one-sided semi-infinite sequences representing traces of two-sided band-limited sequences; this features ensure uniqueness of this extrapolation and possibility to use this for forecasting. This lead to a forecasting method for more general sequences without this feature based on minimization of the mean square error between the observed path and a predicable sequence. These procedure involves calculation of this predictable path; the procedure can be interpreted as causal smoothing. The corresponding smoothed sequences allow unique extrapolations to future times that can be interpreted as optimal forecasts.Comment: arXiv admin note: substantial text overlap with arXiv:1111.670

Explicit formulas for hook walks on continual Young diagrams

We consider, following the work of S. Kerov, random walks which are continuous-space generalizations of the Hook Walks defined by Greene-Nijenhuis-Wilf, performed under the graph of a continual Young diagram. The limiting point of these walks is a point on the graph of the diagram. We present several explicit formulas giving the probability densities of these limiting points in terms of the shape of the diagram. This partially resolves a conjecture of Kerov concerning an explicit formula for the so-called Markov transform. We also present two inverse formulas, reconstructing the shape of the diagram in terms of the densities of the limiting point of the walks. One of these two formulas can be interepreted as an inverse formula for the Markov transform. As a corollary, some new integration identities are derived.Comment: to appear in Adv. Appl. Mat

Helicopter rotor loads using discretized matched asymptotic expansions

The numerical practicality of a matched asymptotic expansion approach for the computation of unsteady three dimensional airloads on a helicopter rotor was improved. This effort utilizes a discretized repesentation of the doublet strength distribution and helical streamlines to decrease the computational requirements of the original analysis. The continuous variation of the doublet strength was approximated by piecewise constant or piecewise quadratic distributions, and the helical trajectory of a fluid particle was approximated by connected straight line segments. As a direct result of these simplified representations the computational time required for the execution of a typical flight condition was reduced by an order of magnitude with respect to the requirements of the original analysis. Airloads which were computed using the discretized method for a two bladed model rotor and a full scale four bladed rotor are in close agreement with measured results and airloads from the original asymptotic analysis. For conditions characterized by significant rotor/wake interaction the piecewise constant representation requires a reduced azimuth spacing to maintain acceptable accuracy