各位老师好!
电子系博士生MARYAM CHERAGHY（指导老师：陈文教授）学位论文通过通讯评议，将于2021年12月3日（周五）下午举行答辩，具体信息如下：
答辩人：MARYAM CHERAGHY
指导教师：陈文 教授
答辩时间：2021年12月3日（周五）13：00
答辩地点：电信楼1-217或者腾讯会议：648 3386 8616
答辩委员会成员名单：
主席，朱杰，教授，上海交通大学
委员，方向忠，教授，上海交通大学
委员：李骏，教授，南京理工大学
委员：张舜卿，教授，上海大学
委员：唐洪莹，高级工程师，中科院微系统所
秘书：陈绍元，助理研究员，上海交通大学
【论文题目】 Performance Improvement Based on Adaptive Weighted Graph Matrix for Uplink SCMA with Randomly Distributed Users
【论文摘要】
The limited accessibility to the spectrum due to the fifth generation (5G) networks requirements has led to severe challenges, which can be overcome through sparse code multiple access (SCMA) as one of the robust schemes of non-orthogonal multiple access (NOMA) techniques. Stochastic spatial modelling of SCMA networks is essential for their accurate visualization, design methods, and performance analysis, which, in some special situations, can lead to closed-form relationships. These equations enable the understanding of SCMA behavior and provide an insightful design mechanism. Although, the above problems are very challenging for SCMA systems because it is challenging to deal with the multidimensional codebooks involved in the multiuser random scenarios. This thesis provides a systematic treatment for performance metrics analysis of uplink SCMA networks where users are randomly distributed in a disk-shaped cell. First, in this thesis, new closed-form expressions are derived for the average sum rate and users’ individual rate based on an adaptive weighted graph matrix (AWGM). A novel joint resource allocation method as a multi-objective optimization (MO) problem is developed to maximize the average sum rate and fairness among users. Thanks to AWGM, which eliminates the need to separate the assignment and power allocation problems, the MO problem is proposed by a heuristic search approach and a four-step algorithm. It is confirmed that our proposed method, compared to other algorithms, can compromise and improve the multiple objectives’ performance and guarantees a stable range of network performance at different times. Second, this thesis investigates average sum rate maximization by separating assignment and power allocation optimization problems. A new assignment algorithm based on the individual rate with the interference updating capability is proposed. After calculating the factor graph matrix, the power allocation problem is solved by the waterfilling method. The simulation result shows that our proposed method can guarantee stronger optimality compared to the other algorithms. Third and last, the symbol error rate (SER) performance is characterized by assuming joint maximum likelihood (ML) receivers. The new analytical expression for SER is derived. Essential insights are concluded from the simulation and analytical results