human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "matrix inversion less signal detection using sor method for uplink large scale mimo systems"):
  Abstract: For uplink large-scale MIMO systems, linear minimum mean square error (MMSE) signal detection algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose a low-complexity signal detection algorithm based on the successive overrelaxation (SOR) method to avoid the complicated matrix inversion. We first prove a special property that the MMSE filtering matrix is symmetric positive definite for uplink large-scale MIMO systems, which is the premise for the SOR method. Then a low-complexity iterative signal detection algorithm based on the SOR method as well as the convergence proof is proposed. The analysis shows that the proposed scheme can reduce the computational complexity from O(K3) to O(K2), where K is the number of users. Finally, we verify through simulation results that the proposed algorithm outperforms the recently proposed Neumann series approximation algorithm, and achieves the near-optimal performance of the classical MMSE algorithm with a small number of iterations.

Includes members:
  Member "multi pair amplify and forward relaying with very large antenna arrays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hybrid processing design for multipair massive mimo relaying with channel spatial correlation")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)