{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":21,"n_cols":5,"rows_kept":21,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[12,2,12,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910830889403321"]
[null,null,"Autore",null,"Liu Yuanwei"]
[null,null,"Titolo",null,"Next Generation Multiple Access"]
[null,null,"Pubbl/distr/stampa",null,"Newark : , : John Wiley & Sons, Incorporated, , 2024"]
[{"$nulls":4},"©2024"]
[null,null,"ISBN",null,"1-394-18052-7"]
[{"$nulls":4},"1-394-18050-0"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (624 pages)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Cover -- Title Page -- Copyright -- Contents -- About the Editors -- List of Contributors -- Preface -- Acknowledgments -- Chapter 1 Next Generation Multiple Access Toward 6G -- 1.1 The Road to NGMA -- 1.2 Non‐Orthogonal Multiple Access -- 1.3 Massive Access -- 1.4 Book Outline -- Part I Evolution of NOMA Towards NGMA -- Chapter 2 Modulation Techniques for NGMA/NOMA -- 2.1 Introduction -- 2.2 Space‐Domain IM for NGMA -- 2.2.1 SM‐Based NOMA -- 2.2.1.1 Multi‐RF Schemes -- 2.2.1.2 Single‐RF Schemes -- 2.2.1.3 Recent Developments in SM‐NOMA -- 2.2.2 RSM‐Based NOMA -- 2.2.3 SM‐Aided SCMA -- 2.3 Frequency‐Domain IM for NGMA -- 2.3.1 NOMA with Frequency‐Domain IM -- 2.3.1.1 OFDM‐IM NOMA -- 2.3.1.2 DM‐OFDM NOMA -- 2.3.2 C‐NOMA with Frequency‐Domain IM -- 2.3.2.1 Broadcast Phase -- 2.3.2.2 Cooperative Phase -- 2.4 Code‐Domain IM for NGMA -- 2.4.1 CIM‐SCMA -- 2.4.2 CIM‐MC‐CDMA -- 2.5 Power‐Domain IM for NGMA -- 2.5.1 Transmission Model -- 2.5.1.1 Two‐User Case -- 2.5.1.2 Multiuser Case -- 2.5.2 Signal Decoding -- 2.5.3 Performance Analysis -- 2.6 Summary -- References -- Chapter 3 NOMA Transmission Design with Practical Modulations -- 3.1 Introduction -- 3.2 Fundamentals -- 3.2.1 Multichannel Downlink NOMA -- 3.2.2 Practical Modulations in NOMA -- 3.3 Effective Throughput Analysis -- 3.3.1 Effective Throughput of the Single‐User Channels -- 3.3.2 Effective Throughput of the Two‐User Channels -- 3.4 NOMA Transmission Design -- 3.4.1 Problem Formulation -- 3.4.2 Power Allocation -- 3.4.2.1 Power Allocation within Channels -- 3.4.2.2 Power Budget Allocation Among Channels -- 3.4.3 Joint "]
[{"$nulls":4},"Resource Allocation -- 3.5 Numerical Results -- 3.6 Conclusion -- References -- Chapter 4 Optimal Resource Allocation for NGMA -- 4.1 Introduction -- 4.2 Single‐Cell Single‐Carrier NOMA -- 4.2.1 Total Power Minimization Problem -- 4.2.2 Sum‐Rate Maximization Problem."]
[{"$nulls":4},"4.2.3 Energy‐Efficiency Maximization Problem -- 4.2.4 Key Features and Implementation Issues -- 4.2.4.1 CSI Insensitivity -- 4.2.4.2 Rate Fairness -- 4.3 Single‐Cell Multicarrier NOMA -- 4.3.1 Total Power Minimization Problem -- 4.3.2 Sum‐Rate Maximization Problem -- 4.3.3 Energy‐Efficiency Maximization Problem -- 4.3.4 Key Features and Implementation Issues -- 4.4 Multi‐cell NOMA with Single‐Cell Processing -- 4.4.1 Dynamic Decoding Order -- 4.4.1.1 Optimal JSPA for Total Power Minimization Problem -- 4.4.1.2 Optimal JSPA for Sum‐Rate Maximization Problem -- 4.4.1.3 Optimal JSPA for EE Maximization Problem -- 4.4.2 Static Decoding Order -- 4.4.2.1 Optimal FRPA for Total Power Minimization Problem -- 4.4.2.2 Optimal FRPA for Sum‐Rate Maximization Problem -- 4.4.2.3 Optimal FRPA for EE Maximization Problem -- 4.4.2.4 Optimal JRPA for Total Power Minimization Problem -- 4.4.2.5 Suboptimal JRPA for Sum‐Rate Maximization Problem -- 4.4.2.6 Suboptimal JRPA for EE Maximization Problem -- 4.5 Numerical Results -- 4.5.1 Approximated Optimal Powers -- 4.5.2 SC‐NOMA versus FDMA-NOMA versus FDMA -- 4.5.3 Multi‐cell NOMA: JSPA versus JRPA versus FRPA -- 4.6 Conclusions -- Acknowledgments -- References -- Chapter 5 Cooperative NOMA -- 5.1 Introduction -- 5.2 System Model for D2MD‐CNOMA -- 5.2.1 System Configuration -- 5.2.2 Channel Model -- 5.3 Adaptive Aggregate Transmission -- 5.3.1 First Phase -- 5.3.2 Second Phase -- 5.4 Performance Analysis -- 5.4.1 Outage Probability -- 5.4.2 Ergodic Sum Capacity -- 5.5 Numerical Results and Discussion -- 5.5.1 Outage Probability -- 5.5.2 Ergodic Sum Capacity -- 5.A.1 Proof of Theorem 5.1 -- References -- Chapter 6 Multi‐scale‐NOMA: An Effective Support to Future Communication-Positioning Integration System -- 6.1 Introduction -- 6.2 Positioning in Cellular Networks -- 6.3 MS‐NOMA Architecture -- 6.4 Interference Analysis."]
[{"$nulls":4},"6.4.1 Single‐Cell Network -- 6.4.1.1 Interference of Positioning to Communication -- 6.4.1.2 Interference of Communication to Positioning -- 6.4.2 Multicell Networks -- 6.4.2.1 Interference of Positioning to Communication -- 6.4.2.2 Interference of Communication to Positioning -- 6.5 Resource Allocation -- 6.5.1 The Constraints -- 6.5.1.1 The BER Threshold Under QoS Constraint -- 6.5.1.2 The Total Power Limitation -- 6.5.1.3 The Elimination of Near‐Far Effect -- 6.5.2 The Proposed Joint Power Allocation Model -- 6.5.3 The Positioning-Communication Joint Power Allocation Scheme -- 6.5.4 Remarks -- 6.6 Performance Evaluation -- 6.6.1 Communication Performance -- 6.6.2 Ranging Performance -- 6.6.3 Resource Consumption of Positioning -- 6.6.3.1 Achievable Positioning Measurement Frequency -- 6.6.3.2 The Resource Element Consumption -- 6.6.3.3 The Power Consumption -- 6.6.4 Positioning Performance -- 6.6.4.1 Comparison by Using CP4A and the Traditional Method -- 6.6.4.2 Comparision Between MS‐NOMA and PRS -- References -- Chapter 7 NOMA‐Aware Wireless Content Caching Networks -- 7.1 Introduction -- 7.2 System Model -- 7.2.1 System Description -- 7.2.2 Content Request Model -- 7.2.3 Random System State -- 7.2.4 System Latency Under Each Random State -- 7.2.5 System's Average Latency -- 7.3 Algorithm Design -- 7.3.1 User Pairing and Power Control Optimization -- 7.3.2 Cache Placement -- 7.3.3 Recommendation Algorithm -- 7.3.4 Joint Optimization Algorithm and Property Analysis -- 7.4 Numerical Simulation -- 7.4.1 Convergence Performance -- 7.4.2 System's Average Latency -- 7.4.3 Cache Hit Ratio -- 7.5 "]
[{"$nulls":4},"Conclusion -- References -- Chapter 8 NOMA Empowered Multi‐Access Edge Computing and Edge Intelligence -- 8.1 Introduction -- 8.2 Literature Review -- 8.3 System Model and Formulation -- 8.3.1 Modeling of Two‐Sided Dual Offloading."]
[{"$nulls":4},"8.3.2 Overall Latency Minimization -- 8.4 Algorithms for Optimal Offloading -- 8.5 Numerical Results -- 8.6 Conclusion -- Acknowledgments -- References -- Chapter 9 Exploiting Non‐orthogonal Multiple Access in Integrated Sensing and Communications -- 9.1 Introduction -- 9.2 Developing Trends and Fundamental Models of ISAC -- 9.2.1 ISAC: From Orthogonality to Non‐orthogonality -- 9.2.2 Downlink ISAC -- 9.2.3 Uplink ISAC -- 9.3 Novel NOMA Designs in Downlink and Uplink ISAC -- 9.3.1 NOMA‐Empowered Downlink ISAC Design -- 9.3.2 Semi‐NOMA‐Based Uplink ISAC Design -- 9.4 Case Study: System Model and Problem Formulation -- 9.4.1 System Model -- 9.4.1.1 Communication Model -- 9.4.1.2 Sensing Model -- 9.4.2 Problem Formulation -- 9.5 Case Study: Proposed Solutions -- 9.6 Case Study: Numerical Results -- 9.6.1 Convergence of Algorithm 9.1 -- 9.6.2 Baseline -- 9.6.3 Transmit Beampattern -- 9.7 Conclusions -- References -- Part II Massive Access for NGMA -- Chapter 10 Capacity of Many‐Access Channels -- 10.1 Introduction -- 10.2 The Many‐Access Channel Model -- 10.3 Capacity of the MnAC -- 10.3.1 The Equal‐Power Case -- 10.3.2 Heterogeneous Powers and Fading -- 10.4 Energy Efficiency of the MnAC -- 10.4.1 Minimum Energy per Bit for Given PUPE -- 10.4.2 Capacity per Unit‐Energy Under Different Error Criteria -- 10.5 Discussion and Open Problems -- 10.5.1 Scaling Regime -- 10.5.2 Some Practical Issues -- Acknowledgments -- References -- Chapter 11 Random Access Techniques for Machine‐Type Communication -- 11.1 Fundamentals of Random Access -- 11.1.1 Coordinated Versus Uncoordinated Transmissions -- 11.1.2 Random Access Techniques -- 11.1.2.1 ALOHA Protocols -- 11.1.2.2 CSMA -- 11.1.3 Re‐transmission Strategies -- 11.2 A Game Theoretic View -- 11.2.1 A Model -- 11.2.2 Fictitious Play -- 11.3 Random Access Protocols for MTC -- 11.3.1 4‐Step Random Access."]
[{"$nulls":4},"11.3.2 2‐Step Random Access -- 11.3.3 Analysis of 2‐Step Random Access -- 11.3.4 Fast Retrial -- 11.4 Variants of 2‐Step Random Access -- 11.4.1 2‐Step Random Access with MIMO -- 11.4.2 Sequential Transmission of Multiple Preambles -- 11.4.3 Simultaneous Transmission of Multiple Preambles -- 11.4.4 Preambles for Exploration -- 11.5 Application of NOMA to Random Access -- 11.5.1 Power‐Domain NOMA -- 11.5.2 S‐ALOHA with NOMA -- 11.5.3 A Generalization with Multiple Channels -- 11.5.4 NOMA‐ALOHA Game -- 11.6 Low‐Latency Access for MTC -- 11.6.1 Long Propagation Delay -- 11.6.2 Repetition Diversity -- 11.6.3 Channel Coding‐Based Random Access -- References -- Chapter 12 Grant‐Free Random Access via Compressed Sensing: Algorithm and Performance -- 12.1 Introduction -- 12.2 Joint Device Detection, Channel Estimation, and Data Decoding with Collision Resolution for MIMO Massive Unsourced Random Access -- 12.2.1 System Model and Encoding Scheme -- 12.2.1.1 System Model -- 12.2.1.2 Encoding Scheme -- 12.2.2 Collision Resolution Protocol -- 12.2.3 Decoding Scheme -- 12.2.3.1 Joint DAD‐CE Algorithm -- 12.2.3.2 MIMO‐LDPC‐SIC Decoder -- 12.2.4 Experimental Results -- 12.3 Exploiting Angular Domain Sparsity for Grant‐Free Random Access: A Hybrid AMP Approach -- 12.3.1 Sparse Modeling of Massive Access -- 12.3.2 Recovery Algorithm -- 12.3.2.1 Application to Unsourced Random Access -- 12.3.3 Experimental Results -- 12.4 LEO Satellite‐Enabled Grant‐Free Random Access -- 12.4.1 System Model -- 12.4.1.1 Channel Model -- 12.4.1.2 Signal Modulation -- 12.4.1.3 Problem Formulation -- 12.4.2 Pattern Coupled SBL "]
[{"$nulls":4},"Framework -- 12.4.2.1 The Pattern‐Coupled Hierarchical Prior -- 12.4.2.2 SBL Framework -- 12.4.3 Experimental Results -- 12.5 Concluding Remarks -- Acknowledgments -- References -- Chapter 13 Algorithm Unrolling for Massive Connectivity in IoT Networks."]
[{"$nulls":4},"13.1 Introduction."]