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 "massive mu mimo ofdm downlink with one bit dacs and linear precoding"):
  Abstract: Massive multiuser (MU) multiple-input multiple- output (MIMO) is foreseen to be a key technology in future wireless communication systems. In this paper, we analyze the downlink performance of an orthogonal frequency division multiplexing (OFDM)-based massive MU-MIMO system in which the base station (BS) is equipped with 1-bit digital-to-analog converters (DACs). Using Bussgang's theorem, we characterize the performance achievable with linear precoders (such as maximal-ratio transmission and zero forcing) in terms of bit error rate (BER). Our analysis accounts for the possibility of oversampling the time-domain transmit signal before the DACs. We further develop a lower bound on the information-theoretic sum-rate throughput achievable with Gaussian inputs. #R##N#Our results suggest that the performance achievable with 1-bit DACs in a massive MU-MIMO-OFDM downlink are satisfactory provided that the number of BS antennas is sufficiently large.

Includes members:
  Member "1 bit massive mu mimo precoding in vlsi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "channel estimation and performance analysis of one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "analysis of one bit quantized precoding for the multiuser massive mimo downlink":
    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 "bayes optimal joint channel and data estimation for massive mimo with low precision adcs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "downlink achievable rate analysis in massive mimo systems with one bit dacs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spectral efficiency of one bit sigma delta massive mimo")
  Member "minimum ber precoding in 1 bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new equivalent model of quantizer with noisy input and its application for adc resolution determination in an uplink mimo receiver")

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)