2,854 research outputs found

    Opportunistic Relaying in Wireless Networks

    Full text link
    Relay networks having nn source-to-destination pairs and mm half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have been reported in the literature. However, most of the proposed solutions require either centrally coordinated scheduling or detailed channel state information (CSI) at the transmitter side. Here, an opportunistic relaying scheme is proposed, which alleviates these limitations. The scheme entails a two-hop communication protocol, in which sources communicate with destinations only through half-duplex relays. The key idea is to schedule at each hop only a subset of nodes that can benefit from \emph{multiuser diversity}. To select the source and destination nodes for each hop, it requires only CSI at receivers (relays for the first hop, and destination nodes for the second hop) and an integer-value CSI feedback to the transmitters. For the case when nn is large and mm is fixed, it is shown that the proposed scheme achieves a system throughput of m/2m/2 bits/s/Hz. In contrast, the information-theoretic upper bound of (m/2)loglogn(m/2)\log \log n bits/s/Hz is achievable only with more demanding CSI assumptions and cooperation between the relays. Furthermore, it is shown that, under the condition that the product of block duration and system bandwidth scales faster than logn\log n, the achievable throughput of the proposed scheme scales as Θ(logn)\Theta ({\log n}). Notably, this is proven to be the optimal throughput scaling even if centralized scheduling is allowed, thus proving the optimality of the proposed scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information Theor

    Deep learning SIC approach for uplink MIMO-NOMA system

    Get PDF
    Abstract. Deep learning-based successive interference cancellation (DL-SIC) for uplink multiple-input multiple-output -non-orthogonal multiple access (MIMO-NOMA) system tries to optimize the users’ bit error rate (BER) and total mean square error (MSE) performance with higher order modulation schemes. The recent work of DL-SIC receiver design for users with a QPSK modulation scheme is investigated in this thesis to validate its performance as a potential alternative approach to traditional SIC receivers for NOMA users. Then, a DL-SIC receiver design for higher order modulation with less dependence on modulation order in the output layer is proposed, which enables us to decode the users with different modulation schemes. In our proposed design, we employ two deep neural networks (DNNs) for each SIC step. The system model is considered an M-antenna base station (BS) that serves two uplink users with a single antenna in the Rayleigh fading channel. The equivalent conventional minimum mean square error-based SIC (MMSE-SIC) and zero-forcing-based SIC (ZF-SIC) receivers are implemented as a baseline comparison. The simulation results showed that the BER performance of the proposed DL-SIC receiver for both users with QPSK modulation results in a 10 dB gain between BER of 10^(-2) and 10^(-3) compared to the ZF-SIC receiver. Furthermore, the performance difference between the proposed scheme and ZF-SIC is significantly high when both users transmit with 16QAM. Overall, the proposed DL-SIC receiver performs better in all signal-to-noise ratio (SNR) regions than the equivalent ZF-SIC receivers and also aids in mitigating the SIC error propagation problem. In addition, it improves the processing latency due to the benefits of the parallelized computing architecture and decreases the complexity of traditional SIC receivers

    Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access

    Full text link
    This work introduces downlink non-orthogonal multiple access (NOMA) into short-packet communications. NOMA has great potential to improve fairness and spectral efficiency with respect to orthogonal multiple access (OMA) for low-latency downlink transmission, thus making it attractive for the emerging Internet of Things. We consider a two-user downlink NOMA system with finite blocklength constraints, in which the transmission rates and power allocation are optimized. To this end, we investigate the trade-off among the transmission rate, decoding error probability, and the transmission latency measured in blocklength. Then, a one-dimensional search algorithm is proposed to resolve the challenges mainly due to the achievable rate affected by the finite blocklength and the unguaranteed successive interference cancellation. We also analyze the performance of OMA as a benchmark to fully demonstrate the benefit of NOMA. Our simulation results show that NOMA significantly outperforms OMA in terms of achieving a higher effective throughput subject to the same finite blocklength constraint, or incurring a lower latency to achieve the same effective throughput target. Interestingly, we further find that with the finite blocklength, the advantage of NOMA relative to OMA is more prominent when the effective throughput targets at the two users become more comparable.Comment: 15 pages, 9 figures. This is a longer version of a paper to appear in IEEE Transactions on Wireless Communications. Citation Information: X. Sun, S. Yan, N. Yang, Z. Ding, C. Shen, and Z. Zhong, "Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access," IEEE Trans. Wireless Commun., accepted to appear [Online] https://ieeexplore.ieee.org/document/8345745
    corecore