Calibrated Polarisation Tilt Angle Recovery for Wireless Communications

In this paper, we show how the polarisation state of a linearly polarised antenna can be recovered through the use of a three-term error correction model. The approach adopted is shown to be robust in situations where some multipath exists and where the sampling channels are imperfect with regard to both their amplitude and phase tracking. In particular, it has been shown that error of the measured polarisation tilt angle can be improved from 33% to 3% and below by applying the proposed calibration method. It is described how one can use a rotating dipole antenna as both the calibration standard and as the polarisation encoder, thus simplifying the physical arrangement of the transmitter. Experimental results are provided in order to show the utility of the approach, which could have a variety of applications including bandwidth conservative polarisation sub-modulation in advanced wireless communications systems.

Extended Energy Vector Prediction of Ambisonically Reproduced Image Direction at Off-Centre Listening Positions

This paper presents an extension to the energy vector, well known in the Ambisonics literature, to improve its predictions of localisation at off-centre listening positions. In determining the source direction, a perceptual weight is assigned to each loudspeaker gain, taking into account the relative arrival times, levels, and directions of the loudspeaker signals. The proposed model is evaluated alongside the original energy vector and two binaural models through comparison with the results of recent perceptual studies. The extended version was found to provide results that were at least 50% more accurate than the second best predictor for two experiments involving off-centre listeners with first- and third-order Ambisonics systems.

Building Support Vector Machines in the Context of Regularised Least Squares

This paper formulates a linear kernel support vector machine (SVM) as a regularized least-squares (RLS) problem. By defining a set of indicator variables of the errors, the solution to the RLS problem is represented as an equation that relates the error vector to the indicator variables. Through partitioning the training set, the SVM weights and bias are expressed analytically using the support vectors. It is also shown how this approach naturally extends to Sums with nonlinear kernels whilst avoiding the need to make use of Lagrange multipliers and duality theory. A fast iterative solution algorithm based on Cholesky decomposition with permutation of the support vectors is suggested as a solution method. The properties of our SVM formulation are analyzed and compared with standard SVMs using a simple example that can be illustrated graphically. The correctness and behavior of our solution (merely derived in the primal context of RLS) is demonstrated using a set of public benchmarking problems for both linear and nonlinear SVMs.