Performance evaluation and implementation complexity analysis framework for ZF based linear massive MIMO detection

This paper discusses a framework for algorithm-architecture synergy for (1) performance evaluation and (2) FPGA implementation complexity analysis of linear massive MIMO detection techniques. Three low complexity implementation techniques of the zero-forcing (ZF) based linear detection are evaluated, namely, Neumann series expansion (NSE), Gauss–Seidel (GS) and a proposed recursive Gram matrix inversion update (RGMIU) techniques. The performance analysis framework is based on software-defined radio platform. By extrapolating the real data measured average error vector magnitude versus a number of served single-antenna user terminals, GS and RGMIU are showing no performance degradation with respect to ZF with direct matrix inversion. It is shown that under high load regime NSE and GS require more processing iterations at the expense of increased processing latency. We, therefore, consider a unified approach for field-programmable gate array based implementation complexity analysis and discuss the required baseband processing resources for real-time transmission. Due to the wide differences of NSE, GS and RGMIU in terms of performance, processing complexity and latency, practical deployment and real-time implementation insights are derived

A Transmission Scheduling Protocol Using Radios With Multiple Antennas For Ad Hoc Networks

Distributed medium access control (MAC) protocols are essential due to the flexible and self-organizing nature of ad hoc networks. Scheduling protocols have been popular choices, because they guarantee access to the channel for each transceiver. The disadvantage with these scheduled approaches is that they are inefficient when the network has low traffic loads. Consider a time-division multiple access (TDMA) schedule where nodes are assigned time slots in which they are allowed to transmit. If a particular node is scheduled but has no traffic to forward, then the time slot is wasted. Because the channel has been reserved for use by that particular node, other nodes in the network with traffic to forward are unable to do so. We investigate strategies to improve the performance of TDMA scheduling protocols for ad hoc networks using radios with multiple antennas. Multiple antennas at each radio enables the use of a physical layer technique known as multiple-input multiple-output (MIMO) that leverages the spatial dimension. The antennas allow for both spatial multiplexing and interference cancellation. Spatial multiplexing allows for multiple parallel data streams to be transmitted at the same time. Interference cancellation is used to selectively pick neighbors that do not receive interference from a transmission. Our protocol uses both techniques to allow unscheduled nodes to transmit if the slot is not fully utilized. Using a custom simulation, we show that Lyui\u27s scheduling protocol can be extended to support MIMO and time slot sharing. Our new protocol provides performance improvements with regards to end-to-end completion, throughput, and average delay