Parallel low-complexity MIMO detection algorithm using QR decomposition and Alamouti space-time code

Fourth generation (4G) and beyond-4G wireless standards must support sub-1Gbps data rates with peak bandwidth efficiencies of up to 30 bit/s/Hz. It is widely recognized that the use of multiple antennas on both ends of the wireless link, commonly referred to as MIMO, is the technology that will make this a reality. The problem is that most existing MIMO algorithms are either too complex to be able to support such rates or do not lend themselves to a parallel implementation, a must-have feature that will enable the use of low-power multi-core processors. In this paper we propose a parallel architecture and associated algorithm that has reasonable complexity. Most importantly, the algorithm possesses a performance-on-demand feature that allows for complexity, performance and power consumption to be traded off on a packet-by-packet basis.