SwePub
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:research.chalmers.se:c60fc127-f2d6-475b-8141-2fe312d65a83"
 

Search: id:"swepub:oai:research.chalmers.se:c60fc127-f2d6-475b-8141-2fe312d65a83" > Robust Successive C...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Hejazi, MohsenSharif University of Technology (author)

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

  • Article/chapterEnglish2016

Publisher, publication year, extent ...

  • 2016
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:research.chalmers.se:c60fc127-f2d6-475b-8141-2fe312d65a83
  • https://research.chalmers.se/publication/234012URI
  • https://doi.org/10.1109/TVT.2015.2506981DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:art swepub-publicationtype
  • Subject category:ref swepub-contenttype

Notes

  • 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) toenhance 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 yieldsadditional signal-to-noise ratio gains and shows considerable robustness against channel estimation error, compared to the extended CMF method.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Azimi-Abarghouyi, Seyed MohammadSharif University of Technology (author)
  • Makki, Behrooz,1980Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)makkib (author)
  • Nasiri-Kenari, MasoumehSharif University of Technology (author)
  • Svensson, Tommy,1970Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)tommys (author)
  • Sharif University of TechnologyChalmers tekniska högskola (creator_code:org_t)

Related titles

  • In:IEEE Transactions on Vehicular Technology65:10, s. 8112-81290018-95451939-9359

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view