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 "block diagonalization type precoding algorithms for ieee 802 11ac systems"):
  Abstract: Block diagonalization (BD) based precoding schemes are well-known linear transmit strategies employed in the downlink of multi-user multiple-input multipleoutput (MU-MIMO) systems. BD type precoding algorithms employed at the transmit side effect the suppression of multi-user interference (MUI) by the decomposition of MU-MIMO broadcast channel into multiple single-user MIMO (SU-MIMO) channels followed by parallelization of the SU-MIMO channels to obtain independent streams of each user. Given that the design of linear precoding algorithms has made significant progress, the implementation of these techniques in standards for wireless local area networks (WLAN) remains an open question. In this work, schemes for implementation of BD based precoding techniques in the framework of IEEE 802.11ac standard are proposed followed by performance evaluation of these techniques in the proposed framework. I analyze the sum-rate and the bit-error-rate (BER) performance of the techniques in my framework and obtain computational complexity-wise as well as performance-wise optimal algorithm for my system.

Includes members:
  Member "generalized design of low complexity block diagonalization type precoding algorithms for multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  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)