Frequency Domain Backoff for Continuous Beamforming Space Division Multiple Access on Massive MIMO Wireless Backhaul Systems

This paper newly proposes a frequency domain backoff scheme dedicated to continuous beamforming space division multiple access (CB-SDMA) on massive antenna systems for wireless entrance (MAS-WE). The entrance base station (EBS) has individual base band signal processing units for respective relay stations (RSs) to be accommodated. EBS then continuously applies beamforming weight to transmission/reception signals. CB-SDMA yields virtual point-to-point backhaul link where radio resource control messages and complicated multiuser scheduling are not required. This simplified structure allows RSs to work in a distributed manner. However, one issue remains to be resolved; overloaded multiple access resulting in collision due to its random access nature. The frequency domain backoff mechanism is introduced instead of the time domain one. It can flexibly avoid co-channel interference caused by excessive spatial multiplexing. Computer simulation verifies its superiority in terms of system throughput and packet delay

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