Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yanlin Geng has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Wireless Multiaccess Distributed Computing Networks

    by Linge Tian, Wei Liu, Yanlin Geng, Baoming Bai, Huiting Yang, Wei Xiang

    Wireless distributed computing (WDC) is a promising architecture for enabling high computing efficiency in future Internet of Things (IoT) systems. In WDC networks, the Shuffle phase suffers from high normalized delivery time (NDT) due to two main factors, i.e., heavy communication load and low communication efficiency. Current research mainly focuses on improving communication efficiency, often overlooking the need to reduce the communication load. In this article, from the perspective of jointly reducing the communication load and improving communication efficiency, we propose a wireless multiaccess distributed computing (WMADC) network and a novel multiaccess interference alignment and neutralization (MA-IAN) scheme to reduce the NDT. In particular, the WMADC network is proposed to greatly reduce the communication load through transmitting fewer intermediate values (IVAs) due to the advantage that a reducer node can be connected with multiple mapper nodes and directly obtain their computed IVAs. Furthermore, we propose the novel MA-IAN scheme to greatly improve communication efficiency by carefully designing the sophisticated joint interference alignment (IA) and interference neutralization (IN) scheme. Finally, we derive an information-theoretic lower bound on the NDT for the WMADC network, which demonstrates that the proposed MA-IAN scheme is optimal in several scenarios. Furthermore, the proposed WMADC network with the MA-IAN scheme outperforms existing relevant schemes in terms of reducing the NDT.

  • Open Access

    Extended Arimoto–Blahut Algorithms for Bistatic Integrated Sensing and Communications Systems

    by Tian Jiao, Yanlin Geng, Zhiqiang Wei, Zai Yang

    Integrated Sensing and Communication (ISAC) has emerged as a cornerstone technology for next-generation wireless networks, where accurate performance evaluation is essential. In such systems, the capacity–distortion function provides a fundamental measure of the trade-off between communication and sensing performance, making its computation a problem of significant interest. However, the associated optimization problem is often constrained by non-convexity, which poses considerable challenges for deriving effective solutions. In this paper, we propose extended Arimoto–Blahut (AB) algorithms to solve the non-convex optimization problem associated with the capacity–distortion trade-off in bistatic ISAC systems. Specifically, we introduce auxiliary variables to transform non-convex distortion constraints in the optimization problem into linear constraints, prove that the reformulated linearly constrained optimization problem maintains the same optimal solution as the original problem, and develop extended AB algorithms for both squared error distortion and logarithmic loss distortion. The numerical results validate the effectiveness of the proposed algorithms.


  • Top Cited Papers

    Information-Theoretic Limits of Bistatic Integrated Sensing and Communication

    by Tian Jiao, Kai Wan, Zhiqiang Wei, Yanlin Geng, Yonglong Li, Zai Yang, Giuseppe Caire

    Bistatic sensing refers to scenarios where the transmitter (illuminating the target) and the sensing receiver (estimating the target state) are physically separated, in contrast to monostatic sensing, where both functions are co-located. In practical settings, bistatic sensing may be required either due to inherent system constraints or as a means to mitigate the strong self-interference encountered in monostatic configurations. A key practical challenge in bistatic radio-frequency radar systems is the synchronization and calibration of the separate transmitter and sensing receiver. In this paper, we are not concerned with these signal processing aspects and take a complementary information-theoretic perspective on bistatic integrated sensing and communication (ISAC). Namely, we aim to characterize the capacity-distortion function—the fundamental tradeoff between communication capacity and sensing accuracy. We consider a general discrete channel model for a bistatic ISAC system and derive a multi-letter representation of its capacity-distortion function. Then, we establish single-letter upper and lower bounds and provide exact single-letter characterizations for degraded bistatic ISAC channels. Numerical examples illustrate the theoretical results, highlighting the benefits of ISAC over separate communication and sensing, as well as the role of leveraging communication to assist sensing in bistatic systems.


  • Open Access

    Blahut–Arimoto Algorithms for Inner and Outer Bounds on Capacity Regions of Broadcast Channels

    by Yanan Dou, Yanqing Liu, Xueyan Niu, Bo Bai, Wei Han, Yanlin Geng

    The celebrated Blahut–Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max–min problems and that the exchange of minimum and maximum holds; second, we design Blahut–Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms.


  • Wireless Distributed Computing Networks With Interference Alignment and Neutralization

    by Linge Tian, Wei Liu, Yanlin Geng, Jiandong Li, Tony Q. S. Quek

    In this paper, for a general full-duplex wireless MapReduce distributed computing network, we investigate the minimization of the communication overhead for a given computation overhead. The wireless MapReduce framework consists of three phases: Map phase, Shuffle phase and Reduce phase. Specifically, we model the Shuffle phase into a cooperative X network based on a more general file assignment strategy. Furthermore, for this cooperative X network, we derive an information-theoretic upper bound on the sum degree of freedom (SDoF). Moreover, we propose a joint interference alignment and neutralization (IAN) scheme to characterize the achievable SDoF. Especially, in some cases, the achievable SDoF coincides with the upper bound on the SDoF, hence, the IAN scheme provides the optimal SDoF. Finally, based on the SDoF, we present an information-theoretic lower bound on the normalized delivery time (NDT) and achievable NDT of the wireless distributed computing network, which are less than or equal to those of the existing networks. The lower bound on the NDT shows that 1) there is a tradeoff between the computation load and the NDT; 2) the achievable NDT is optimal in some cases, hence, the proposed IAN scheme can reduce the communication overhead effectively.


  • Open Access

    Utilizing Information Bottleneck to Evaluate the Capability of Deep Neural Networks for Image Classification

    by Hao Cheng, Dongze Lian, Shenghua Gao, Yanlin Geng

    Inspired by the pioneering work of the information bottleneck (IB) principle for Deep Neural Networks’ (DNNs) analysis, we thoroughly study the relationship among the model accuracy, I ( X ; T ) and I ( T ; Y ) , where I ( X ; T ) and I ( T ; Y ) are the mutual information of DNN’s output T with input X and label Y. Then, we design an information plane-based framework to evaluate the capability of DNNs (including CNNs) for image classification. Instead of each hidden layer’s output, our framework focuses on the model output T. We successfully apply our framework to many application scenarios arising in deep learning and image classification problems, such as image classification with unbalanced data distribution, model selection, and transfer learning. The experimental results verify the effectiveness of the information plane-based framework: Our framework may facilitate a quick model selection and determine the number of samples needed for each class in the unbalanced classification problem. Furthermore, the framework explains the efficiency of transfer learning in the deep learning area.


  • Open Access

    Centralized Coded Caching with User Cooperation

    by Jiahui Chen, Haoyu Yin, Xiaowen You, Yanlin Geng, Youlong Wu

    In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded caching scheme based on a new deterministic placement strategy and a parallel delivery strategy. It is shown that the new scheme optimally allocate the communication loads on the server and users, obtaining cooperation gain and parallel gain that greatly reduces the transmission delay. Furthermore, we show that the number of users who parallelly send information should decrease when the users' caching size increases. In other words, letting more users parallelly send information could be harmful. Finally, we derive a constant multiplicative gap between the lower bound and upper bound on the transmission delay, which proves that our scheme is order optimal.