Sparse and Dense: An Achievable Region for Code-Domain NOMA with Mixed Users

2021 ◽  
Author(s):  
Benjamin M. Zaidel ◽  
Shlomo Shamai Shitz
Keyword(s):  
Code Domain ◽  
Achievable Region

Superimposed Pilot Code-Domain NOMA Scheme for Satellite-Based Internet of Things

2020 ◽  
pp. 1-12
Author(s):  
Jian Jiao ◽  
Junliang Zhou ◽  
Shaohua Wu ◽  
Qinyu Zhang
Keyword(s):  
Internet Of Things ◽  
Code Domain

A Code-Domain, In-Band, Full-Duplex Wireless Communication Link With Greater Than 100-dB Rejection

2021 ◽  
Vol 69 (1) ◽  
pp. 955-968
Author(s):  
Ahmed Hamza ◽  
Aravind Nagulu ◽  
Alfred Festus Davidson ◽  
Jonathan Tao ◽  
Cameron Hill ◽  
...  
Keyword(s):  
Wireless Communication ◽  
Full Duplex ◽  
Communication Link ◽  
Code Domain

scholarly journals Relay Channel with Non-causal State Information at the Source and Relay

2018 ◽  
Author(s):  
Viswanathan Ramachandran
Keyword(s):  
Open Problem ◽  
Relay Channel ◽  
State Information ◽  
State Dependent ◽  
Causal State ◽  
Outer Bound ◽  
Achievable Region

A state-dependent discrete memoryless relay channel is considered, with non-causal side informationavailable at both the sender and the relay. The capacity of thisrelay model is an open problem. We improve upon the knownachievable regions for this setting, in addition to proving an outerbound. The key idea in the proof of achievable region is to employa modified decode-forward scheme. The characterization is thenextended to a relay broadcast setting, where an improved innerbound over existing schemes and an outer bound are exhibited.

Sign in / Sign up

Export Citation Format

Share Document