66 research outputs found

    A Low Complexity Pilot Scheduling Algorithm for Massive MIMO

    Get PDF
    Pilot contamination is a fundamental bottleneck in massive multiple-input multiple-output (MIMO) cellular networks. In this letter, we aim to design a pilot scheduling method to reduce the effect of pilot contamination in multi-user multi-cell massive MIMO systems. Mathematically, the pilot scheduling problem can be formulated as a permutation-based optimization problem. However, finding the optimal solution requires an exhaustive search and is computationally prohibitive. Therefore, we propose a low-complexity near-optimal algorithm developed from the cross-entropy optimization framework to solve this problem. Simulation results reveal that our algorithm not only significantly outperforms the existing pilot-scheduling schemes but also achieves excellent performance with low complexity

    Joint Pilot Design and Uplink Power Allocation in Multi-Cell Massive MIMO Systems

    Full text link
    This paper considers pilot design to mitigate pilot contamination and provide good service for everyone in multi-cell Massive multiple input multiple output (MIMO) systems. Instead of modeling the pilot design as a combinatorial assignment problem, as in prior works, we express the pilot signals using a pilot basis and treat the associated power coefficients as continuous optimization variables. We compute a lower bound on the uplink capacity for Rayleigh fading channels with maximum ratio detection that applies with arbitrary pilot signals. We further formulate the max-min fairness problem under power budget constraints, with the pilot signals and data powers as optimization variables. Because this optimization problem is non-deterministic polynomial-time hard due to signomial constraints, we then propose an algorithm to obtain a local optimum with polynomial complexity. Our framework serves as a benchmark for pilot design in scenarios with either ideal or non-ideal hardware. Numerical results manifest that the proposed optimization algorithms are close to the optimal solution obtained by exhaustive search for different pilot assignments and the new pilot structure and optimization bring large gains over the state-of-the-art suboptimal pilot design.Comment: 16 pages, 8 figures. Accepted to publish at IEEE Transactions on Wireless Communication

    Network efficiency enhancement by reactive channel state based allocation scheme

    Get PDF
    Now a day the large MIMO has considered as the efficient approach to improve the spectral and energy efficiency at WMN. However, the PC is a big issue that caused by reusing similar pilot sequence at cells, which also restrict the performance of massive MIMO network. Here, we give the alternative answer, where each of UEs required allotting a channel sequences before passing the payload data, so as to avoid the channel collision of inter-cell. Our proposed protocol will ready to determine the channel collisions in distributed and scalable process, however giving unique properties of the large MIMO channels. Here we have proposed a RCSA (Reactive channel state based allocation) scheme, which will very productively work with the RAP blockers at large network of MIMO. The position of time-frequency of RAP blocks is modified in the middle of the adjacent cells, because of this design decision the RAP defend from the hardest types of interference at inter-cell. Further, to validate the performance of our proposed scheme it will be compared with other existing technique

    Downlink Massive MIMO Systems: Reduction of Pilot Contamination for Channel Estimation with Perfect Knowledge of Large-Scale Fading

    Get PDF
    Massive multiple-input multiple-output (MIMO) technology is considered crucial for the development of future fifth-generation (5G) systems. However, a limitation of massive MIMO systems arises from the lack of orthogonality in the pilot sequences transmitted by users from a single cell to neighboring cells. To address this constraint, a proposed solution involves utilizing orthogonal pilot reuse sequences (PRS) and zero forced (ZF) pre-coding techniques. The primary objective of these techniques is to eradicate channel interference and improve the experience of end users who are afflicted by low-quality channels. The assessment of the channel involves evaluating its quality through channel assessment, conducting comprehensive evaluations of large-scale shutdowns, and analyzing the maximum transmission efficiency. By assigning PRS to a group of users, the proposed approach establishes lower bounds for the achievable downlink data rate (DR) and signal-to-interference noise ratio (SINR). These bounds are derived by considering the number of antennas approaches infinity which helps mitigate interference. Simulation results demonstrate that the utilization of improved channel evaluation and reduced loss leads to higher DR. When comparing different precoding techniques, the ZF method outperforms maximum ratio transmission (MRT) precoders in achieving a higher DR, particularly when the number of cells reaches . &nbsp

    Joint Power Allocation and User Association Optimization for Massive MIMO Systems

    Full text link
    This paper investigates the joint power allocation and user association problem in multi-cell Massive MIMO (multiple-input multiple-output) downlink (DL) systems. The target is to minimize the total transmit power consumption when each user is served by an optimized subset of the base stations (BSs), using non-coherent joint transmission. We first derive a lower bound on the ergodic spectral efficiency (SE), which is applicable for any channel distribution and precoding scheme. Closed-form expressions are obtained for Rayleigh fading channels with either maximum ratio transmission (MRT) or zero forcing (ZF) precoding. From these bounds, we further formulate the DL power minimization problems with fixed SE constraints for the users. These problems are proved to be solvable as linear programs, giving the optimal power allocation and BS-user association with low complexity. Furthermore, we formulate a max-min fairness problem which maximizes the worst SE among the users, and we show that it can be solved as a quasi-linear program. Simulations manifest that the proposed methods provide good SE for the users using less transmit power than in small-scale systems and the optimal user association can effectively balance the load between BSs when needed. Even though our framework allows the joint transmission from multiple BSs, there is an overwhelming probability that only one BS is associated with each user at the optimal solution.Comment: 16 pages, 12 figures, Accepted by IEEE Trans. Wireless Commu
    corecore