15,699 research outputs found

    On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels

    Get PDF
    This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available at the transmitter. Using the maximum likelihood (ML) principle, and assuming perfect knowledge of the channel mean, we derive the optimal multiple symbol detection (MSD) rule for diagonal differential unitary space-time modulation (DUSTM). This rule is used to develop a sphere decoding bound intersection detector (SD-BID) with low complexity. A suboptimal MSD based decision feedback DD (DF-DD) algorithm is also derived. The simulation results show that our proposed MSD algorithms reduce the error floor of conventional differential detection and that the computational complexity of these new algorithms is reasonably low

    On the capacity of MIMO broadcast channels with partial side information

    Get PDF
    In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with M transmit antennas and n single-antenna users, the sum rate capacity scales like Mloglogn for large n if perfect channel state information (CSI) is available at the transmitter, yet only logarithmically with M if it is not. In systems with large n, obtaining full CSI from all users may not be feasible. Since lack of CSI does not lead to multiuser gains, it is therefore of interest to investigate transmission schemes that employ only partial CSI. We propose a scheme that constructs M random beams and that transmits information to the users with the highest signal-to-noise-plus-interference ratios (SINRs), which can be made available to the transmitter with very little feedback. For fixed M and n increasing, the throughput of our scheme scales as MloglognN, where N is the number of receive antennas of each user. This is precisely the same scaling obtained with perfect CSI using dirty paper coding. We furthermore show that a linear increase in throughput with M can be obtained provided that M does not not grow faster than logn. We also study the fairness of our scheduling in a heterogeneous network and show that, when M is large enough, the system becomes interference dominated and the probability of transmitting to any user converges to 1/n, irrespective of its path loss. In fact, using M=αlogn transmit antennas emerges as a desirable operating point, both in terms of providing linear scaling of the throughput with M as well as in guaranteeing fairness

    On X-Channels with Feedback and Delayed CSI

    Full text link
    The sum degrees of freedom (DoF) of the two-user MIMO X-channel is characterized in the presence of output feedback and delayed channel state information (CSI). The number of antennas at each transmitters is assumed to be M and the number of antennas at each of the receivers is assumed to be N. It is shown that the sum DoF of the two-user MIMO X-channel is the same as the sum DoF of a two-user MIMO broadcast channel with 2M transmit antennas, and N antennas at each receiver. Hence, for this symmetric antenna configuration, there is no performance loss in the sum degrees of freedom due to the distributed nature of the transmitters. This result highlights the usefulness of feedback and delayed CSI for the MIMO X-channel. The K-user X-channel with single antenna at each transmitter and each receiver is also studied. In this network, each transmitter has a message intended for each receiver. For this network, it is shown that the sum DoF with partial output feedback alone is at least 2K/(K+1). This lower bound is strictly better than the best lower bound known for the case of delayed CSI assumption for all values of K.Comment: Submitted to IEEE ISIT 2012 on Jan 22, 201

    Fundamental Limits in MIMO Broadcast Channels

    Get PDF
    This paper studies the fundamental limits of MIMO broadcast channels from a high level, determining the sum-rate capacity of the system as a function of system paramaters, such as the number of transmit antennas, the number of users, the number of receive antennas, and the total transmit power. The crucial role of channel state information at the transmitter is emphasized, as well as the emergence of opportunistic transmission schemes. The effects of channel estimation errors, training, and spatial correlation are studied, as well as issues related to fairness, delay and differentiated rate scheduling

    ON THE DEGREES OF FREEDOM OF THE RELAY X-CHANNEL

    Get PDF
    Interference is a principal source of capacity limitations in today's multi-access multi-user wireless systems. Despite the fact that the capacity of interference channels is still an unsolved problem, the research community has already established a substantial work towards this goal. In effort to provide alternative attainable expressions for performance limits in interference channels, the concept of the Degrees of Freedom (DoF) has been introduced. DoF describes network capacity in terms of the number of maximum possible simultaneous interference-free streams. X-channel is defined where there are two transmitters, two receivers and each transmitter has an independent message for each receiver. Interference channel, broadcast channel and the multiple access channels are special cases of the X-channel. In this thesis, we further investigate the effect of a relay on the DoF of a single input single output (SISO) X-channel with no channel state information at transmitters (CSIT). In contrast to previous work, which has focused on two antennas at the relay to achieve the optimal 4/3 DoF, we focus on the case of a single antenna half duplex relay. We show that with a single antenna relay and delayed output feedback, the upper bound of 4/3 DoF for the X-channel is achievable and we provide the achievability scheme. We revisit the previously studied case of single antenna relay in the more practical setting of alternating CSIT. We show that the optimal 4/3 DoF achievability does not mandate full CSIT availability. For the case of partial alternating CSIT availability at the relay transmitters, we propose a scheme that can achieve the optimal 4/3 DoF and we deduce the minimum CSIT availability for the proposed scheme to achieve optimality
    corecore