Abstract
Sphere decoders are widely investigated for the implementation of multiple-input multiple-output (MIMO) detection. Among a large number of sphere decoding algorithms, the fixed-complexity sphere decoder (FSD) exhibits remarkable advantages in terms of constant throughput and high flexibility of parallel implemen- tation. In this paper, we present a four-nodes-per-cycle parallel FSD architecture with balanced performance and hardware complexity, and several examples of VLSI implementation for different types of modulation and both real and complex signal models. Implementation aspects and architecture details are analyzed in order to present a hardware-level perspective of the FSD implementation. Therefore a variety of performance-complexity trade-offs are provided. The implementation results show that the proposed parallel FSD architecture is highly efficient and flexible, especially in the complex signal model.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
