218 research outputs found

    A new high-rate differential space-time block coding scheme

    Full text link

    Training-based channel estimation for multiple-antenna broadband transmissions

    Full text link

    A space-time block-coded OFDM scheme for unknown frequency-selective fading channels

    Full text link

    Sparse Equalizers for OFDM Signals with Insufficient Cyclic Prefix

    Get PDF
    The cyclic prefix (CP) is appended in orthogonal frequency division multiplexing (OFDM) signals to combat inter-symbol interference (ISI) and inter-carrier interference (ICI) induced by the communication channel, which limits its spectral efficiency. Therefore, inserting an insufficient CP and equalizing the resulting ICI and ISI is a method that has been circulating the literature for a while, aiming at increasing the efficiency of OFDM systems. In this paper, we propose a reduced-complexity sparse linear equalizer and a decision-feedback equalizer for OFDM signals with insufficient CP. A performance-complexity trade-off is highlighted, where we show that it is possible to equalize the received signal with a reduced complexity equalizer while having a limited performance loss. Our proposed equalizer designs are not only less complex to realize, but are shown to provide a higher data rate. The proposed equalizers are further evaluated in terms of the worst-case coherence, a metric determining the effectiveness of our used approach. Numerical results show that we can significantly and reliably reduce the order of the design complexity while performing very close to the conventional complex optimal equalizers. 2013 IEEE.This work was supported by GSRA from the Qatar National Research Fund (a member of Qatar Foundation) under Grant 2-1-0601-14011. The statements made herein are solely the responsibility of the authors.Scopu

    Sparsity-aware multiple relay selection in large multi-hop decode-and-forward relay networks

    Get PDF
    In this paper, we propose and investigate two novel techniques to perform multiple relay selection in large multi-hop decode-and-forward relay networks. The two proposed techniques exploit sparse signal recovery theory to select multiple relays using the orthogonal matching pursuit algorithm and outperform state-of-the-art techniques in terms of outage probability and computation complexity. To reduce the amount of collected channel state information (CSI), we propose a limited-feedback scheme where only a limited number of relays feedback their CSI. Furthermore, a detailed performance-complexity tradeoff investigation is conducted for the different studied techniques and verified by Monte Carlo simulations.NPRP grant 6-070-2-024 from the Qatar National Research Fund (a member of Qatar Foundation)Scopu

    QoS-Aware Precoder Optimization for Radar Sensing and Multiuser Communications Under Per-Antenna Power Constraints

    Get PDF
    In this work, we concentrate on designing the precoder for the multiple-input multiple-output (MIMO) dual functional radar-communication (DFRC) system, where the dual-functional waveform is designed for performing multiuser downlink transmission and radar sensing simultaneously. Specifically, considering the signal-independent interference and signal-dependent clutter, we investigate the optimization of transmit precoding for maximizing the sensing signal-to-interference-plus-noise ratio (SINR) at the radar receiver under the constraint of the minimum SINR received at multiple communication users and per-antenna power budget. The formulated problem is challenging to solve due to the nonconovex objective function and nonconvex per-antenna power constraint. In particular, for the signal-independent interference case, we propose a distance-majorization induced algorithm to approximate the nonconvex problem as a sequence of convex problems whose optima can be obtained in closed form. Subsequently, our complexity analysis shows that our proposed algorithm has a much lower computational complexity than the widely-adopted semidefinite relaxation (SDR)-based algorithm. For the signal-dependent clutter case, we employ the fractional programming to transform the nonconvex problem into a sequence of subproblems, and then we propose a distance-majorization based algorithm to obtain the solution of each subproblem in closed form. Finally, simulation results confirm the performance superiority of our proposed algorithms when compared with the SDR-based approach. In conclusion, the novelty of this work is to propose an efficient algorithm for handling the typical problem in designing the DFRC precoder, which achieves better performance with a much lower complexity than the state-of-the-art algorithm

    A Novel Knowledge Graph Driven Automatic Modulation Classification Framework for 6G Wireless Communications

    Get PDF
    Automatic modulation classification (AMC) is a promising technology to realize intelligent wireless communications in the sixth-generation (6G) wireless communication networks. Recently, many data-and-knowledge dual-driven schemes have achieved high accuracy in AMC. However, most of these schemes focus on generating additional prior knowledge of blind signals, which needs more computation cost in the inference phase. To solve these problems, we propose for the first time a modulation knowledge graph (MKG), and a novel knowledge graph (KG) driven AMC (KGAMC) framework by training the networks under the guidance of MKG domain knowledge. To achieve the best performance by exploiting KGAMC, a KG-driven multi-time-scale network (KG-MTSNet) is proposed to extract the MKG knowledge and the scale and frequency features of the sampled signals. Moreover, to utilize the knowledge, a designed feature aggregation loss is implemented to improve the signal feature presentation obtained by the data-driven model. Simulation results demonstrate that KGAMC significantly boosts the performances of data-driven models, and the KG-MTSNet achieves a superior classification performance compared to other benchmarks. Furthermore, the effectiveness of KGAMC is demonstrated in terms of the interpretability of the feature extraction and the sample shortage situation

    A Novel PODMAI Framework Enhanced by User Demand Prediction for Resource Allocation in Spectrum Sharing UAV Networks

    Get PDF
    Spectrum sharing unmanned aerial vehicle (UAV) network is a promising technology for future communication systems to mitigate the spectrum scarcity problem. However, the future sixth-generation large-scale wireless communication networks are expected not only to provide a high data rate for massive numbers of users but also to meet their stringent service requirements. Particularly in dynamic spectrum sharing UAV networks, the coupling of multi-dimensional resources and diverse user demands make the efficient and real-time resource allocation exceptionally challenging. A partially observable deep multi-agent active inference (PODMAI) framework is proposed to tackle these issues. The variational free energy is minimized to update the policy exploiting the belief based learning method. A decentralized training and execution multi-agent strategy is designed to navigate the challenges posed by partially observable information. To further satisfy the dynamic user demand and supplement partial observations, a joint spatial-temporal-attention prediction network is designed to construct the demand prediction enhanced PODMAI framework for resource allocation. Exploiting the established framework, an intelligent spectrum allocation and trajectory optimization scheme is elaborated for a spectrum sharing UAV network with multi-modal dynamic transmission rate demands. Simulation results demonstrate that our proposed scheme outperforms benchmark schemes in terms of the network sum transmission rate. Additionally, our proposed scheme exhibits faster convergence compared to the conventional reinforcement learning. Overall, our proposed framework can enrich intelligent resource allocation frameworks and pave the way for realizing real-time resource allocation

    Scalable Robust Beamforming for Multi-Layer Refracting RIS-Assisted HAP-SWIPT Networks

    Get PDF
    To mitigate the severe large-scale fading and the energy scarcity problem in long-distance high-altitude platform (HAP) networks, in this paper, we investigate the potentials of a multi-layer refracting reconfigurable intelligent surface (RIS) -assisted receiver for enabling simultaneous wireless information and power transfer (SWIPT) in HAP networks. Unlike the existing RIS-aided reflector and transmitter, the multi-layer RIS-receiver can well overcome the severe 'double fading' effect induced by the extreme long-distance HAP links and fully exploit RIS's degrees-of-freedom (DoFs) for SWIPT design. Building on the proposed RIS-receiver, this paper formulates a worst-case sum rate maximization problem under angular channel state information (CSI) imperfection, while satisfying the information rate requirements of the earth stations (ESs) and the harvested energy constraint. To handle the intractable non-convex problem, a scalable robust optimization framework utilizing the discretization method, LogSumExp-dual scheme, and modified cyclic coordinate descent (M-CCD) is proposed to obtain the semi-closed-form solutions. Numerical simulations demonstrate that the proposed architecture and optimization framework achieve superior performance with lower complexity compared with state-of-the-art schemes in HAP networks
    corecore