Joint Channel Bandwidth and Power Allocations for Downlink Non-Orthogonal Multiple Access Systems

2017 ◽  
Author(s):  
Yuan Wu ◽  
Liping Qian ◽  
Haowei Mao ◽  
Weidang Lu ◽  
Haibo Zhou ◽  
...  
Keyword(s):  
Multiple Access ◽  
Channel Bandwidth ◽  
Joint Channel

Resource optimisation for downlink non-orthogonal multiple access systems: a joint channel bandwidth and power allocations approach

2018 ◽  
Vol 12 (19) ◽  
pp. 2429-2437 ◽  
Author(s):  
Yuan Wu ◽  
Haowei Mao ◽  
Kejie Ni ◽  
Xu Feng ◽  
Liping Qian ◽  
...  
Keyword(s):  
Multiple Access ◽  
Channel Bandwidth ◽  
Joint Channel

scholarly journals Stackelberg Game Based Social-Aware Resource Allocation for NOMA Enhanced D2D Communications

Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1360
Author(s):  
Gu ◽  
Zhu
Keyword(s):  
Power Allocation ◽  
Multiple Access ◽  
Social Relationship ◽  
Particle Swarm Optimization Algorithm ◽  
Stackelberg Game ◽  
System Throughput ◽  
D2d Communications ◽  
Second Stage ◽  
The Social ◽  
Joint Channel

Device-to-device (D2D) communication and non-orthogonal multiple access (NOMA) have been considered promising techniques to improve system throughput. In the NOMA-enhanced D2D scenario, a joint channel and power allocation algorithm based on the Stackelberg game is proposed in this paper. The social relationship between the cellular and D2D users is utilized to define their utility functions. In the two-stage Stackelberg game, the cellular user is the leader and the D2D group is the follower. Cellular users and D2D groups are matched via the Kuhn–Munkres (KM) algorithm to allocate channels for D2D groups in the first stage. The power allocation of D2D users is optimized through a penalty-function-based particle swarm optimization algorithm (PSO) in the second stage. The simulation results show that the proposed algorithm can effectively strengthen the cooperation between cellular and D2D users and improve their utility.

scholarly journals A Joint Channel-Network Coding Based on Product Codes for the Multiple-Access Relay Channel

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Tafzeel ur Rehman Ahsin ◽  
Slimane Ben Slimane
Keyword(s):  
Network Coding ◽  
Channel Coding ◽  
Multiple Access ◽  
Relay Channel ◽  
Decoding Algorithm ◽  
Channel Network ◽  
Product Codes ◽  
Coding Scheme ◽  
Coding Schemes ◽  
Joint Channel

The multiple access relay channel with network coding has the potential to achieve diversity and improve coverage of wireless networks. Its network coding scheme provides an extra redundancy that can be used at the receiver to improve the performance of the cooperating users. This paper shows that the combination of channel coding and network coding, in the multiple access relay channel, can be seen as a product code with rows formed by the code-words of the individual channel codes of the users and columns formed by the network coding code-words. This new representation allows the use of any decoding algorithm of product codes at the receiver to decode the information data of the cooperating users. This decoding process is a complete joint channel-network decoding algorithm as it sees the combination of the two coding schemes as a single coding scheme. It also gives the possibility to use network coding schemes more powerful than conventional XOR-based network coding. The obtained results show that the proposed product-based network coding structure can improve the performance of the multiple-access relay channel without reducing its efficiency and allow a very flexible cooperation between the involved users.

Sign in / Sign up

Export Citation Format

Share Document