TY - GEN
T1 - On a multiple-access in a vector disjunctive channel
AU - Frolov, Alexey
AU - Zyablov, Victor
AU - Sidorenko, Vladimir
AU - Fischer, Robert
PY - 2013
Y1 - 2013
N2 - We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case of a small number of users we give more resources to them. For the resulting multiple-access system a lower bound on the relative sum rate is derived. It is shown to be very close to the maximal value of relative sum rate in [1] even for small number of users. The bound is obtained for the case of decoding by exhaustive search. We also suggest reduced-complexity decoding and compare the maximal number of users in this case and in case of decoding by exhaustive search.
AB - We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case of a small number of users we give more resources to them. For the resulting multiple-access system a lower bound on the relative sum rate is derived. It is shown to be very close to the maximal value of relative sum rate in [1] even for small number of users. The bound is obtained for the case of decoding by exhaustive search. We also suggest reduced-complexity decoding and compare the maximal number of users in this case and in case of decoding by exhaustive search.
UR - http://www.scopus.com/inward/record.url?scp=84890331644&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620218
DO - 10.1109/ISIT.2013.6620218
M3 - Conference contribution
AN - SCOPUS:84890331644
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 211
EP - 215
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -