Network-coded rateless coding scheme in erasure multiple-access relay enable communications

2014 ◽  
Vol 8 (4) ◽  
pp. 537-545 ◽  
Author(s):  
Shushi Gu ◽  
Zhihua Yang ◽  
Qinyu Zhang ◽  
Wei Xiang ◽  
Jian Jiao ◽  
...  
Keyword(s):  
Multiple Access ◽  
Rateless Coding ◽  
Coding Scheme

scholarly journals A MAP Overhead Aware Two-Dimensional OFDMA Burst Construction Algorithm

2019 ◽  
Vol 9 (2) ◽  
pp. 354 ◽  
Author(s):  
Lin-Kung Chen ◽  
Pi-Tzong Jan ◽  
Yen-Hung Chen ◽  
Rui-Ze Hung ◽  
Yen-Jung Lee
Keyword(s):  
Multiple Access ◽  
Large Data ◽  
5G Networks ◽  
Heavy Load ◽  
Coding Scheme ◽  
Channel Quality ◽  
Construction Algorithm ◽  
Construction Methods ◽  
Modulation Coding ◽  
Data Transferring

Conventional orthogonal frequency division multiple access (OFDMA) burst construction methods can only support limited numbers of connections due to the map overhead and corresponding limitations in the numbers of orthogonal resources blocks, which limits the capacity of current 4G and the following 5th generation (5G) networks. This study therefore provides a novel OFDMA burst construction algorithm and enhanced burst indexing aware algorithm (EHA), which try to maximize the throughput while considering the subchannel diversity and optimizing burst indexing issues. The EHA not only allocates the subchannels with the best channel quality for each burst, but also groups the bursts to alleviate the MAP overhead. Simulation results showed that the EHA yields two times the throughput that has been achieved using previous algorithms under a heavy load. Two contributions of the EHA are: (1) the overhead of burst indexing decreases because massive numbers of connections can be accommodated by one burst; and (2) the overall throughput increases due to that one connection with large data transferring requirements can be split and distributed into several bursts and placed on the subchannels with good channel quality to adopt better modulation coding scheme (MCS), if the saved bandwidth in this burst construction is more than the increased overhead of burst indexing.

Coding scheme for multiple-access adder channel with and without idle users

1995 ◽  
Vol 31 (7) ◽  
pp. 523-524 ◽  
Author(s):  
Y.W. Wu ◽  
S.C. Chang
Keyword(s):  
Multiple Access ◽  
Coding Scheme

Time-Slot Coding Scheme With Adaptive Loading Function for Multiple Access in Indoor Optical Wireless Communications

2017 ◽  
Vol 35 (18) ◽  
pp. 4079-4086 ◽  
Author(s):  
Tian Liang ◽  
Ke Wang ◽  
Christina Lim ◽  
Elaine Wong ◽  
Tingting Song ◽  
...  
Keyword(s):  
Wireless Communications ◽  
Multiple Access ◽  
Time Slot ◽  
Optical Wireless ◽  
Optical Wireless Communications ◽  
Coding Scheme ◽  
Loading Function

Power Allocation for Cooperative Communications

2010 ◽  
pp. 62-101
Author(s):  
Onur Kaya ◽  
Sennur Ulukus
Keyword(s):  
Power Allocation ◽  
Cooperative Communications ◽  
Multiple Access ◽  
Average Power ◽  
Cooperative Systems ◽  
Multiple Access Channel ◽  
User Cooperation ◽  
Coding Scheme ◽  
Access Channel ◽  
The One

In this chapter, we review the optimal power allocation policies for fading channels in single user and multiple access scenarios. We provide some background on cooperative communications, starting with the relay channel, and moving onto mutually cooperative systems. Then, we consider power control and user cooperation jointly, and for a fading Gaussian multiple access channel (MAC) with user cooperation, we present a channel adaptive encoding policy, which relies on block Markov superposition coding. We obtain the power allocation policies that maximize the average rates achievable by block Markov coding, subject to average power constraints. The optimal policies result in a coding scheme that is simpler than the one for a general multiple access channel with generalized feedback. This simpler coding scheme also leads to the possibility of formulating an otherwise non-concave optimization problem as a concave one. Using the perfect channel state information (CSI) available at the transmitters to adapt the powers, we demonstrate significant gains over the achievable rates for existing cooperative systems. We consider both backwards and window decoding, and show that, window decoding, which incurs less decoding delay, achieves the same sum rate as backwards decoding, when the powers are optimized.

Sign in / Sign up

Export Citation Format

Share Document