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 "efficient equalization method for cyclic prefix free coarsely quantized massive mimo systems"):
  Abstract: The use of low resolution Analog to Digital Converters (ADCs) can significantly reduce the power consumption for massive Multiple Input Multiple Output (MIMO) systems. The existing literature on quantized massive MIMO systems deals with Cyclic Prefix (CP) transmission schemes in frequency-selective fading channels. In this paper, we propose a block processing Frequency Domain Equalization (FDE) technique in CP-free transmission schemes for massive MIMO systems having low resolution ADCs. The optimal block length for FDE is found by minimizing a computational complexity cost function and taking quantization distortion, channel impulse response and the number of transmit and receiver antennas into account. Through numerical simulation, it is shown that the optimal block length also guarantees good performance in terms of the Mean Square Error (MSE) and Bit Error-Rate (BER) criterion.

Includes members:
  Member "uplink performance of wideband massive mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "mixed adc massive mimo uplink in frequency selective channels":
    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 "near maximum likelihood detector and channel estimator for uplink multiuser massive mimo systems with one bit adcs":
    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 "quantized massive mu mimo ofdm uplink":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "massive mimo with 1 bit adc":
    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")

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)