Semantic communication is a newly emerged communication paradigm that exploits deep learning (DL) models to realize communication processes like source coding and channel coding. Recent advances have demonstrated that DL-based joint source-channel coding (DeepJSCC) can achieve exciting data compression and noise-resiliency performances for wireless image transmission tasks, especially in environments with low channel signal-to-noises (SNRs). However, existing DeepJSCC-based semantic communication frameworks still cannot achieve adaptive code rates for different channel SNRs and image contents, which reduces its flexibility and bandwidth efficiency. In this paper, we propose a predictive and adaptive deep coding (PADC) framework for realizing flexible code rate optimization with a given target transmission quality requirement. PADC is realized by a variable code length enabled DeepJSCC (DeepJSCC-V) model for realizing flexible code length adjustment, an Oracle Network (OraNet) model for predicting peak-signal-to-noise (PSNR) value for an image transmission task according to its contents, channel signal to noise ratio (SNR) and the compression ratio (CR) value, and a CR optimizer aims at finding the minimal data-level or instance-level CR with a PSNR quality constraint. By using the above three modules, PADC can transmit the image data with minimal CR, which greatly increases bandwidth efficiency. Simulation results demonstrate that the proposed DeepJSCC-V model can achieve similar PSNR performances compared with the state-of-the-art Attention-based DeepJSCC (ADJSCC) model, and the proposed OraNet model is able to predict high-quality PSNR values with an average error lower than 0.5dB. Results also demonstrate that the proposed PADC can use nearly minimal bandwidth consumption for wireless image transmission tasks with different channel SNR and image contents, at the same time guaranteeing the PSNR constraint for each image data.
20 October 2023 in IEEE Transactions on Cognitive Communications and Networking
Semantic communication is a new paradigm that exploits deep learning models to enable end-to-end (E2E) communications processes, and recent studies have shown that it can achieve better noise resiliency compared with traditional communication schemes in a low signal-to-noise (SNR) regime. To achieve multiple access in semantic communication, we propose a deep learning-based multiple access (DeepMA) method by training semantic communication models with the abilities of joint source-channel coding (JSCC) and orthogonal signal modulation. DeepMA is achieved by a DeepMA network (DMANet), which is comprised of several independent encoder-decoder pairs (EDPs), and the DeepMA encoders can encode the input data as mutually orthogonal semantic symbol vectors (SSVs) such that the DeepMA decoders can detect and recover their own target data from a received mixed SSV (MSSV) superposed by multiple SSV components transmitted from different encoders. We describe frameworks of DeepMA in wireless device-to-device (D2D), downlink, and uplink channel multiplexing scenarios, along with the training algorithm. We evaluate the performance of the proposed DeepMA in wireless image transmission tasks and compare its performance with the attention module-based deep JSCC (ADJSCC) method and conventional communication schemes using better portable graphics (BPG) and Low-density parity-check code (LDPC). The results obtained show that the proposed DeepMA can achieve effective, flexible, and privacy-preserving channel multiplexing process, and demonstrate that our proposed DeepMA approach can yield comparable bandwidth efficiency compared with conventional multiple access schemes.
14 September 2021 in IEEE Transactions on Fuzzy Systems
This article investigates the feasibility of applying the broad learning system (BLS) to realize a novel Takagi–Sugeno–Kang (TSK) neuro-fuzzy model, namely a broad learning based dynamic fuzzy inference system (BL-DFIS). It not only improves the accuracy and interpretability of neuro-fuzzy models but also solves the challenging problem that models are incapable of determining the optimal architecture autonomously. BL-DFIS first accomplishes a TSK fuzzy system under the framework of BLS, in which an extreme learning machine auto-encoder is employed to obtain feature representation in a fast and analytical way, and an interpretable linguistic fuzzy rule is integrated into the enhancement node to ensure the high interpretability of the system. Meanwhile, the extended-enhancement unit is designed to achieve the first-order TSK fuzzy system. In addition, a dynamic incremental learning algorithm with internal pruning and updating mechanism is developed for the learning of BL-DFIS, which enables the system to automatically assemble the optimal structure to obtain a compact rule base and an excellent classification performance. Experiments on benchmark datasets demonstrate that the proposed BL-DFIS can achieve a better classification performance than some state-of-the-art nonfuzzy and neuro-fuzzy methods, simultaneously using the most parsimonious model structure.
20 May 2022 in IEEE Transactions on Cloud Computing
We propose a configurable model deployment architecture (CMDA) for edge AIaaS and present a flexible working mechanism by enabling the joint configuration of data quality ratios (DQRs) and model complexity ratios (MCRs) for the AI tasks. Along with commonly used resource allocation operations, the manager can improve the energy and delay performance of AI services with the desired quality of results (QoRs). We develop an energy-delay minimization problem under the framework of CMDA and propose a polynomial regression based relaxing method to solve the task configuration subproblem. We conduct experiments and simulations on the ImageNet classification and the common objects in context (COCO) object detection tasks using state-of-the-art deep learning models. We present the corresponding result quality tables (RQTs) and QoR regression models to illustrate the proposed method. The results of single task configuration and multi-task configuration and resource allocation on ImageNet classification and COCO object detection tasks demonstrate that the proposed method can achieve over 5× HDEC improvement compared with non-optimization schemes, and also show that joint configuration of DQR and MCR can achieve over 1.2× HDEC improvement compared with the methods that only configure DQR or MCR.
Edge computing is a commonly used paradigm for providing low-latency computation services by locally deploying computation and storage resources close to the user equipments (UEs). Since the computation resource demand of the offloaded tasks of a UE is naturally a random variable, it is possible that the real-time computation capacity demand of a resource-limited hosting virtual machine (VM) or edge computing server (ECS) is larger than its computation capacity, causing unexpected delay or delay-jitter to the services, which should be avoided if possible, for delay-sensitive applications. We consider an edge computing scenario wherein the transmission links are unmanageable and computation resource demands of VM servers are stochastic. We propose a novel Logistic function-based service reliability probability (SRP) estimation model without specifying the distributions of the resource demands. We study the average SRP maximization problem (ASRPMP) in a VM-based edge computing server (ECS) by jointly optimizing the service quality ratios (SQRs) and the computation resource allocations, and we propose an alternative optimization algorithm (AOA) by decomposing the problem into a resource allocation problem (RAP) and a service quality control problem (SQCP). Based on the derived analytical solutions of the two subproblems, we propose an effective and low-complexity heuristic AOA (HAOA) to solve the ASRPMP. The simulation results obtained from both synthetic Gaussian workload data and PlanetLab trace data demonstrate that, given the same target SQR or computation resource, the proposed method can achieve similar performance compared with the convex AOA (CAOA) method with much higher complexity, and can improve the reliability of the services compared with the baseline weighted allocation method (WAM) in both high and low SRP regimes.