Electrical - Electronic Engineering / Elektrik - Elektronik Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/11
Browse
2 results
Search Results
Conference Object Citation - Scopus: 1Interference Management for Multiuser Multiantenna Ofdma Underlaying Device-To Communications(IEEE, 2017) Özbek, Berna; Pischella, Mylene; Le Ruyet, DidierUnderlaying device-to-device (D2D) transmission in cellular wireless systems is one of the promising transmission techniques for fifth generation (5G) and beyond 5G applications. Nevertheless, the interference between the D2D pairs, the interference from cellular users to D2D receivers and the interference that affects the cellular communications should be mitigated to increase the overall system performance. In this paper, we propose interference management techniques for D2D underlaying communications in multiuser multiantenna orthogonal frequency division multiple access (OFDMA) systems. Our goal is to increase the data rate of both the cellular users and D2D pairs by performing interference management in frequency, power and spatial dimensions. The performance evaluations illustrate the effectiveness of the proposed algorithm in terms of average data rate and average transmitted power for both cellular users and D2D pairs.Conference Object Citation - Scopus: 2Message-Passing Algorithm for Sum-Rate Maximization in Multi-Antenna Underlay D2d Communications(IEEE, 2018) Özbek, Berna; Pischella, Mylene; Le Ruyet, DidierIn this paper, we propose a resource allocation of device-to-device (D2D) communications underlaying multiantenna cellular systems by employing message-passing algorithm. It is possible to construct the factor graph of the D2D pairs by considering the interference power at the base station and among the D2D pairs. The goal is to avoid interfering the cellular transmission while increasing the sum data rate of D2D pairs. We show that the proposed resource allocation based on message passing algorithm allow us to almost reach the performance of the exhaustive search and outperforms the random allocation. Since the associated factor graph is not fully connected, the complexity of the algorithm is significantly reduced compared to the exhaustive search. © 2018 IEEE.