A simple method to compute the minimum distance Dmin in multiuser code division multiple access (CDMA) systems based on the Cholesky decomposition of the positive-definite symmetric correlation matrix is proposed. Although finding Dmin is known to be NP-hard, this decomposition allows the computation of the minimum distance and the asymptotic efficiency of optimum multiuser detection to be perf...

We obtain an explicit Iwasawa decomposition of the symplectic matrices, complex or real, in terms of the Cholesky factorization for positive definite n×n matrices. We also provide a MATLAB program to compute the decomposition. 1. Iwasawa decomposition of the symplectic groups Let G be the real (noncompact) symplectic group [3, p.129] (the notation there is Spn), [4, p.265] G := Spn(R) = {g ∈ SL...

In recent works, we have studied linear predictive models constrained by time-domain filters. In the present study, we will study the one-dimensional case in more detail. Firstly, we obtain root-exchange properties between the roots of an all-pole model and corresponding constraints. Secondly, using the root-exchange property we can construct a novel matrix decomposition A RA = I, where R is a ...