Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems

DOI10.1109/TSP.2018.2799191MaRDI QIDQ4621703zbMATH OpenOpenAlexFDO

Authors Guiqiang Peng, Leibo Liu, Sheng Zhou, Yang Xue, Shouyi Yin, Shaojun Wei

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2018.2799191

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Practical aspects of preprocessing techniques for K-best tree search MIMO detectors
• Programmable processor implementations of \(K\)-best list sphere detector for MIMO receiver
• An MIMO signal detection algorithm with low-complexity and near-optimal-performance
• An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
• Low-Computing-Load, High-Parallelism Detection Method Based on Chebyshev Iteration for Massive MIMO Systems With VLSI Architecture
• An Efficient Detector for Massive MIMO Based on Improved Matrix Partition
• On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
• The detection algorithm based on low rank tensor decomposition of large-scale MIMO
• A low complexity semidefinite relaxation for large-scale MIMO detection
• Stochastic Iterative MIMO Detection System: Algorithm and Hardware Design

Cited in

(1)

• An Efficient Detector for Massive MIMO Based on Improved Matrix Partition

This page was built for publication: Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems

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