WTWei Teng

Wei Teng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Wei Teng has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Batch Denoising for AIGC Service Provisioning in Wireless Edge Networks

    by Jinghang Xu, Kun Guo, Wei Teng, Chenxi Liu, Wei Feng

    Artificial intelligence-generated content (AIGC) service provisioning in wireless edge networks involves two phases: content generation on edge servers and content transmission to mobile devices. In this paper, we take image generation as a representative application and propose a batch denoising framework, followed by a joint optimization of content generation and transmission, with the objective of maximizing the average AIGC service quality under an end-to-end service delay constraint. Motivated by the empirical observations that (i) batch denoising effectively reduces per-step denoising delay by enhancing parallelism and (ii) early denoising steps have a greater impact on generation quality than later steps, we develop the STACKING algorithm to optimize batch denoising. The STACKING operates independently of any specific form of the content quality function and achieves lower computational complexity. Building on the batch solution, we further optimize bandwidth allocation across AIGC services. Simulation results demonstrate the superior performance of our algorithm in delivering high-quality, lower-latency AIGC services.

  • ROI-Based Image Transmission With Channel Feedback for Semantic Communications

    by Wei Teng, Weijia Han, Weihua Wu, Xiao Ma, Kun Guo

    We propose an image transmission scheme for semantic communications, by exploiting multi-round channel feedback and region of interest (ROI) in images. First, a multi-round channel feedback regime is proposed. Specifically, each image is encoded and transmitted in multiple rounds. At each round, received symbols are transmitted back to the transmitter for generating coded symbols at the subsequential rounds. Then, to reduce communication overheads, ROI is utilized to allocate more coded symbols to interested regions by determining the forward and backward of the corresponding symbols. Finally, extensive experiments demonstrate the advantages of our proposed scheme over other traditional schemes.

  • Performance Bound for Online Scalable Video Coding and Scalable Semantic Coding

    by Weijia Han, Xiaoyu Zhang, Bizheng Luo, Wei Teng, Xiao Ma, Chuan Huang

    Recently, scalable video coding (SVC) and scalable semantic coding (SSC) have emerged as effective solutions for supporting online video streaming in applications such as remote cockpits and telemedicine. Although the significance of SVC and SSC is well established, the underlying principles related to their performance bounds have not been thoroughly investigated. To address this issue, we study the performance bounds for online SVC/SSC in this paper. Initially, to evaluate coding performance, we propose a new metric referred to as effective coding gain (ECG), which jointly considers the entropy of the source data and the mutual information between the source and the encoded video data. Next, from the perspective of information theory, we derive a closed-form expression for the ECG bound while accounting for the impacts of diverse SVC/SSC coding structures. Our results not only ensure that the performance bounds can be efficiently evaluated but also provide valuable insights for resource allocation, cost optimization, performance evaluation and comparison, as well as for understanding the optimization space of existing systems.

  • MOBA: Real-Time Model Selection and Bandwidth Allocation for Wireless Image Transmission

    by Wei Teng, Hanchi Shi, Weijia Han, Weihua Wu, Xiao Ma, Kun Guo

    We propose MOBA, a real-time scheduler for MOdel selection and Bandwidth Allocation, to provide low-latency and high-quality image transmission in wireless networks. Specifically, MOBA first decomposes the joint optimization into large numbers of simple subproblems that are suitable for parallel computation. Then, we can solve them in parallel through sampling a subset of subproblems from identified promising sets, achieving real-time near-optimal solutions. Finally, we implement MOBA on an off-the-shelf Graphics Processing Unit (GPU) platform. Experimental results show that MOBA outperforms other traditional schemes, while meeting the stringent timing requirement (125 μs) in 5G.

  • Robust Beamforming and Resource Allocation for Multiantenna Cellular Vehicle-to-Everything (C-V2X) Networks

    by Weihua Wu, Yanxiu Huang, Wei Teng, Wenchao Xia, Runzi Liu, Wei Guo

    In this paper, we investigate the joint beamforming and power allocation problem in multi-antenna Cellular Vehicle-to-Everything (C-V2X) networks under uncertain channel state information (CSI). Our objective is to minimize the beamforming vector at the base station and the transmit powers of vehicle users while satisfying probabilistic quality-of-service (QoS) constraints. To address the uncertainty of CSI, we first develop an ellipsoid-based uncertainty set learning approach, which models the uncertain CSI as a symmetric ellipsoid. Building on this uncertainty set, we propose a robust counterpart transformation method to reformulate the joint beamforming and power allocation problem into a deterministic semi-definite problem without probabilistic constraints. Through our analysis, the ellipsoid-based uncertainty set exhibits significant conservatism when applied to uncertain CSI with asymmetric distributions. To mitigate this conservatism, we propose a support vector clustering (SVC)-based uncertainty set learning approach, which can tightly enclose the distribution of uncertain CSI. To further simplify the spatial structure of the SVC-based uncertainty set, we develop a K-Medoids-based equivalent set construction (KMSC) approach, significantly reducing the number of variables in the resulting robust equivalent problem. Finally, we conduct extensive simulations to evaluate the performance of our proposed robust approaches and compare them with non-robust methods.


  • A Novel Information-Theoretical Framework for Quantifying Coding Performance in Scalable Mobile Video Streaming

    by Weijia Han, Chuan Huang, Yanjie Dong, Yangyingzi Zhang, Yuxiang Yue, Wei Teng

    Recently, scalable video coding (SVC) has gained significant recognition in mobile video streaming because it can adapt bitstreams to time-varying transmission conditions. However, the coding performance of SVC, which is determined by its coding structure, has not been thoroughly studied. To address this issue, we propose analyzing the redundancy, reduction, distortion, and mutuality of video information within the video coding processes. This analysis facilitates the development of a novel information-theoretical framework for quantifying coding performance, which includes an information theory (IT)-based quantification method and a graphical representation system. The representation system accurately delineates the coding reference structure for encoding each video frame, while the proposed method utilizes mutual information to quantify the achievable coding performance of SVC under the delineated structure. To demonstrate the significance of our research, we apply the proposed framework to encode a basic coding unit, showcasing its effectiveness in improving SVC schemes. Consequently, our framework not only provides an efficient approach for quantifying the coding performance of SVC but also serves as an invaluable tool for optimizing SVC in various applications.