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 "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution"):
  Abstract: It is known that the estimated energy consumption of digital-to analog converters (DACs) is around 30\% of the energy consumed by analog-to-digital converters (ADCs) keeping fixed the sampling rate and bit resolution. Assuming that similarly to ADC, DAC dissipation doubles with every extra bit of resolution, a decrease in two resolution bits, for instance from 4 to 2 bits, represents a 75$\% $ lower dissipation. The current limitations in sum-rates of 1-bit quantization have motivated researchers to consider extra bits in resolution to obtain higher levels of sum-rates. Following this, we devise coarse quantization-aware precoding using few bits for the broadcast channel of multiple-antenna systems based on the Bussgang theorem. In particular, we consider block diagonalization algorithms, which have not been considered in the literature so far. The sum-rates achieved by the proposed Coarse Quantization-Aware Block Diagonalization (CQA-BD) and its regularized version (CQA-RBD) are superior to those previously reported in the literature. Simulations illustrate the performance of the proposed CQA-BD and CGA-RBD algorithms against existing approaches.

Includes members:
  Member "throughput analysis of massive mimo uplink with low resolution adcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "branch and bound precoding for multiuser mimo systems with 1 bit quantization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")
  Member "widely linear precoding for large scale mimo with iqi algorithms and performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")
  Member "linear precoding with low resolution dacs for massive mu mimo ofdm downlink":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance analysis of quantized uplink massive mimo ofdm with oversampling under adjacent channel interference")
  Member "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")
  Member "robust adaptive beamforming based on low rank and cross correlation techniques":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")
  Member "quantized precoding for massive mu mimo":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "adaptive reduced rank receive processing based on minimum symbol error rate criterion for large scale multiple antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "study of cloud aided multi way multiple antenna relaying with best user link selection and joint ml detection")

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)