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 "a framework for one bit and constant envelope precoding over multiuser massive miso channels"):
  Abstract: Consider the following problem: A multi-antenna base station (BS) sends multiple symbol streams to multiple single-antenna users via precoding. However, unlike conventional multiuser precoding, the transmitted signals are subjected to binary, unit-modulus, or even discrete unit-modulus constraints. Such constraints arise in the one-bit and constant-envelope (CE) massive MIMO scenarios, wherein high-resolution digital-to-analog converters (DACs) are replaced by one-bit DACs and phase shifters, respectively, for cutting down hardware cost and energy consumption. Multiuser precoding under one-bit and CE restrictions poses significant design difficulty. In this paper we establish a framework for designing multiuser precoding under the one-bit, continuous CE and discrete CE scenarios---all within one theme. We first formulate a precoding design that focuses on minimizations of symbol-error probabilities (SEPs), assuming quadrature amplitude modulation (QAM) constellations. We then devise an algorithm for our SEP-based design. The algorithm combines i) a novel penalty method for handling binary, unit-modulus and discrete unit-modulus constraints; and ii) a first-order non-convex optimization recipe custom-built for the design. Specifically, the latter is an inexact majorization-minimization method via accelerated projected gradient, which, as shown by simulations, runs very fast and can handle a large number of decision variables. Simulation results indicate that the proposed design offers significantly better bit-error rate performance than the existing designs.

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 "minimum symbol error rate based constant envelope precoding for multiuser massive miso downlink":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient resource allocation for relay assisted computation offloading in mobile edge computing")
  Member "quantized constant envelope precoding with psk and qam signaling":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "one bit sigma delta mimo precoding")
  Member "mse optimal 1 bit precoding for multiuser mimo via branch and bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal precoding for multiuser mimo systems with phase quantization and psk modulation via branch and bound")
  Member "one bit precoding and constellation range design for massive mimo with qam signaling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "accelerated gradient descent escapes saddle points faster than gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gradient descent with momentum to accelerate or to super accelerate")
  Member "nonlinear precoding for phase quantized constant envelope massive mu mimo ofdm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "massive mu mimo ofdm uplink with direct rf sampling and 1 bit adcs")

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)