Pub Date : 2024-07-01DOI: 10.23919/JCC.fa.2022-0129.202407
Qasim Jan, Yin Chao, Zhiwen Pan, Muhammad Furqan, Zakir Ali, Xiaohu You
Though belief propagation bit-flip (BPBF) decoding improves the error correction performance of polar codes, it uses the exhaustive flips method to achieve the error correction performance of CA-SCL decoding, thus resulting in high decoding complexity and latency. To alleviate this issue, we incorporate the LDPC-CRC-Polar coding scheme with BPBF and propose an improved belief propagation decoder for LDPC-CRC-Polar codes with bit-freezing (LDPC-CRC-Polar codes BPBFz). The proposed LDPC-CRC-Polar codes BPBFz employs the LDPC code to ensure the reliability of the flipping set, i.e., critical set (CS), and dynamically update it. The modified CS is further utilized for the identification of error-prone bits. The proposed LDPC-CRC-Polar codes BPBFz obtains remarkable error correction performance and is comparable to that of the CA-SCL (L = 16) decoder under medium-to-high signal-to-noise ratio (SNR) regions. It gains up to 1.2dB and 0.9dB at a fixed BLER = 10−4 compared with BP and BPBF (CS-1), respectively. In addition, the proposed LDPC-CRC-Polar codes BPBFz has lower decoding latency compared with CA-SCL and BPBF, i.e., it is 15 times faster than CA-SCL (L = 16) at high SNR regions.
{"title":"Improved belief propagation decoder for LDPC-CRC-polar codes with bit-freezing","authors":"Qasim Jan, Yin Chao, Zhiwen Pan, Muhammad Furqan, Zakir Ali, Xiaohu You","doi":"10.23919/JCC.fa.2022-0129.202407","DOIUrl":"https://doi.org/10.23919/JCC.fa.2022-0129.202407","url":null,"abstract":"Though belief propagation bit-flip (BPBF) decoding improves the error correction performance of polar codes, it uses the exhaustive flips method to achieve the error correction performance of CA-SCL decoding, thus resulting in high decoding complexity and latency. To alleviate this issue, we incorporate the LDPC-CRC-Polar coding scheme with BPBF and propose an improved belief propagation decoder for LDPC-CRC-Polar codes with bit-freezing (LDPC-CRC-Polar codes BPBFz). The proposed LDPC-CRC-Polar codes BPBFz employs the LDPC code to ensure the reliability of the flipping set, i.e., critical set (CS), and dynamically update it. The modified CS is further utilized for the identification of error-prone bits. The proposed LDPC-CRC-Polar codes BPBFz obtains remarkable error correction performance and is comparable to that of the CA-SCL (L = 16) decoder under medium-to-high signal-to-noise ratio (SNR) regions. It gains up to 1.2dB and 0.9dB at a fixed BLER = 10−4 compared with BP and BPBF (CS-1), respectively. In addition, the proposed LDPC-CRC-Polar codes BPBFz has lower decoding latency compared with CA-SCL and BPBF, i.e., it is 15 times faster than CA-SCL (L = 16) at high SNR regions.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141850551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.ja.2023-0091
Yang Lilin, Li Guyue, Guo Tao, Xu Hao, Hu Aiqun
Physical-layer secret key generation (PSKG) provides a lightweight way for group key (GK) sharing between wireless users in large-scale wireless networks. However, most of the existing works in this field consider only group communication. For a commonly dual-task scenario, where both GK and pairwise key (PK) are required, traditional methods are less suitable for direct extension. For the first time, we discover a security issue with traditional methods in dual-task scenarios, which has not previously been recognized. We propose an innovative segment-based key generation method to solve this security issue. We do not directly use PK exclusively to negotiate the GK as traditional methods. Instead, we generate GK and PK separately through segmentation which is the first solution to meet dual-task. We also perform security and rate analysis. It is demonstrated that our method is effective in solving this security issue from an information-theoretic perspective. The rate results of simulation are also consistent with the our rate derivation.
{"title":"Physical-layer secret key generation for dual-task scenarios","authors":"Yang Lilin, Li Guyue, Guo Tao, Xu Hao, Hu Aiqun","doi":"10.23919/JCC.ja.2023-0091","DOIUrl":"https://doi.org/10.23919/JCC.ja.2023-0091","url":null,"abstract":"Physical-layer secret key generation (PSKG) provides a lightweight way for group key (GK) sharing between wireless users in large-scale wireless networks. However, most of the existing works in this field consider only group communication. For a commonly dual-task scenario, where both GK and pairwise key (PK) are required, traditional methods are less suitable for direct extension. For the first time, we discover a security issue with traditional methods in dual-task scenarios, which has not previously been recognized. We propose an innovative segment-based key generation method to solve this security issue. We do not directly use PK exclusively to negotiate the GK as traditional methods. Instead, we generate GK and PK separately through segmentation which is the first solution to meet dual-task. We also perform security and rate analysis. It is demonstrated that our method is effective in solving this security issue from an information-theoretic perspective. The rate results of simulation are also consistent with the our rate derivation.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.ja.2022-0617
Zhikai Zhang, Shushi Gu, Zhang Qinyu, Jiayin Xue
Due to the restricted satellite payloads in LEO mega-constellation networks (LMCNs), remote sensing image analysis, online learning and other big data services desirably need onboard distributed processing (OBDP). In existing technologies, the efficiency of big data applications (BDAs) in distributed systems hinges on the stable-state and low-latency links between worker nodes. However, LMCNs with high-dynamic nodes and long-distance links can not provide the above conditions, which makes the performance of OBDP hard to be intuitively measured. To bridge this gap, a multidimensional simulation platform is indispensable that can simulate the network environment of LMCNs and put BDAs in it for performance testing. Using STK's APIs and parallel computing framework, we achieve real-time simulation for thousands of satellite nodes, which are mapped as application nodes through software defined network (SDN) and container technologies. We elaborate the architecture and mechanism of the simulation platform, and take the Starlink and Hadoop as realistic examples for simulations. The results indicate that LMCNs have dynamic end-to-end latency which fluctuates periodically with the constellation movement. Compared to ground data center networks (GDCNs), LMCNs deteriorate the computing and storage job throughput, which can be alleviated by the utilization of erasure codes and data flow scheduling of worker nodes.
{"title":"Big data application simulation platform design for onboard distributed processing of LEO mega-constellation networks","authors":"Zhikai Zhang, Shushi Gu, Zhang Qinyu, Jiayin Xue","doi":"10.23919/JCC.ja.2022-0617","DOIUrl":"https://doi.org/10.23919/JCC.ja.2022-0617","url":null,"abstract":"Due to the restricted satellite payloads in LEO mega-constellation networks (LMCNs), remote sensing image analysis, online learning and other big data services desirably need onboard distributed processing (OBDP). In existing technologies, the efficiency of big data applications (BDAs) in distributed systems hinges on the stable-state and low-latency links between worker nodes. However, LMCNs with high-dynamic nodes and long-distance links can not provide the above conditions, which makes the performance of OBDP hard to be intuitively measured. To bridge this gap, a multidimensional simulation platform is indispensable that can simulate the network environment of LMCNs and put BDAs in it for performance testing. Using STK's APIs and parallel computing framework, we achieve real-time simulation for thousands of satellite nodes, which are mapped as application nodes through software defined network (SDN) and container technologies. We elaborate the architecture and mechanism of the simulation platform, and take the Starlink and Hadoop as realistic examples for simulations. The results indicate that LMCNs have dynamic end-to-end latency which fluctuates periodically with the constellation movement. Compared to ground data center networks (GDCNs), LMCNs deteriorate the computing and storage job throughput, which can be alleviated by the utilization of erasure codes and data flow scheduling of worker nodes.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141842690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The static and predictable characteristics of cyber systems give attackers an asymmetric advantage in gathering useful information and launching attacks. To reverse this asymmetric advantage, a new defense idea, called Moving Target Defense (MTD), has been proposed to provide additional selectable measures to complement traditional defense. However, MTD is unable to defeat the sophisticated attacker with fingerprint tracking ability. To overcome this limitation, we go one step beyond and show that the combination of MTD and Deception-based Cyber Defense (DCD) can achieve higher performance than either of them. In particular, we first introduce and formalize a novel attacker model named Scan and Foothold Attack (SFA) based on cyber kill chain. Afterwards, we develop probabilistic models for SFA defenses to provide a deeper analysis of the theoretical effect under different defense strategies. These models quantify attack success probability and the probability that the attacker will be deceived under various conditions, such as the size of address space, and the number of hosts, attack analysis time. Finally, the experimental results show that the actual defense effect of each strategy almost perfectly follows its probabilistic model. Also, the defense strategy of combining address mutation and fingerprint camouflage can achieve a better defense effect than the single address mutation.
{"title":"An active deception defense model based on address mutation and fingerprint camouflage","authors":"Wang Shuo, Chu Jiang, Qingqi Pei, Shao Feng, Yuan Shuai, Xiaoge Zhong","doi":"10.23919/JCC.ea.2020-0384.202401","DOIUrl":"https://doi.org/10.23919/JCC.ea.2020-0384.202401","url":null,"abstract":"The static and predictable characteristics of cyber systems give attackers an asymmetric advantage in gathering useful information and launching attacks. To reverse this asymmetric advantage, a new defense idea, called Moving Target Defense (MTD), has been proposed to provide additional selectable measures to complement traditional defense. However, MTD is unable to defeat the sophisticated attacker with fingerprint tracking ability. To overcome this limitation, we go one step beyond and show that the combination of MTD and Deception-based Cyber Defense (DCD) can achieve higher performance than either of them. In particular, we first introduce and formalize a novel attacker model named Scan and Foothold Attack (SFA) based on cyber kill chain. Afterwards, we develop probabilistic models for SFA defenses to provide a deeper analysis of the theoretical effect under different defense strategies. These models quantify attack success probability and the probability that the attacker will be deceived under various conditions, such as the size of address space, and the number of hosts, attack analysis time. Finally, the experimental results show that the actual defense effect of each strategy almost perfectly follows its probabilistic model. Also, the defense strategy of combining address mutation and fingerprint camouflage can achieve a better defense effect than the single address mutation.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the development of Internet of Things technology, intelligent door lock devices are widely used in the field of house leasing. In the traditional housing leasing scenario, problems of door lock information disclosure, tenant privacy disclosure and rental contract disputes frequently occur, and the security, fairness and auditability of the housing leasing transaction cannot be guaranteed. To solve the above problems, a blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability is proposed. The scheme implements fine-grained access control of door lock data based on attribute encryption technology with policy hiding, and uses proxy re-encryption technology to achieve auditable supervision of door lock information transactions. Homomorphic encryption technology and zero-knowledge proof technology are introduced to ensure the confidentiality of housing rent information and the fairness of rent payment. To construct a decentralized housing lease transaction architecture, the scheme realizes the efficient collaboration between the door lock data ciphertext stored under the chain and the key information ciphertext on the chain based on the blockchain and InterPlanetary File System. Finally, the security proof and computing performance analysis of the proposed scheme are carried out. The results show that the scheme can resist the chosen plaintext attack and has low computational cost.
{"title":"A blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability","authors":"Chen Guo, Weijun Peng, Wu Jing, Youxuan Fang, Ye Keke, Xin Yanshuang","doi":"10.23919/JCC.fa.2022-0863.202407","DOIUrl":"https://doi.org/10.23919/JCC.fa.2022-0863.202407","url":null,"abstract":"With the development of Internet of Things technology, intelligent door lock devices are widely used in the field of house leasing. In the traditional housing leasing scenario, problems of door lock information disclosure, tenant privacy disclosure and rental contract disputes frequently occur, and the security, fairness and auditability of the housing leasing transaction cannot be guaranteed. To solve the above problems, a blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability is proposed. The scheme implements fine-grained access control of door lock data based on attribute encryption technology with policy hiding, and uses proxy re-encryption technology to achieve auditable supervision of door lock information transactions. Homomorphic encryption technology and zero-knowledge proof technology are introduced to ensure the confidentiality of housing rent information and the fairness of rent payment. To construct a decentralized housing lease transaction architecture, the scheme realizes the efficient collaboration between the door lock data ciphertext stored under the chain and the key information ciphertext on the chain based on the blockchain and InterPlanetary File System. Finally, the security proof and computing performance analysis of the proposed scheme are carried out. The results show that the scheme can resist the chosen plaintext attack and has low computational cost.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141853413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.ja.2022-0740
Pengfei Duan, Zhaofeng Ma, Yuqing Zhang, Jingyu Wang, Shoushan Luo
With the growth of requirements for data sharing, a novel business model of digital assets trading has emerged that allows data owners to sell their data for monetary gain. In the distributed ledger of blockchain, however, the privacy of stakeholder's identity and the confidentiality of data content are threatened. Therefore, we proposed a blockchain-enabled privacy-preserving and access control scheme to address the above problems. First, the multi-channel mechanism is introduced to provide the privacy protection of distributed ledger inside the channel and achieve coarse-grained access control to digital assets. Then, we use multi-authority attribute-based encryption (MAABE) algorithm to build a fine-grained access control model for data trading in a single channel and describe its instantiation in detail. Security analysis shows that the scheme has IND-CPA secure and can provide privacy protection and collusion resistance. Compared with other schemes, our solution has better performance in privacy protection and access control. The evaluation results demonstrate its effectiveness and practicability.
{"title":"Blockchain-enabled privacy protection and access control scheme towards sensitive digital assets management","authors":"Pengfei Duan, Zhaofeng Ma, Yuqing Zhang, Jingyu Wang, Shoushan Luo","doi":"10.23919/JCC.ja.2022-0740","DOIUrl":"https://doi.org/10.23919/JCC.ja.2022-0740","url":null,"abstract":"With the growth of requirements for data sharing, a novel business model of digital assets trading has emerged that allows data owners to sell their data for monetary gain. In the distributed ledger of blockchain, however, the privacy of stakeholder's identity and the confidentiality of data content are threatened. Therefore, we proposed a blockchain-enabled privacy-preserving and access control scheme to address the above problems. First, the multi-channel mechanism is introduced to provide the privacy protection of distributed ledger inside the channel and achieve coarse-grained access control to digital assets. Then, we use multi-authority attribute-based encryption (MAABE) algorithm to build a fine-grained access control model for data trading in a single channel and describe its instantiation in detail. Security analysis shows that the scheme has IND-CPA secure and can provide privacy protection and collusion resistance. Compared with other schemes, our solution has better performance in privacy protection and access control. The evaluation results demonstrate its effectiveness and practicability.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141851402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.fa.2024-0024.202407
Mingkai Chen, Minghao Liu, Zhang Zhe, Zhiping Xu, Wang Lei
In the future development direction of the sixth generation (6G) mobile communication, several communication models are proposed to face the growing challenges of the task. The rapid development of artificial intelligence (AI) foundation models provides significant support for efficient and intelligent communication interactions. In this paper, we propose an innovative semantic communication paradigm called task-oriented semantic communication system with foundation models. First, we segment the image by using task prompts based on the segment anything model (SAM) and contrastive language-image pretraining (CLIP). Meanwhile, we adopt Bezier curve to enhance the mask to improve the segmentation accuracy. Second, we have differentiated semantic compression and transmission approaches for segmented content. Third, we fuse different semantic information based on the conditional diffusion model to generate high-quality images that satisfy the users' specific task requirements. Finally, the experimental results show that the proposed system compresses the semantic information effectively and improves the robustness of semantic communication.
{"title":"Task-oriented semantic communication with foundation models","authors":"Mingkai Chen, Minghao Liu, Zhang Zhe, Zhiping Xu, Wang Lei","doi":"10.23919/JCC.fa.2024-0024.202407","DOIUrl":"https://doi.org/10.23919/JCC.fa.2024-0024.202407","url":null,"abstract":"In the future development direction of the sixth generation (6G) mobile communication, several communication models are proposed to face the growing challenges of the task. The rapid development of artificial intelligence (AI) foundation models provides significant support for efficient and intelligent communication interactions. In this paper, we propose an innovative semantic communication paradigm called task-oriented semantic communication system with foundation models. First, we segment the image by using task prompts based on the segment anything model (SAM) and contrastive language-image pretraining (CLIP). Meanwhile, we adopt Bezier curve to enhance the mask to improve the segmentation accuracy. Second, we have differentiated semantic compression and transmission approaches for segmented content. Third, we fuse different semantic information based on the conditional diffusion model to generate high-quality images that satisfy the users' specific task requirements. Finally, the experimental results show that the proposed system compresses the semantic information effectively and improves the robustness of semantic communication.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141853593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.fa.2023-0145.202407
Chen Yong, Naiwen Liao, Wang Wei, Xianyu Zhang, Zhang Yu
To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles (UAVs), a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed, which is modeled as a mixed-integer non-convex optimization problem (MINCOP). An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing. The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method, including the spectrum allocation of UAVs, the association between UAVs and ground users, and the deployment of UAVs. Specifically, the optimal spectrum allocation is derived based on the interference mitigation and channel reuse. The association between UAVs and ground users is optimized based on local iterated optimization. A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment. Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.
{"title":"Joint optimization for on-demand deployment of UAVs and spectrum allocation in UAVs-assisted communication","authors":"Chen Yong, Naiwen Liao, Wang Wei, Xianyu Zhang, Zhang Yu","doi":"10.23919/JCC.fa.2023-0145.202407","DOIUrl":"https://doi.org/10.23919/JCC.fa.2023-0145.202407","url":null,"abstract":"To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles (UAVs), a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed, which is modeled as a mixed-integer non-convex optimization problem (MINCOP). An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing. The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method, including the spectrum allocation of UAVs, the association between UAVs and ground users, and the deployment of UAVs. Specifically, the optimal spectrum allocation is derived based on the interference mitigation and channel reuse. The association between UAVs and ground users is optimized based on local iterated optimization. A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment. Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141842276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-01DOI: 10.23919/JCC.fa.2023-0773.202407
K. Ma, Yuxuan Shi, Shao Shuo, Meixia Tao
We consider an image semantic communication system in a time-varying fading Gaussian MIMO channel, with a finite number of channel states. A deep learning-aided broadcast approach scheme is proposed to benefit the adaptive semantic transmission in terms of different channel states. We combine the classic broadcast approach with the image transformer to implement this adaptive joint source and channel coding (JSCC) scheme. Specifically, we utilize the neural network (NN) to jointly optimize the hierarchical image compression and superposition code mapping within this scheme. The learned transformers and codebooks allow recovering of the image with an adaptive quality and low error rate at the receiver side, in each channel state. The simulation results exhibit our proposed scheme can dynamically adapt the coding to the current channel state and outperform some existing intelligent schemes with the fixed coding block.
{"title":"A deep learning based broadcast approach for image semantic communication over fading channels","authors":"K. Ma, Yuxuan Shi, Shao Shuo, Meixia Tao","doi":"10.23919/JCC.fa.2023-0773.202407","DOIUrl":"https://doi.org/10.23919/JCC.fa.2023-0773.202407","url":null,"abstract":"We consider an image semantic communication system in a time-varying fading Gaussian MIMO channel, with a finite number of channel states. A deep learning-aided broadcast approach scheme is proposed to benefit the adaptive semantic transmission in terms of different channel states. We combine the classic broadcast approach with the image transformer to implement this adaptive joint source and channel coding (JSCC) scheme. Specifically, we utilize the neural network (NN) to jointly optimize the hierarchical image compression and superposition code mapping within this scheme. The learned transformers and codebooks allow recovering of the image with an adaptive quality and low error rate at the receiver side, in each channel state. The simulation results exhibit our proposed scheme can dynamically adapt the coding to the current channel state and outperform some existing intelligent schemes with the fixed coding block.","PeriodicalId":504777,"journal":{"name":"China Communications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141848352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：