The detection algorithm based on low rank tensor decomposition of large-scale MIMO

DOI10.3969/J.ISSN.1000-5137.2017.01.013MaRDI QIDQ5368567zbMATH OpenFDO

Authors Xingyue Liu, Li Li, Zhangjie Peng, Xiaoping Zhou

Publication date 20 October 2017

Full work available at URL https://doi.org/10.3969/J.ISSN.1000-5137.2017.01.013

zbMATH Keywords

data detectionmassive MIMOtensor decompositionTucker algorithm

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Information theory (general) (94A15)

Recommendations

• Statistical mechanics of low-rank tensor decomposition
• scientific article; zbMATH DE number 1820149
• Tensor polyadic decomposition for antenna array processing
• A randomized tensor singular value decomposition based on the t-product.
• An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA

Cited in

(4)

• On the error exponent of a random tensor with orthonormal factor matrices
• A low complexity semidefinite relaxation for large-scale MIMO detection
• Algorithm and Architecture of a Low-Complexity and High-Parallelism Preprocessing-Based K -Best Detector for Large-Scale MIMO Systems
• An Efficient Detector for Massive MIMO Based on Improved Matrix Partition

This page was built for publication: The detection algorithm based on low rank tensor decomposition of large-scale MIMO

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