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: "fixed complexity vector perturbation with block diagonalization for mu mimo systems"
  Abstract: Block diagonalization (BD) is an attractive technique that transforms the multi-user multiple-input multiple-output (MU-MIMO) channel into parallel single-user MIMO (SU-MIMO) channels with zero inter-user interference (IUI). In this paper, we combine the BD technique with two deterministic vector perturbation (VP) algorithms that reduce the transmit power in MU-MIMO systems with linear precoding. These techniques are the fixed-complexity sphere encoder (FSE) and the QR-decomposition with M-algorithm encoder (QRDM-E). In contrast to the conventional BD VP technique, which is based on the sphere encoder (SE), the proposed techniques have fixed complexity and a tradeoff between performance and complexity can be achieved by controlling the size of the set of candidates for the perturbation vector. Simulation results and analysis demonstrate the properness of the proposed techniques for the next generation mobile communications systems which are latency and computational complexity limited. In MU-MIMO system with 4 users each equipped with 2 receive antennas, simulation results show that the proposed BD-FSE and BD-QRDM-E outperforms the conventional BD-THP (Tomlinson Harashima precoding) by 5.5 and 7.4dB, respectively, at a target BER of 10^{-4}.

Connected through hyperedge HE-1 (induced by source paper "channel pre inversion and max sinr vector perturbation for large scale broadcast channels"):
  with members:
    - "hybrid channel pre inversion and interference alignment strategies"
    - "fast decodable asymmetric space time codes from division algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "vector precoding for wireless mimo systems and its replica analysis"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "coordinated transmit and receive processing with adaptive multi stream selection"):
  with members:
    - "on transmit antenna selection for multiuser mimo systems with dirty paper coding"

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)