Programmable processor implementations of K-best list sphere detector for MIMO receiver

DOI10.1016/J.SIGPRO.2009.06.026MaRDI QIDQ1048814zbMATH OpenOpenAlexFDO

Authors Janne Janhunen, Olli Silvén, Markku Juntti

Publication date 8 January 2010

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.sigpro.2009.06.026

zbMATH Keywords

\(K\)-bestASIPASPDSPLSDMIMOTTA

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Recommendations

• Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
• Reduced complexity \(K\) -best sphere decoder design for MIMO systems
• A practical, hardware friendly MMSE detector for MIMO-OFDM-based systems
• Practical aspects of preprocessing techniques for K-best tree search MIMO detectors
• A survey of VLSI implementations of tree search algorithms for MIMO detection

Cites work

• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Instrumentable tree encoding of information sources (Corresp.)
• On maximum-likelihood detection and the search for the closest lattice point
• Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver

Cited in

(3)

• Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver
• Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
• Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1048814)