human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "low complexity channel reconstruction methods based on svd zf precoding in massive 3d mimo systems"
  Abstract: In this paper, we study the low-complexity channel reconstruction methods for downlink precoding in massive multiple-Input multiple-Output (MIMO) systems. When the user is allocated less streams than the number of its antennas, the base station (BS) or user usually utilizes the singular value decomposition (SVD) to get the effective channels, whose dimension is equal to the number of streams. This process is called channel reconstruction and done in BS for time division duplex (TDD) mode. However, with the increasing of antennas in BS, the computation burden of SVD is getting incredible. Here, we propose a series of novel low-complexity channel reconstruction methods for downlink precoding in 3D spatial channel model. We consider different correlations between elevation and azimuth antennas, and divide the large dimensional matrix SVD into two kinds of small-size matrix SVD. The simulation results show that the proposed methods only produce less than 10% float computation than the traditional SVD zero-forcing (SVD-ZF) precoding method, while keeping nearly the same performance of 1Gbps.

Connected through hyperedge HE-1 (induced by source paper "channel reconstruction for svd zf precoding in massive 3d mimo systems low complexity algorithm"):
  with members:
    - "randomized algorithms for low rank matrix factorizations sharp performance bounds"

Question: Please tell me which class the center node 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)