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 "analysis of one bit quantized precoding for the multiuser massive mimo downlink"):
  Abstract: We present a mathematical analysis of linear precoders for downlink massive MIMO multiuser systems that employ one-bit digital-to-analog converters at the basestation in order to reduce complexity and mitigate power usage. The analysis is based on the Bussgang theorem, and applies generally to any linear precoding scheme. We examine in detail the special case of the quantized zero-forcing (ZF) precoder, and derive a simple asymptotic expression for the resulting symbol error rate at each terminal. Our analysis illustrates that the performance of the quantized ZF precoder depends primarily on the ratio of the number of antennas to the number of users, and our simulations show that it can outperform the much more complicated maximum likelihood encoder for low-to-moderate signal to noise ratios, where massive MIMO systems are presumed to operate. We also use the Bussgang theorem to derive a new linear precoder optimized for the case of one-bit quantization, and illustrate its improved performance.

Includes members:
  Member "nonlinear 1 bit precoding for massive mu mimo with higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one bit sigma delta mimo precoding")
  Member "mixed adc massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a regression approach to certain information transmission problems")
  Member "minimum ber precoding in 1 bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new equivalent model of quantizer with noisy input and its application for adc resolution determination in an uplink mimo receiver")
  Member "channel estimation and uplink achievable rates in one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "one bit ofdm receivers via deep learning")
  Member "quantized precoding for massive mu mimo":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "mmse precoder for massive mimo using 1 bit quantization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "one bit massive mimo channel estimation and high order modulations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "capacity analysis of one bit quantized mimo systems with transmitter channel state information":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")

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)