A combinatorial approach to evaluation of reliability of the receiver output for BPSK modulation with spatial diversity

Article publié en ligne à l'adresse : http://www.combinatorics.org/Volume_13/Abstracts/v13i1r2.htmlA combinatorial approach for computing the Bit Error Ratio of a modulation protocol used in mobile telecommunications is proposed

A Combinatorial Approach to Evaluation of Reliability of the Receiver Output for BPSK Modulation with Spatial Diversity LIX,

In the context of soft demodulation of a digital signal modulated with Binary Phase Shift Keying (BPSK) technique and in presence of spatial diversity, we show how the theory of symmetric functions can be used to compute the probability that the log-likelihood of a recieved bit is less than a given threshold ε. We show how such computation can be reduced to computing the probability that U − V < ε (denoted P (U − V < ε)) where U and V are two real random variables such that U = � N i=1 |ui | 2 and V = � N i=1 |vi | 2 where the ui’s and vi’s are independent centered complex Gaussian variables with variances E [ |ui | 2]=χi and E [ |vi | 2]=δi. We give two expressions in terms of symmetric functions over the alphabets ∆ = (δ1,...,δN) andX =(χ1,...,χN) for the first 2N − 1coefficients of the Taylor expansion of P (U −V < ε)intermsofε. The first one is a quotient of multi-Schur functions involving two alphabets derived from alphabets ∆ and X, which allows us to give an efficient algorithm for the computation of these coefficients. The second expression involves a certain sum of pairs of Schur functions sλ(∆) and sµ(X) whereλ and µ are complementary shapes inside a N × N rectangle. We show that such a sum has a natural combinatorial interpretation in terms of what we call square tabloids with ribbons and that there is a natural extension of the Knuth correspondence that associates a (0,1)-matrix to each square tabloid with ribbon. We then show that we can completely characterise the (0,1)-matrices that arise from square tabloids with ribbons under this correspondence. the electronic journal of combinatorics 13 (2006), #R2 1