55 research outputs found

    Simultaneous Estimation of Multi-Relay MIMO Channels

    Get PDF
    This paper addresses training-based channel estimation in distributed amplify-and-forward (AF) multi-input multi-output (MIMO) multi-relay networks. To reduce channel estimation overhead and delay, a training algorithm that allows for simultaneous estimation of the entire MIMO cooperative network’s channel parameters at the destination node is proposed. The exact Cram´er- Rao lower bound (CRLB) for the problem is presented in closedform. Channel estimators that are capable of estimating the overall source-relay-destination channel parameters at the destination are also derived. Numerical results show that while reducing delay, the proposed channel estimators are close to the derived CRLB over a wide range of signal-to-noise ratio values and outperform existing channel estimation methods. Finally, extensive simulations demonstrate that the proposed training method and channel estimators can be effectively deployed in combination with cooperative optimization algorithms to significantly enhance the performance of AF relaying MIMO systems in terms of average-bit-error-rate

    Quasi-Synchronous Random Access for Massive MIMO-Based LEO Satellite Constellations

    Full text link
    Low earth orbit (LEO) satellite constellation-enabled communication networks are expected to be an important part of many Internet of Things (IoT) deployments due to their unique advantage of providing seamless global coverage. In this paper, we investigate the random access problem in massive multiple-input multiple-output-based LEO satellite systems, where the multi-satellite cooperative processing mechanism is considered. Specifically, at edge satellite nodes, we conceive a training sequence padded multi-carrier system to overcome the issue of imperfect synchronization, where the training sequence is utilized to detect the devices' activity and estimate their channels. Considering the inherent sparsity of terrestrial-satellite links and the sporadic traffic feature of IoT terminals, we utilize the orthogonal approximate message passing-multiple measurement vector algorithm to estimate the delay coefficients and user terminal activity. To further utilize the structure of the receive array, a two-dimensional estimation of signal parameters via rotational invariance technique is performed for enhancing channel estimation. Finally, at the central server node, we propose a majority voting scheme to enhance activity detection by aggregating backhaul information from multiple satellites. Moreover, multi-satellite cooperative linear data detection and multi-satellite cooperative Bayesian dequantization data detection are proposed to cope with perfect and quantized backhaul, respectively. Simulation results verify the effectiveness of our proposed schemes in terms of channel estimation, activity detection, and data detection for quasi-synchronous random access in satellite systems.Comment: 38 pages, 16 figures. This paper has been accepted by IEEE JSAC SI on 3GPP Technologies: 5G-Advanced and Beyond. Copyright may be transferred without notice, after which this version may no longer be accessibl

    K

    No full text

    DSTBC based DF cooperative networks in the presence of timing and frequency offsets

    No full text
    In decode-and-forward (DF) relaying networks, the received signal at the destination may be affected by multiple impairments such as multiple channel gains, multiple timing offsets (MTOs), and multiple carrier frequency offsets (MCFOs). This paper proposes novel optimal and sub-optimal minimum mean-square error (MMSE) receiver designs at the destination node to detect the signal in the presence of these impairments. Distributed space-time block codes (DSTBCs) are used at the relays to achieve spatial diversity. The proposed sub-optimal receiver uses the estimated values of multiple channel gains, MTOs, and MCFOs, while the optimal receiver assumes perfect knowledge of these impairments at the destination and serves as a benchmark performance measure. To achieve robustness to estimation errors, the estimates statistical properties are exploited at the destination. Simulation results show that the proposed optimal and sub-optimal MMSE compensation receivers achieve full diversity gain in the presence of channel and synchronization impairments in DSTBC based DF cooperative networks

    Throughput Enhancement in FD- and SWIPT-enabled IoT Networks over Non-Identical Rayleigh Fading Channel

    Get PDF
    Simultaneous wireless information and power transfer (SWIPT) and full-duplex (FD) communications have emerged as prominent technologies in overcoming the limited energy resources in Internet-of-Things (IoT) networks and improving their spectral efficiency (SE). The article investigates the outage and throughput performance for a decode-and-forward (DF) relay SWIPT system, which consists of one source, multiple relays, and one destination. The relay nodes in this system can harvest energy from the source’s signal and operate in FD mode. A suboptimal, low-complexity, yet efficient relay selection scheme is also proposed. Specifically, a single relay is selected to convey information from a source to a destination so that it achieves the best channel from the source to the relays. An analysis of outage probability (OP) and throughput performed on two relaying strategies, termed static power splitting-based relaying (SPSR) and optimal dynamic power splitting-based relaying (ODPSR), is presented. Notably, we considered independent and non-identically distributed (i.n.i.d.) Rayleigh fading channels, which pose new challenges in obtaining analytical expressions. In this context, we derived exact closed-form expressions of the OP and throughput of both SPSR and ODPSR schemes. We also obtained the optimal power splitting ratio of ODPSR for maximizing the achievable capacity at the destination. Finally, we present extensive numerical and simulation results to confirm our analytical findings. Both simulation and analytical results show the superiority of ODPSR over SPSR

    Transceiver design for distributed STBC based AF cooperative networks in the presence of timing and frequency offsets

    No full text
    In multi-relay cooperative systems, the signal at the destination is affected by impairments such as multiple channel gains, multiple timing offsets (MTOs), and multiple carrier frequency offsets (MCFOs). In this paper we account for all these impairments and propose a new transceiver structure at the relays and a novel receiver design at the destination in distributed space-time block code (DSTBC) based amplify-and-forward (AF) cooperative networks. The Cramér-Rao lower bounds and a least squares (LS) estimator for the multi-parameter estimation problem are derived. In order to significantly reduce the receiver complexity at the destination, a differential evolution (DE) based estimation algorithm is applied and the initialization and constraints for the convergence of the proposed DE algorithm are investigated. In order to detect the signal from multiple relays in the presence of unknown channels, MTOs, and MCFOs, novel optimal and sub-optimal minimum mean-square error receiver designs at the destination node are proposed. Simulation results show that the proposed estimation and compensation methods achieve full diversity gain in the presence of channel and synchronization impairments in multi-relay AF cooperative networks

    Multi-cell interference coordination for multigroup multicast transmission

    No full text
    Abstract Multicasting has become a particularly important technique in the context of cache-enabled cloud radio access networks proposed for 5G systems, where it can be used to transmit common information to multiple users to improve both spectral and energy efficiency. For the efficient spectrum utilization, the future communications are based on aggressive frequency reuse, where the required data rates can be achieved with multiple-input multiple-output precoding techniques. This approach, however, calls for advanced interference coordination techniques. This paper summarizes some of the core approaches proposed in the literature and discusses the main future challenges

    Distributed optimization for coordinated beamforming in multicell multigroup multicast systems:power minimization and SINR balancing

    No full text
    Abstract This paper considers coordinated multicast beamforming in a multicell multigroup multiple-input single-output system. Each base station (BS) serves multiple groups of users by forming a single beam with common information per group. We propose centralized and distributed beamforming algorithms for two different optimization targets. The first objective is to minimize the total transmission power of all the BSs while guaranteeing the user-specific minimum quality-of-service targets. The semidefinite relaxation (SDR) method is used to approximate the nonconvex multicast problem as a semidefinite program (SDP), which is solvable via centralized processing. Subsequently, two alternative distributed methods are proposed. The first approach turns the SDP into a two-level optimization via primal decomposition. At the higher level, intercell interference powers are optimized for fixed beamformers, whereas the lower level locally optimizes the beamformers by minimizing BS-specific transmit powers for the given intercell interference constraints. The second distributed solution is enabled via an alternating direction method of multipliers, where the intercell interference optimization is divided into a local and a global optimization by forcing the equality via consistency constraints. We further propose a centralized and a simple distributed beamforming design for the signal-to-interference-plus-noise ratio (SINR) balancing problem in which the minimum SINR among the users is maximized with given per-BS power constraints. This problem is solved via the bisection method as a series of SDP feasibility problems. The simulation results show the superiority of the proposed coordinated beamforming algorithms over traditional noncoordinated transmission schemes, and illustrate the fast convergence of the distributed methods
    corecore