23 research outputs found

    Joint Fixed Power Allocation and Partial Relay Selection Schemes for Cooperative NOMA

    Get PDF
    ย In the future wireless systems, non-orthogonal multiple-access (NOMA) with partial relay selection scheme is considered as developing research topic. In this paper, dual-hop relaying systems is deployed for NOMA, in which the signal is transfered with the assistance of decode-and-forward (DF) scheme. This paper presents exact expressions for outage probability over independent Rayleigh fading channels, and two partial relay selection schemes are provided. Using matching analytical result and Monte-Carlo method, we introduce forwarding strategy selection for fixed user allocation and exactness of derived formula is checked. The presented simulations confirm the the advantage of such considered NOMA, and the effectiveness of the proposed forwarding strategy

    Compressive Sensing Based Massive Access for IoT Relying on Media Modulation Aided Machine Type Communications

    Full text link
    A fundamental challenge of the large-scale Internet-of-Things lies in how to support massive machine-type communications (mMTC). This letter proposes a media modulation based mMTC solution for increasing the throughput, where a massive multi-input multi-output based base station (BS) is used for enhancing the detection performance. For such a mMTC scenario, the reliable active device detection and data decoding pose a serious challenge. By leveraging the sparsity of the uplink access signals of mMTC received at the BS, a compressive sensing based massive access solution is proposed for tackling this challenge. Specifically, we propose a block sparsity adaptive matching pursuit algorithm for detecting the active devices, whereby the block-sparsity of the uplink access signals exhibited across the successive time slots and the structured sparsity of media modulated symbols are exploited for enhancing the detection performance. Moreover, a successive interference cancellation based structured subspace pursuit algorithm is conceived for data demodulation of the active devices, whereby the structured sparsity of media modulation based symbols found in each time slot is exploited for improving the detection performance. Finally, our simulation results verify the superiority of the proposed scheme over state-of-the-art solutions.Comment: submitted to IEEE Transactions on Vehicular Technology [Major Revision

    Active User Detection for Massive Machine-type Communications via Dimension Spreading Deep Neural Network

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (์„์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ „๊ธฐยท์ •๋ณด๊ณตํ•™๋ถ€, 2019. 2. ์‹ฌ๋ณ‘ํšจ.๋Œ€์šฉ๋Ÿ‰ ์‚ฌ๋ฌผ ํ†ต์‹  (massive machine type communication, mMTC)์€ ๋‹ค์ˆ˜์˜ ์‚ฌ๋ฌผ ํ†ต์‹  ๊ธฐ๊ธฐ๋“ค์ด ๊ธฐ์ง€๊ตญ์— ์ ‘์†ํ•˜๋Š” ์ƒํ™ฉ๊ณผ ๊ด€๊ณ„๊ฐ€ ์žˆ๋‹ค. ๋Œ€๊ทœ๋ชจ ์—ฐ๊ฒฐ์„ฑ์„ ์ง€์›ํ•˜๊ธฐ ์œ„ํ•˜์—ฌ ์ตœ๊ทผ์— ๋น„์Šน์ธ ์ ‘์†๊ณผ ๋น„์ง๊ต ๋‹ค์ค‘ ์ ‘์† (non-orthogonal multiple access, NOMA)์ด ๊ณ ๋ ค๋˜์—ˆ๋‹ค. ๋น„์Šน์ธ ๊ธฐ๋ฐ˜ ์ „์†ก ์‹œ, ๊ฐ ๊ธฐ๊ธฐ๋Š” ์Šน์ธ ์ ˆ์ฐจ ์—†์ด ์ •๋ณด๋ฅผ ์ „์†กํ•˜๊ธฐ ๋•Œ๋ฌธ์— ๊ธฐ์ง€๊ตญ์€ ๋ชจ๋“  ๊ธฐ๊ธฐ๋“ค ์ค‘ ํ™œ์„ฑ ์ƒํƒœ์— ์žˆ๋Š” ๊ธฐ๊ธฐ๋“ค๋งŒ์„ ๊ฒ€์ถœํ•˜๋Š” ๊ณผ์ •์„ ์ˆ˜ํ–‰ํ•ด์•ผ ํ•œ๋‹ค. ์ด๋Ÿฌํ•œ ์ ˆ์ฐจ๋ฅผ ํ™œ์„ฑ ๊ธฐ๊ธฐ ๊ฒ€์ถœ (active user detection, AUD)์ด๋ผ๊ณ  ํ•˜๋ฉฐ, ๋น„์ง๊ต ๋‹ค์ค‘ ์ ‘์† ๊ธฐ๋ฐ˜์˜ ์‹œ์Šคํ…œ์—์„œ๋Š” ์ˆ˜์‹  ์‹ ํ˜ธ์— ํ™œ์„ฑ ๊ธฐ๊ธฐ๋“ค์˜ ์‹ ํ˜ธ๋“ค์ด ์ค‘์ฒฉ๋˜์–ด ์žˆ๊ธฐ ๋•Œ๋ฌธ์— ํ™œ์„ฑ ๊ธฐ๊ธฐ๋ฅผ ๊ฒ€์ถœํ•˜๋Š” ๊ฒƒ์€ ์–ด๋ ค์šด ๋ฌธ์ œ์ด๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ์ „์ฒด ๊ธฐ๊ธฐ์˜ ์ˆ˜๊ฐ€ ๋งค์šฐ ๋งŽ์€ ๋Œ€์šฉ๋Ÿ‰ ์‚ฌ๋ฌผ ํ†ต์‹ ์— ์ ํ•ฉํ•œ ์ƒˆ๋กœ์šด ๋ฐฉ์‹์˜ ํ™œ์„ฑ ๊ธฐ๊ธฐ ๊ฒ€์ถœ ๊ธฐ์ˆ ์„ ์ œ์•ˆํ•œ๋‹ค. ์ด ๊ธฐ์ˆ ์„ ์ฐจ์› ํ™•์žฅ ์‹ฌ์ธต ์‹ ๊ฒฝ๋ง ๊ธฐ๋ฐ˜์˜ ํ™œ์„ฑ ๊ธฐ๊ธฐ ๊ฒ€์ถœ (dimension spreading deep neural network based active user detection, DSDNN-AUD)์ด๋ผ๊ณ  ๋ช…๋ช…ํ•˜๋ฉฐ, ๋ณธ ๊ธฐ์ˆ ์˜ ํ•ต์‹ฌ์ ์ธ ํŠน์ง•์€ ์€๋‹‰์ธต์˜ ์ฐจ์›์„ ์†ก์‹  ์ •๋ณด ๋ฒกํ„ฐ์˜ ํฌ๊ธฐ๋ณด๋‹ค ํฌ๊ฒŒ ์„ค์ •ํ•จ์œผ๋กœ์จ ์„œํฌํŠธ ๊ฒ€์ถœ ๋Šฅ๋ ฅ์„ ํ–ฅ์ƒ์‹œํ‚ค๋Š” ๊ฒƒ์ด๋‹ค. ๋ชจ์˜ ์‹คํ—˜ ๊ฒฐ๊ณผ๋ฅผ ํ†ตํ•ด ์ œ์•ˆํ•˜๋Š” ํ™œ์„ฑ ๊ธฐ๊ธฐ ๊ฒ€์ถœ ๊ธฐ์ˆ ์ด ๊ธฐ์กด์˜ ๊ธฐ๋ฒ•๋“ค๋ณด๋‹ค ํ™œ์„ฑ ๊ธฐ๊ธฐ ๊ฒ€์ถœ ์„ฑ๊ณต ํ™•๋ฅ ๊ณผ ์Šค๋ฃจํ’‹ ์„ฑ๋Šฅ ๊ด€์ ์—์„œ ์šฐ์ˆ˜ํ•จ์„ ํ™•์ธํ–ˆ๋‹ค.Massive machine-type communication (mMTC) concerns the access of massive machine-type communication devices to the basestation. To support the massive connectivity, grant-free access and non-orthogonal multiple access (NOMA) have been recently introduced. In the grant-free transmission, each device transmits information without the granting process so that the basestation needs to identify the active devices among all potential devices. This process, called an active user detection (AUD), is a challenging problem in the NOMA-based systems since it is difficult to find out the active devices from the superimposed received signal. An aim of this paper is to propose a new type of AUD scheme suitable for the highly overloaded mMTC, referred to as dimension spreading deep neural network-based AUD (DSDNN-AUD). The key feature of DSDNN-AUD is to set the dimension of hidden layers being larger than the size of a transmit vector to improve the representation quality of the support. Numerical results demonstrate that the proposed AUD scheme outperforms the conventional approaches in both AUD success probability and throughput performance.1 Introduction 2 Grant-free Non-orthogonal Multiple Access 2.1 AUD System Model 2.2 Conventional AUD 3 Support Function Approximation via DNN 3.1 Network Description 3.2 Training Issue in DSDNN 4 Simulations and Discussions 4.1 Simulation Setup 4.2 Simulation Results 5 ConclusionMaste

    A NOMA-enhanced reconfigurable access scheme with device pairing for M2M networks

    Get PDF
    This paper aims to address the distinct requirements of machine-to-machine networks, particularly heterogeneity and massive transmissions. To this end, a reconfigurable medium access control (MAC) with the ability to choose a proper access scheme with the optimal configuration for devices based on the network status is proposed. In this scheme, in each frame, a separate time duration is allocated for each of the nonorthogonal multiple access (NOMA)-based, orthogonal multiple access (OMA)-based, and random access-based segments, where the length of each segment can be optimized. To solve this optimization problem, an iterative algorithm consisting of two sub-problems is proposed. The first sub-problem deals with selecting devices for the NOMA/OMA-based transmissions, while the second one optimizes the parameter of the random access scheme. To show the efficacy of the proposed scheme, the results are compared with the reconfigurable scheme which does not support NOMA. The results demonstrate that by using a proper device pairing scheme for the NOMA-based transmissions, the proposed reconfigurable scheme achieves better performance when NOMA is adopted

    Convolutional Sparse Support Estimator Network (CSEN) From energy efficient support estimation to learning-aided Compressive Sensing

    Get PDF
    Support estimation (SE) of a sparse signal refers to finding the location indices of the non-zero elements in a sparse representation. Most of the traditional approaches dealing with SE problem are iterative algorithms based on greedy methods or optimization techniques. Indeed, a vast majority of them use sparse signal recovery techniques to obtain support sets instead of directly mapping the non-zero locations from denser measurements (e.g., Compressively Sensed Measurements). This study proposes a novel approach for learning such a mapping from a training set. To accomplish this objective, the Convolutional Support Estimator Networks (CSENs), each with a compact configuration, are designed. The proposed CSEN can be a crucial tool for the following scenarios: (i) Real-time and low-cost support estimation can be applied in any mobile and low-power edge device for anomaly localization, simultaneous face recognition, etc. (ii) CSEN's output can directly be used as "prior information" which improves the performance of sparse signal recovery algorithms. The results over the benchmark datasets show that state-of-the-art performance levels can be achieved by the proposed approach with a significantly reduced computational complexity
    corecore