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 "doa parameter estimation with 1 bit quantization bounds methods and the exponential replacement"):
  Abstract: While 1-bit analog-to-digital conversion (ADC) allows to significantly reduce the analog complexity of wireless receive systems, using the exact likelihood function of the hard-limiting system model in order to obtain efficient algorithms in the digital domain can make 1-bit signal processing challenging. If the signal model before the quantizer consists of correlated Gaussian random variables, the tail probability for a multivariate Gaussian distribution with N dimensions (general orthant probability) is required in order to formulate the likelihood function of the quantizer output. As a closed-form expression for the general orthant probability is an open mathematical problem, formulation of efficient processing methods for correlated and quantized data and an analytical performance assessment have, despite their high practical relevance, only found limited attention in the literature on quantized estimation theory. Here we review the approach of replacing the original system model by an equivalent distribution within the exponential family. For 1-bit signal processing, this allows to circumvent calculation of the general orthant probability and gives access to a conservative approximation of the receive likelihood. For the application of blind direction-of-arrival (DOA) parameter estimation with an array of K sensors, each performing 1-bit quantization, we demonstrate how the exponential replacement enables to formulate a pessimistic version of the Cram\'er-Rao lower bound (CRLB) and to derive an asymptotically achieving conservative maximum-likelihood estimator (CMLE). The 1-bit DOA performance analysis based on the pessimistic CRLB points out that a low-complexity radio front-end design with 1-bit ADC is in particular suitable for blind wireless DOA estimation with a large number of array elements operating in the medium SNR regime.

Includes members:
  Member "asymptotic parameter tracking performance with measurement data of 1 bit resolution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zero crossing modulation for communication with temporally oversampled 1 bit quantization")
  Member "a lower bound for the fisher information measure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sensitivity analysis for binary sampling systems via quantitative fisher information lower bounds")

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)