On BER for M-User NOMA with Symmetric SC
On BER for M-User NOMA with Symmetric SC
정규혁(단국대학교)
45권 10호, 1694~1699쪽
초록
In non-orthogonal multiple access (NOMA), the ideal perfect successive interference cancellation (SIC) is validated theoretically by the random channel coding, practically such as low-density parity-check (LDPC) codes or turbo codes. Recently, symmetric superposition coding (SSC) has been shown to achieve the ideal perfect SIC bit-error rate (BER) performance by simulations with as many as three users, while the authors of this letter derived the analytical expression for BER, only for to a two-user scenario. In this letter, the derivation of the closed-form BER expression for M users is reported. It is shown that the SSC NOMA achieves near-perfect SIC BER performance. This is possible for with two reasons; one is the power allocation of the user fairness, and the other is the optimal maximum-likelihood (ML) detection.
Abstract
In non-orthogonal multiple access (NOMA), the ideal perfect successive interference cancellation (SIC) is validated theoretically by the random channel coding, practically such as low-density parity-check (LDPC) codes or turbo codes. Recently, symmetric superposition coding (SSC) has been shown to achieve the ideal perfect SIC bit-error rate (BER) performance by simulations with as many as three users, while the authors of this letter derived the analytical expression for BER, only for to a two-user scenario. In this letter, the derivation of the closed-form BER expression for M users is reported. It is shown that the SSC NOMA achieves near-perfect SIC BER performance. This is possible for with two reasons; one is the power allocation of the user fairness, and the other is the optimal maximum-likelihood (ML) detection.
- 발행기관:
- 한국통신학회
- 분류:
- 전자/정보통신공학