Sparse Rev-Shift Coded Modulation with Novel Overhead Bound  

作　　者：Mingjun Dai Wanru Li Chanting Zhang Xiaohui Lin Bin Chen 

机构地区：[1]School of Computer Science and Technology,Kashi University,Kashi 844000,China [2]College of Electronics and Information Engineering,Shenzhen University,Shenzhen 518000,China

出　　处：《China Communications》2023年第10期17-29,共13页中国通信（英文版）

基　　金：supported by research grants from Natural Science Foundation of China(62071304);Guangdong Basic and Applied Basic Research Foundation(2020A1515010381,2022A1515011219,20220809155455002);Basic Research foundation of Shenzhen City(20200826152915001,20190808120415286);Natural Science Foundation of Shenzhen University(00002501);Xinjiang Uygur Autonomous Region Natural Science Foundation General Project(2023D01A60).

摘　　要：To provide reliability in distributed systems,combination property(CP)is desired,where k original packets are encoded into n≥k packets and arbitrary k are sufficient to reconstruct all the original packets.Shift-and-add(SA)encoding combined with zigzag decoding(ZD)obtains the CP-ZD,which is promising to reap low computational complexity in the encoding/decoding process of these systems.As densely coded modulation is difficult to achieve CP-ZD,research attentions are paid to sparse coded modulation.The drawback of existing sparse CP-ZD coded modulation lies in high overhead,especially in widely deployed setting m<k,where m≜n−k.For this scenario,namely,m<k,a sparse reverseorder shift(Rev-Shift)CP-ZD coded modulation is designed.The proof that Rev-Shift possesses CP-ZD is provided.A lower bound for the overhead,as far as we know is the first for sparse CP-ZD coded modulation,is derived.The bound is found tight in certain scenarios,which shows the code optimality.Extensive numerical studies show that compared to existing sparse CP-ZD coded modulation,the overhead of Rev-Shift reduces significantly,and the derived lower bound is tight when k or m approaches 0.

关 键 词：distributed system shift-and-add zigzag decoding sparse coded modulation 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TN911.3[自动化与计算机技术—计算机科学与技术]