The search functionality is under construction.

Keyword Search Result

[Keyword] reduced complexity(2hit)

1-2hit
  • Investigation on Non-Orthogonal Multiple Access with Reduced Complexity Maximum Likelihood Receiver and Dynamic Resource Allocation

    Yousuke SANO  Kazuaki TAKEDA  Satoshi NAGATA  Takehiro NAKAMURA  Xiaohang CHEN  Anxin LI  Xu ZHANG  Jiang HUILING  Kazuhiko FUKAWA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2017/02/08
      Vol:
    E100-B No:8
      Page(s):
    1301-1311

    Non-orthogonal multiple access (NOMA) is a promising multiple access scheme for further improving the spectrum efficiency compared to orthogonal multiple access (OMA) in the 5th Generation (5G) mobile communication systems. As inter-user interference cancellers for NOMA, two kinds of receiver structures are considered. One is the reduced complexity-maximum likelihood receiver (R-ML) and the other is the codeword level interference canceller (CWIC). In this paper, we show that the R-ML is superior to the CWIC in terms of scheduling flexibility. In addition, we propose a link to system (L2S) mapping scheme for the R-ML to conduct a system level evaluation, and show that the proposed scheme accurately predicts the block error rate (BLER) performance of the R-ML. The proposed L2S mapping scheme also demonstrates that the system level throughput performance of the R-ML is higher than that for the CWIC thanks to the scheduling flexibility.

  • Reduced-Complexity Constellation Mapping and Decoding in Wireless Multi-Way Relaying Networks

    Ning WANG  Zhiguo DING  Xuchu DAI  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E97-B No:4
      Page(s):
    702-711

    In this paper, we focus on the multi-way relaying channel where K users wish to exchange information with each other within two phases. Precoding at each user and the relay is carefully constructed to ensure that the signals from the same user pair are grouped together and cross-pair interference can be cancelled. Reliable detection is challenging at the relay since the observation constellation is no longer one of the regular ones, due to the fact that a relay observation is the superposition of the messages from one of the $ rac{1}{2}K(K-1)$ user pairs. When the trellis coded modulation is used at each node, a simple constellation mapping function and a reduced-states decoding scheme can be applied at the relay, which result in much lower complexity. Furthermore, a modified version of the decoding method is also developed which is called the re-encoding-avoidance scheme at the relay. Monte-Carlo simulation results are provided to demonstrate the performance of the proposed scheme.