CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Robust Successive Compute-and-Forward over Multi-User Multi-Relay Networks

Mohsen Hejazi ; Seyed Mohammad Azimi-Abarghouyi ; Behrooz Makki (Institutionen för signaler och system ; Institutionen för signaler och system, Kommunikationssystem) ; Masoumeh Nasiri-Kenari ; Tommy Svensson (Institutionen för signaler och system ; Institutionen för signaler och system, Kommunikationssystem)
IEEE Transactions on Vehicular Technology (0018-9545). (2016)
[Artikel, refereegranskad vetenskaplig]

This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interference cancellation (SIC) to enhance the system performance compared to the state-of-the-art schemes. Both methods can be utilized in a network with different number of users, relays, and relay antennas, with negligible feedback channels or signaling overhead. We derive new concise formulations and explicit framework for the successive CMF method as well as an approach to reduce its computational complexity. Our theoretical analysis and computer simulations demonstrate the superior performance of our proposed CMF methods over the conventional schemes. Furthermore, based on our simulation results, the successive CMF method yields additional signal-to-noise ratio gains and shows considerable robustness against channel estimation error, compared to the extended CMF method.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-04-02.
CPL Pubid: 234012