A Novel VLSI Architecture of Fixed-complexity Sphere Decoder
Bin Wu, Guido Masera

TL;DR
This paper introduces a new VLSI architecture for the Fixed-complexity Sphere Decoder that significantly improves throughput and hardware efficiency, making it practical for real-world MIMO detection applications.
Contribution
A novel four-nodes-per-cycle parallel VLSI architecture for FSD with high throughput and low hardware cost, adaptable for higher throughput expansion.
Findings
Achieves 213.3 Mbps throughput at 400 MHz
Uses only 0.18 mm² silicon area on 0.13μm CMOS
More economical than FPGA implementations
Abstract
Fixed-complexity Sphere Decoder (FSD) is a recently proposed technique for Multiple-Input Multiple-Output (MIMO) detection. It has several outstanding features such as constant throughput and large potential parallelism, which makes it suitable for efficient VLSI implementation. However, to our best knowledge, no VLSI implementation of FSD has been reported in the literature, although some FPGA prototypes of FSD with pipeline architecture have been developed. These solutions achieve very high throughput but at very high cost of hardware resources, making them impractical in real applications. In this paper, we present a novel four-nodes-per-cycle parallel architecture of FSD, with a breadth-first processing that allows for short critical path. The implementation achieves a throughput of 213.3 Mbps at 400 MHz clock frequency, at a cost of 0.18 mm2 Silicon area on 0.13{\mu}m CMOS…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Coding theory and cryptography · PAPR reduction in OFDM
