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 "one bit sigma delta mimo precoding"):
  Abstract: Coarsely quantized MIMO signalling methods have gained popularity in the recent developments of massive MIMO as they open up opportunities for massive MIMO implementation using cheap and power-efficient radio-frequency front-ends. This paper presents a new one-bit MIMO precoding approach using spatial Sigma-Delta ($\Sigma\Delta$) modulation. In previous one-bit MIMO precoding research, one mainly focuses on using optimization to tackle the difficult binary signal optimization problem that arises from the precoding design. Our approach attempts a different route. Assuming angular MIMO channels, we apply $\Sigma\Delta$ modulation---a classical concept in analog-to-digital conversion of temporal signals---in space. The resulting $\Sigma\Delta$ precoding approach has two main advantages: First, we no longer need to deal with binary optimization in $\Sigma\Delta$ precoding design. Particularly, the binary signal restriction is replaced by peak signal amplitude constraints. Second, the impact of the quantization error can be well controlled via modulator design and under appropriate operating conditions. Through symbol error probability analysis, we reveal that the very large number of antennas in massive MIMO provides favorable operating conditions for $\Sigma\Delta$ precoding. In addition, we develop a new $\Sigma\Delta$ modulation architecture that is capable of adapting the channel to achieve nearly zero quantization error for a targeted user. Furthermore, we consider multi-user $\Sigma\Delta$ precoding using the zero-forcing and symbol-level precoding schemes. These two $\Sigma\Delta$ precoding schemes perform considerably better than their direct one-bit quantized counterparts, as simulation results show.

Includes members:
  Member "symbol level precoding is symbol perturbed zf when energy efficiency is sought":
    also connected through other hyperedges:
      (none)
  Member "a framework for one bit and constant envelope precoding over multiuser massive miso channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "quantized constant envelope precoding with psk and qam signaling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "multiuser one bit massive mimo precoding under mpsk signaling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a framework for one bit and constant envelope precoding over multiuser massive miso channels")
  Member "one bit precoding and constellation range design for massive mimo with qam signaling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "one bit sphere decoding for uplink massive mimo systems with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "1 bit massive mu mimo precoding in vlsi":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)