Abstract

Multiple-input multiple-output (MIMO) technology is envisaged to play an important role in future wireless communications. To this end, novel algorithms and architectures are required to implement high-throughput MIMO communications at low power consumption. In this paper, we present the hardware implementation of a modified K-best algorithm combining conventional K-best detection and low-complexity successive interference cancellation at different levels of the tree search. The detector is implemented using a fully-pipelined architecture, which detects one symbol vector per clock cycle. To reduce the power consumption of the entire receiver unit, costly symbol-rate operations such as multiplication are eliminated both within and outside the detector without any impact on the performance. The hardware implementation of the modified K-best algorithm achieves area and power reductions of 16% and 38%, respectively, compared with the conventional K-best algorithm implementation, while incurring a signal-to-noise ratio penalty of 0.3 dB at the target bit error rate. Post-synthesis analysis shows that the detector achieves a throughput of 3.29 Gbps at a clock frequency of 137 MHz with a power consumption of 357 mW using a 65-nm CMOS process, which compares favourably with the state-of-the-art implementations in the literature.

Highlights

  • The user demand for high-throughput wireless communications has been growing considerably in recent years

  • Using a 64-QAM 4 × 4 multiple-input multiple-output (MIMO) system, and based on the modified K -best algorithm, our results show that pipelining can achieve a throughput advantage of approximately 13× compared with interleaving per unit area

  • To ensure a fair comparison with other works, the power consumption (P) is scaled to a common technology reference of 65-nm at a core voltage of 1.05 V according to 1/U 2, while the throughput (Φ) is scaled according to S, where U is the ratio of the voltage to the reference voltage, and S is the ratio of the target technology to the reference technology [8]

Read more

Summary

Introduction

The user demand for high-throughput wireless communications has been growing considerably in recent years. The IEEE 802.11b wireless local area network (WLAN) standard was introduced, which achieved a modest maximum downlink throughput of 11 Kbps over a single-antenna communication link. The K -best algorithm, which implements the tree search using a breadth-first strategy, has received significant research interest as it is able to achieve the ML diversity order with a complexity that is independent of the signal-to-noise ratio (SNR). We consider a MIMO transmitter employing NT antennas and transmitting information symbols over a wireless link to NR receive antennas. To recover the transmitted symbol, s, at the receiver, a QR decomposition can be performed on the channel matrix as follows: y = Rs + QH n, (2).

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call