TY - GEN
T1 - Every Bit Counts
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
AU - Kosut, Oliver
AU - Effros, Michelle
AU - Langberg, Michael
N1 - Funding Information:
O. Kosut is with the School of Electrical, Computer and Energy Engineering at Arizona State University. Email: okosut@asu.edu M. Effros is with the Department of Electrical Engineering at the California Institute of Technology. Email: effros@caltech.edu M. Langberg is with the Department of Electrical Engineering at the University at Buffalo (State University of New York). Email: mikel@buffalo.edu This work is supported in part by NSF grants CCF-1817241, CCF-1908725, and CCF-1909451. The full version of this work appears in [1].
Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
N2 - The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is known to show significant rate benefits, even when the rate of cooperation is limited. We continue this line of study for cooperation rates which are sub-linear in the blocklength n. Roughly speaking, our results show that if the facilitator transmits log K bits, then there is a sum-rate benefit of order √log K/n compared to the best-known achievable rate. This result extends across a wide range of K: even a single bit of cooperation is shown to provide a sum-rate benefit of order 1/√n.
AB - The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is known to show significant rate benefits, even when the rate of cooperation is limited. We continue this line of study for cooperation rates which are sub-linear in the blocklength n. Roughly speaking, our results show that if the facilitator transmits log K bits, then there is a sum-rate benefit of order √log K/n compared to the best-known achievable rate. This result extends across a wide range of K: even a single bit of cooperation is shown to provide a sum-rate benefit of order 1/√n.
UR - http://www.scopus.com/inward/record.url?scp=85115098999&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85115098999&partnerID=8YFLogxK
U2 - 10.1109/ISIT45174.2021.9517769
DO - 10.1109/ISIT45174.2021.9517769
M3 - Conference contribution
AN - SCOPUS:85115098999
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2214
EP - 2219
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 12 July 2021 through 20 July 2021
ER -