Reduced-rank multiuser relaying (RR-MUR) scheme for uplink CDMA networks

Cooperative relaying has been studied extensively in the literature to exploit spatial diversity gains by having each source transmit its messages through multiple independently fading relay paths. In multiuser systems where multiple sources may access the same set of relays simultaneously, CDMA spreading techniques along with multiuser detection schemes have been proposed in the literature to eliminate multiple access interference (MAI). In order for each relay to forward messages from all sources, a tremendous increase in dimensions (or spreading gain) is used to accommodate the relay transmissions. To reduce the required bandwidth or dimensions, we propose a reduced-rank multiuser relaying (RR-MUR) scheme where the data received from multiple users are first compressed into lower dimensions before being retransmitted. More specifically, linear compression precoders at the relays and decoder at the destination are found by imposing a recursive joint optimization procedure with the objective of minimizing the mean square error (MMSE) of the estimate at the destination. We show through numerical simulations that the RR-MUR scheme outperforms the often adopted Q-selection scheme in terms of increased spectral efficiency.