363 research outputs found

    Linear Precoding in Cooperative MIMO Cellular Networks with Limited Coordination Clusters

    Full text link
    In a cooperative multiple-antenna downlink cellular network, maximization of a concave function of user rates is considered. A new linear precoding technique called soft interference nulling (SIN) is proposed, which performs at least as well as zero-forcing (ZF) beamforming. All base stations share channel state information, but each user's message is only routed to those that participate in the user's coordination cluster. SIN precoding is particularly useful when clusters of limited sizes overlap in the network, in which case traditional techniques such as dirty paper coding or ZF do not directly apply. The SIN precoder is computed by solving a sequence of convex optimization problems. SIN under partial network coordination can outperform ZF under full network coordination at moderate SNRs. Under overlapping coordination clusters, SIN precoding achieves considerably higher throughput compared to myopic ZF, especially when the clusters are large.Comment: 13 pages, 5 figure

    Cooperative Multi-Cell Block Diagonalization with Per-Base-Station Power Constraints

    Full text link
    Block diagonalization (BD) is a practical linear precoding technique that eliminates the inter-user interference in downlink multiuser multiple-input multiple-output (MIMO) systems. In this paper, we apply BD to the downlink transmission in a cooperative multi-cell MIMO system, where the signals from different base stations (BSs) to all the mobile stations (MSs) are jointly designed with the perfect knowledge of the downlink channels and transmit messages. Specifically, we study the optimal BD precoder design to maximize the weighted sum-rate of all the MSs subject to a set of per-BS power constraints. This design problem is formulated in an auxiliary MIMO broadcast channel (BC) with a set of transmit power constraints corresponding to those for individual BSs in the multi-cell system. By applying convex optimization techniques, this paper develops an efficient algorithm to solve this problem, and derives the closed-form expression for the optimal BD precoding matrix. It is revealed that the optimal BD precoding vectors for each MS in the per-BS power constraint case are in general non-orthogonal, which differs from the conventional orthogonal BD precoder design for the MIMO-BC under one single sum-power constraint. Moreover, for the special case of single-antenna BSs and MSs, the proposed solution reduces to the optimal zero-forcing beamforming (ZF-BF) precoder design for the weighted sum-rate maximization in the multiple-input single-output (MISO) BC with per-antenna power constraints. Suboptimal and low-complexity BD/ZF-BF precoding schemes are also presented, and their achievable rates are compared against those with the optimal schemes.Comment: accepted in JSAC, special issue on cooperative communications on cellular networks, June 201

    Distributed Linear Precoding and User Selection in Coordinated Multicell Systems

    Full text link
    In this manuscript we tackle the problem of semi-distributed user selection with distributed linear precoding for sum rate maximization in multiuser multicell systems. A set of adjacent base stations (BS) form a cluster in order to perform coordinated transmission to cell-edge users, and coordination is carried out through a central processing unit (CU). However, the message exchange between BSs and the CU is limited to scheduling control signaling and no user data or channel state information (CSI) exchange is allowed. In the considered multicell coordinated approach, each BS has its own set of cell-edge users and transmits only to one intended user while interference to non-intended users at other BSs is suppressed by signal steering (precoding). We use two distributed linear precoding schemes, Distributed Zero Forcing (DZF) and Distributed Virtual Signal-to-Interference-plus-Noise Ratio (DVSINR). Considering multiple users per cell and the backhaul limitations, the BSs rely on local CSI to solve the user selection problem. First we investigate how the signal-to-noise-ratio (SNR) regime and the number of antennas at the BSs affect the effective channel gain (the magnitude of the channels after precoding) and its relationship with multiuser diversity. Considering that user selection must be based on the type of implemented precoding, we develop metrics of compatibility (estimations of the effective channel gains) that can be computed from local CSI at each BS and reported to the CU for scheduling decisions. Based on such metrics, we design user selection algorithms that can find a set of users that potentially maximizes the sum rate. Numerical results show the effectiveness of the proposed metrics and algorithms for different configurations of users and antennas at the base stations.Comment: 12 pages, 6 figure

    On the Throughput of Large-but-Finite MIMO Networks using Schedulers

    Full text link
    This paper studies the sum throughput of the {multi-user} multiple-input-single-output (MISO) networks in the cases with large but finite number of transmit antennas and users. Considering continuous and bursty communication scenarios with different users' data request probabilities, we derive quasi-closed-form expressions for the maximum achievable throughput of the networks using optimal schedulers. The results are obtained in various cases with different levels of interference cancellation. Also, we develop an efficient scheduling scheme using genetic algorithms (GAs), and evaluate the effect of different parameters, such as channel/precoding models, number of antennas/users, scheduling costs and power amplifiers' efficiency, on the system performance. Finally, we use the recent results on the achievable rates of finite block-length codes to analyze the system performance in the cases with short packets. As demonstrated, the proposed GA-based scheduler reaches (almost) the same throughput as in the exhaustive search-based optimal scheduler, with substantially less implementation complexity. Moreover, the power amplifiers' inefficiency and the scheduling delay affect the performance of the scheduling-based systems significantly
    corecore