Article thumbnail
Location of Repository

A VLSI optimised parallel tree search for MIMO

By Geoff Knagge, Graeme Woodward, Steven R. Weller and Brett Ninness


Multiple input-multiple output (MIMO) systems are of great interest due to their ability to significantly increase the capacity of wireless communications systems, but for these to be useful they must also be practical for implementation in very large scale integrated (VLSI) circuits. A particularly difficult part of these systems is the detector, where the maximum-likelihood (ML) solution cannot be directly implemented due to its exponential complexity. Lattice decoders, such as the sphere search, exhibit near-ML performance with reduced complexity, but their application is still limited by computational requirements. Here, a number of optimisations are presented, designed to reduce the computational cost of the sphere search in the context of VLSI implementation for MIMO applications. We also propose parallel implementation strategies for such a detector, suitable for implementation in VLSI. This is then combined with a single-pass tree search approach and it is demonstrated that it can be designed so that the error-rate performance is not significantly impaired

Topics: ASIC implementation, MIMO, sphere detector, tree search, VLSI
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Year: 2005
DOI identifier: 10.1109/AUSCTW.2005.1624254
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.