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 "multiuser one bit massive mimo precoding under mpsk signaling"):
  Abstract: Most recently, there has been a flurry of research activities on studying how massive MIMO precoding should be designed when the digital-to-analog conversion at the transmitter side is operated by cheap one-bit digital-to-analog converters (DACs). Such research is motivated by the desire to substantially cut down the hardware cost and power consumption of the radio-frequency chain, which is unaffordable in massive MIMO if high-resolution DACs are still used. One-bit MIMO precoding design problems are much harder to solve than their high-resolution DAC counterparts. In our previous work, we developed a minimum symbol-error probability (SEP) design for one-bit precoding under the multiuser MISO downlink scenario and under quadrature amplitude modulation signaling. Leveraging on the previous work, this work shows how the minimum SEP design is applied to M-ary phase shift keying (MPSK) signaling. Simulation results show that our minimum SEP design delivers significantly better bit-error rate (BER) performance than the other designs for higher-order PSK such as 8-PSK and 16-PSK. As a minor, but useful, side contribution, we also tackle an MPSK SEP characterization problem which was only intuitively treated in the prior arts.

Includes members:
  Member "one bit massive mimo precoding via a minimum symbol error probability design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive mu mimo ofdm uplink with direct rf sampling and 1 bit adcs")
  Member "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "massive mu mimo ofdm uplink with direct rf sampling and 1 bit adcs")
  Member "massive mimo downlink 1 bit precoding with linear programming for psk signaling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "one bit sigma delta mimo precoding")
  Member "quantized precoding for massive mu mimo":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "exploiting known interference as green signal power for downlink beamforming optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rethinking secure precoding via interference exploitation a smart eavesdropper perspective")
  Member "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "quantized massive mu mimo ofdm uplink":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "massive mimo with 1 bit adc":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")

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)