human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "low complexity modem design for gfdm"
  Abstract: Due to its attractive properties, generalized frequency division multiplexing (GFDM) is recently being discussed as a candidate waveform for the fifth generation of wireless communication systems (5G). GFDM is introduced as a generalized form of the widely used orthogonal frequency division multiplexing (OFDM) modulation scheme and since it uses only one cyclic prefix (CP) for a group of symbols rather than a CP per symbol, it is more bandwidth efficient than OFDM. In this paper, we propose novel modem structures for GFDM by taking advantage of the particular structure in the modulation matrix. Our proposed transmitter is based on modulation matrix sparsification through application of fast Fourier transform (FFT) to reduce the implementation complexity. A unified demodulator structure for matched filter (MF), zero forcing (ZF), and minimum mean square error (MMSE) receivers is also derived. The proposed demodulation techniques harness the special block circulant property of the matrices involved in the demodulation stage to reduce the computational cost of the system implementation. We have derived the closed forms for the ZF and MMSE receiver filters. Additionally, our algorithms do not incur any performance loss as they maintain the optimal performance. The computational costs of our proposed techniques are analyzed in detail and are compared with the existing solutions that are known to have the lowest complexity. It is shown that through application of our structures a substantial amount of computational complexity reduction can be achieved.

Connected through hyperedge HE-1 (induced by source paper "matrix characterization for gfdm low complexity mmse receivers and optimal filters"):
  with members:
    - "filter design for generalized frequency division multiplexing"
    - "fast dgt based receivers for gfdm in broadband channels"
    - "reduced complexity calculation of lmmse filter coefficients for gfdm"

Connected through hyperedge HE-2 (induced by source paper "5g wireless and wired convergence in a passive optical network using uf ofdm and gfdm"):
  with members:
    - "impact of timing and frequency offsets on multicarrier waveform candidates for 5g"
    - "what will 5g be"

Connected through hyperedge HE-3 (induced by source paper "fast dgt based receivers for gfdm in broadband channels"):
  with members:
    - "gfdm a framework for virtual phy services in 5g networks"
    - "gfdm transceiver using precoded data and low complexity multiplication in time domain"
    - "reduced complexity calculation of lmmse filter coefficients for gfdm"

Connected through hyperedge HE-4 (induced by source paper "linear large scale mimo data detection for 5g multi carrier waveform candidates"):
  with members:
    - "out of band radiation comparison of gfdm wcp coqam and ofdm at equal spectral efficiency"
    - "gfdm transceiver using precoded data and low complexity multiplication in time domain"
    - "large scale mimo detection for 3gpp lte algorithms and fpga implementations"
    - "massive mimo for next generation wireless systems"
    - "scaling up mimo opportunities and challenges with very large arrays"

Question: Please tell me which class the center node 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)