In this paper, we focus on the throughput of random access with power-domain non-orthogonal multiple access (NOMA) and derive bounds on the throughput. In particular, we demonstrate that the expression for the throughput derived in [1] is an upper-bound and derive a new lower-bound as a closed-form expression. This expression allows to find the traffic intensity that maximizes the lower-bound, which is shown to be the square root of the number of power levels in NOMA. Furthermore, with this expression, for a large number of power levels, we obtain the asymptotic maximum throughput that is increased at a rate of the square root of the number of power levels.
翻译:在本文中,我们侧重于使用非正向多个电源访问的随机访问的输出量, 并得出该传输量的界限。 特别是, 我们证明[ 1] 中衍生的传输量的表达式是一个上限, 并产生一个新的下限, 即一个封闭式表达式。 这个表达式可以找到使下限电量最大化的交通强度, 低限电量被显示为NOMA 中功率水平数的平方根 。 此外, 通过这个表达式, 对于众多的电力水平, 我们获得了以功率水平平方根速度增长的无药用最大输送量 。