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 "1 bit massive mu mimo precoding in vlsi"):
  Abstract: Massive multiuser (MU) multiple-input multiple-output (MIMO) will be a core technology in fifth-generation (5G) wireless systems as it offers significant improvements in spectral efficiency compared to existing multi-antenna technologies. The presence of hundreds of antenna elements at the base station (BS), however, results in excessively high hardware costs and power consumption, and requires high interconnect throughput between the baseband-processing unit and the radio unit. Massive MU-MIMO that uses low-resolution analog-to-digital and digital-to-analog converters (DACs) has the potential to address all these issues. In this paper, we focus on downlink precoding for massive MU-MIMO systems with 1-bit DACs at the BS. The objective is to design precoders that simultaneously mitigate multi-user interference (MUI) and quantization artifacts. We propose two nonlinear 1-bit precoding algorithms and corresponding very-large scale integration (VLSI) designs. Our algorithms rely on biconvex relaxation, which enables the design of efficient 1-bit precoding algorithms that achieve superior error-rate performance compared to that of linear precoding algorithms followed by quantization. To showcase the efficacy of our algorithms, we design VLSI architectures that enable efficient 1-bit precoding for massive MU-MIMO systems in which hundreds of antennas serve tens of user equipments. We present corresponding field-programmable gate array (FPGA) implementations to demonstrate that 1-bit precoding enables reliable and high-rate downlink data transmission in practical systems.

Includes members:
  Member "decentralized baseband processing for massive mu mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cell free massive mimo with radio stripes and sequential uplink processing")
  Member "channel estimation and performance analysis of one bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "capacity bounds for communication systems with quantization and spectral constraints")
  Member "massive mu mimo ofdm downlink with one bit dacs and linear precoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "training for channel estimation in nonlinear multi antenna transceivers")
  Member "nonlinear 1 bit precoding for massive mu mimo with higher order modulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "one bit sigma delta mimo precoding")
  Member "minimum ber precoding in 1 bit massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new equivalent model of quantizer with noisy input and its application for adc resolution determination in an uplink mimo receiver")
  Member "data detection in large multi antenna wireless systems via approximate semidefinite relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vlsi design of a nonparametric equalizer for massive mu mimo")
  Member "performance of the wideband massive uplink mimo with one bit adcs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "channel estimation and performance analysis of one bit massive mimo systems")

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)