The achievement of diversity gain relies on the realization of two signal branches with low signal correlation. A statistical technique is used to simulate the coupling between the channels and quantifies the effect of cross-polar coupling as a function of the intrinsic correlation of the received signals and the coupling introduced by the antenna. The definition of polarization orthogonality i...

A new algorithm for approximate joint diagonalization of a set of matrices is presented. Using a weighted leastsquares (WLS) criterion, without the orthogonality constraint, it is compared with an analoguous algorithm for blind source separation (BSS). The criterion of our algorithm is on the separating matrix while the other is on the mixing matrix. The convergence of our algorithm is proved u...

A complete Bayesian framework for Principal Component Analysis (PCA) is proposed in this paper. Previous model-based approaches to PCA were usually based on a factor analysis model with isotropic Gaussian noise. This model does not impose orthogonality constraints, contrary to PCA. In this paper, we propose a new model with orthogonality restrictions, and develop its approximate Bayesian soluti...

In the analysis of elastic waveguides, the excitability of a given mode is an important feature defined by the displacement-force ratio. Useful analytical expressions have been provided in the literature for modes with real wavenumbers (propagating modes in lossless waveguides). The central result of this paper consists in deriving a generalized expression for the modal excitability valid for m...

The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation 2D systems difficult. recently introduced class isometric TNS (isoTNS) represents subset that allows for efficient such on finite square lattices. isoTNS ansatz requires the identification an "orthogonality column" tensors, within which one-dimensional matrix p...

A major challenge in the design of programming languages is the definition of how elementary concepts interact such as to approximate the impression of orthogonality. We propose to use techniques of concern modeling for capturing such interactions with the goal of providing a language definition which aligns intuition and actual semantics. We report on the design of Object Teams, a programming ...

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data, e.g. image data. Most algorithms are based on approximations of the likelihood, which leads to computationally heavy procedures. Here we introduce two algorithms that are based on heuristic approximations and estimate an approximate overcomplete basis quite fast. The algorithms ar...

We investigate linear operators between C?-algebras which approximately preserve involution and orthogonality, the latter meaning that for some ?>0 we have ??(x)?(y)????x??y? all positive x,y with xy=0. establish structural properties of such maps concerning approximate Jordan-like equations almost commutation relations. In situations (e.g. when codomain is finite-dimensional), show ? can be ap...

Suppose that A is a C^*-algebra. We consider the class of A-linear mappins between two inner product A-modules such that for each two orthogonal vectors in the domain space their values are orthogonal in the target space. In this paper, we intend to determine A-linear mappings that preserve orthogonality. For this purpose, suppose that E and F are two inner product A-modules and A+ is the set o...