On the Performance of MIMO-ARQ Systems with Channel State Information at the Receiver

This paper investigates the performance of multiple-input-multiple-output (MIMO) systems in the presence of automatic repeat request (ARQ) feedback. We show that, for a large range of performance metrics, the data transmission efficiency of the ARQ schemes is determined by a set of parameters which are scheme-dependent and not metric-dependent. Then, the results are used to study different aspects of MIMO-ARQ such as the effect of nonlinear power amplifiers, large-scale MIMO-ARQ, adaptive power allocation and different data communication models. The results, which are valid for various forward and feedback channel models, show the efficiency of the MIMO-ARQ techniques in different conditions

On an HARQ-based Coordinated Multi-point Network using Dynamic Point Selection

This paper investigates the performance of coordinated multi-point (CoMP) networks in the presence of hybrid automatic repeat request (HARQ) feedback. With an information theoretic point of view, the throughput and the outage probability of different HARQ protocols are studied for slow-fading channels. The results are compared with the ones obtained in the presence of repetition codes and basic HARQ, or when there is no channel state information available at the base stations. The analytical and numerical results demonstrate the efficiency of the CoMP-HARQ techniques in different conditions

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

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