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 "joint design of multi tap analog cancellation and digital beamforming for reduced complexity full duplex mimo systems"):
  Abstract: Incorporating full duplex operation in Multiple Input Multiple Output (MIMO) systems provides the potential of boosting throughput performance. However, the hardware complexity of the analog self-interference canceller scales with the number of transmit and receive antennas, thus exploiting the benefits of analog cancellation becomes impractical for full duplex MIMO transceivers. In this paper, we present a novel architecture for the analog canceller comprising of reduced number of taps (tap refers to a line of fixed delay and variable phase shifter and attenuator) and simple multiplexers for efficient signal routing among the transmit and receive radio frequency chains. In contrast to the available analog cancellation architectures, the values for each tap and the configuration of the multiplexers are jointly designed with the digital beamforming filters according to certain performance objectives. Focusing on a narrowband flat fading channel model as an example, we present a general optimization framework for the joint design of analog cancellation and digital beamforming. We also detail a particular optimization objective together with its derived solution for the latter architectural components. Representative computer simulation results demonstrate the superiority of the proposed low complexity full duplex MIMO system over lately available ones.

Includes members:
  Member "user scheduling and optimal power allocation for full duplex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "optimal low complexity self interference cancellation for full duplex mimo small cells":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity full duplex mimo novel analog cancellation architectures and transceiver design")
  Member "softnull many antenna full duplex wireless via digital beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  Member "experiment driven characterization of full duplex wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simultaneous downlink data transmission and uplink channel estimation with reduced complexity full duplex mimo radios")

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)