Patent ID: 6414949
Filing Date: 2002-07-02
Classification: H04B,H04J

Abstract:
A receiver for Code Division Multiple Access (CDMA) transmission, this transmission being accessible to a plurality of K users each transmitting a message made up of a plurality of N binary data, each piece of data pertinent to a user being transmitted after spectrum spreading by a pseudo-random binary sequence belonging to that user, this receiver comprising s stages in series, of which:a first stage of reception of a global signal corresponding to all the signals transmitted by the K users, this first stage comprising K channels in parallel, each channel being allocated a particular pseudo-random sequence and being capable of supplying a first estimate of the data received corresponding to the user having used that pseudo-random sequence, this first stage thereby supplying K signals on K outputs, (sâˆ’1) stages of multiple access interference suppression, each of these stages having K inputs and K outputs, the K inputs of the first interference suppression stage being connected to the K outputs of the first reception stage, and the K inputs of the other interference suppression stages being connected to the K outputs from the interference suppression stage that precedes it, means of weighting each group of K signals supplied through the K outputs from each of the s stages, the output signals from a stage of rank i (i being between 0 and sâˆ’1) being weighted by a coefficient &bgr;i the coefficients &bgr;i being chosen so that a certain quantity is a minimum, an adder with s groups of K inputs to receive the s groups of K weighted signals, a decision making means, connected to the adder and receiving, for each user, a weighted sum of signals and supplying the corresponding data finally transmitted, this receiver being characterized by the choice of the weighting coefficients &bgr;i in the following way:A being a matrix of NK lines and NK columns in which the elements of the main diagonal are zeros and the elements outside the diagonal reflect the intercorrelations between the signals transmitted by the K users for the N different binary data of the transmitted messages, this matrix A having NK pertinent values &lgr;j distributed in accordance with a certain distribution p(&lgr;), the polynomial expansion &agr;0&lgr;0j+&agr;1&lgr;1j+. . . +&agr;i&lgr;ij+. . . +&agr;sâˆ’1&lgr;jsâˆ’1, where the &agr;i are coefficients, having with the quantity 1/(1+&lgr;j), a deviation designated e(&lgr;j) for each pertinent value &lgr;j, the quantity that is made a minimum is the sum, for all pertinent values &lgr;j of the square of this deviation, weighted by the distribution of the pertinent values, i.e. &Sum;j=0NK-1&it;â€ƒ&it;p&it;â€ƒ&it;(Î»)&af;[e&it;(Î»j)]2,with in addition the condition &Sum;j=0NK-1&it;p&it;(Î»j)&it;e&it;(Î»j)=0,this double constraint defining the coefficients &agr;i,the weighting coefficients &bgr;I modifying each stage of the receiver are derived from coefficients &agr;I by the equations &bgr;i=(âˆ’1)i(&agr;i+&agr;i+1) for values of i going from 0 to sâˆ’2 and &bgr;i=(âˆ’1)i&agr;i for i=sâˆ’1.