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 "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems"):
  Abstract: As a typical example of bandwidth-efficient techniques, bit-interleaved coded modulation with iterative decoding (BICM-ID) provides desirable spectral efficiencies in various wireless communication scenarios. In this paper, we carry out a comprehensive investigation on tail-biting (TB) spatially coupled protograph (SC-P) low-density parity-check (LDPC) codes in BICM-ID systems. Specifically, we first develop a two-step design method to formulate a novel type of constellation mappers, referred to as  labeling-bit-partial-match (LBPM) constellation mappers , for SC-P-based BICM-ID systems. The LBPM constellation mappers can be seamlessly combined with high-order modulations, such as   $M$  -ary phase-shift keying (PSK) and   $M$  -ary quadrature amplitude modulation (QAM). Furthermore, we conceive a new bit-level interleaving scheme, referred to as  variable node matched mapping (VNMM) scheme , which can substantially exploit the structure feature of SC-P codes and the unequal protection-degree property of labeling bits to trigger the wave-like convergence for TB-SC-P codes. In addition, we propose a hierarchical extrinsic information transfer (EXIT) algorithm to predict the convergence performance (i.e., decoding thresholds) of the proposed SC-P-based BICM-ID systems. Theoretical analyses and simulation results illustrate that the LBPM-mapped SC-P-based BICM-ID systems are remarkably superior to the state-of-the-art mapped counterparts. Moreover, the proposed SC-P-based BICM-ID systems can achieve even better error performance with the aid of the VNMM scheme. As a consequence, the proposed LBPM constellation mappers and VNMM scheme make the SC-P-based BICM-ID systems a favorable choice for the future-generation wireless communication systems.

Includes members:
  Member "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "managing device lifecycle reconfigurable constrained codes for m t q p lc flash memories")
  Member "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "improving the decoding threshold of tailbiting spatially coupled ldpc codes by energy shaping":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "outage limit approaching protograph ldpc codes for slow fading wireless communications")
  Member "compact qc ldpc block and sc ldpc convolutional codes for low latency communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "design and analysis of time invariant sc ldpc convolutional codes with small constraint length":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "wave like decoding of tail biting spatially coupled ldpc codes through iterative demapping":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes and the multiple access channel")
  Member "finite length analysis of spatially coupled regular ldpc ensembles on burst erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non uniform windowed decoding for multi dimensional spatially coupled ldpc codes")
  Member "efficient multi dimensional mapping using qam constellations for bicm id":
    also connected through other hyperedges:
      (none)

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)