In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in...In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.展开更多
This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.R...This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.Rateless coding is introduced to enhance the reliability of the system.Previous literature has shown that FA-GFRMA can achieve lower access delay than framesynchronous grant-free rateless multiple access(FSGF-RMA),with extreme reliability enabled by rateless coding.To support FA-GF-RMA in more practical scenarios,a joint activity and data detection(JADD)scheme is proposed.Exploiting the feature of sporadic traffic,approximate message passing(AMP)is exploited for transmission signal matrix estimation.Then,to determine the packet start points,a maximum posterior probability(MAP)estimation problem is solved based on the recovered transmitted signals,leveraging the intrinsic power pattern in the codeword.An iterative power-pattern-aided AMP algorithm is devised to enhance the estimation performance of AMP.Simulation results verify that the proposed solution achieves a delay performance that is comparable to the performance limit of FA-GF-RMA.展开更多
In this paper, we propose a novel multiple access rateless network coding scheme for machine-to-machine （M 2M） communications. The presented scheme is capable of increasing transmission efficiency by reducing occupi...In this paper, we propose a novel multiple access rateless network coding scheme for machine-to-machine （M 2M） communications. The presented scheme is capable of increasing transmission efficiency by reducing occupied time slots yet with high decoding suc-cess rates. Unlike existing state-of-the-art distributed rateless coding schemes, the proposed rateless network coding can dynami-cally recode by using simple yet effective XOR operations, which is suitable for M2M erasure networks. Simulation results and analysis demonstrate that the proposed scheme outperforms the existing distributed rateless network coding schemes in the scenar-io of M2M multicast network with heterogeneous erasure features.展开更多
The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of...The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.展开更多
This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols wh...This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols whose absolute value of logarithm likelihood ratio （LLR） is lower than the threshold are removed, together with their corresponding edges, and thus not involved in the decoding process. The relationship between the deletion probability and the likelihood ratio deletion threshold is derived. The average mutual information per received symbol is analyzed in the case of deletion. The required number of symbols for the decoder to keep the same performance as regular decoding decreases since the average mutual information per symbol increases with the deletion, thus reducing the decoding complexity. This paper analyzes the reduction of decoding computations and the consequent transmission efficiency loss from the perspective of mutual information. The simulation results of decoding performance are consistent with those of the theoretical analysis, which show that the method can effectively reduce the decoding complexity at the cost of a slight loss of transmission efficiency.展开更多
This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on hal...This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on half-duplex mode. Then, we give out receiving diversity relay scheme and coding diversity relay scheme, and present their jointly decoding methods. Furthermore, we discuss the performance of the two schemes with different power allocation coefficients. Simulations show that our relay schemes can achieve different gain with the help of relay node. And, we should allocate power to source node to just guarantee relay node can decode successfully, and allocate remain power to relay node as far as possible. In this way, this DF relay system not only achieves diversity gain, but also achieves higher and smooth spectrum efficiency.展开更多
Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and lo...Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and low complexity is presented, and the optimal design methods of building rateless codes are also proposed. In CRN, anti-jamming rateless coding could recover the lost packets in parallel channels of cognitive OFDM, thus it protects Secondary Users (SUs) from the in-terference by Primary Users (PUs) efficiently. Frame Error Rate (FER) and throughput performance of SU employing anti-jamming rateless coding are analyzed in detail. Performance comparison between rateless coding and piecewise coding are also presented. It is shown that, anti-jamming rateless coding provides low FER and Word Error Rate (WER) performance with uniform sub-channel selection. Meanwhile, it is also verified that, in higher jamming rate and longer code redundancy scenario, rateless coding method could achieve better FER and throughput performance than another anti-jamming coding schemes.展开更多
Data-partitioning of IPTV video streams is a way of providing graceful quality degradation in a form that will work in good and difficult wireless channel conditions, as experienced by mobile devices. This paper’s pr...Data-partitioning of IPTV video streams is a way of providing graceful quality degradation in a form that will work in good and difficult wireless channel conditions, as experienced by mobile devices. This paper’s proposal is to combine redundant slice protection along with an adaptive channel coding scheme that is also proposed in the paper. Adaptive channel coding is achieved by retransmission when necessary of additional redundant data to reconstruct corrupted packets. In the proposal, outright packet loss is provided for by a form of redundant slice protection. The paper finds that it is preferable: not to simply protect only the highest priority packets;that a moderate quantization level should be employed;and that video quality is differentiated by content type. It is important also to configure the partitioning correctly to remove inter-partition dependencies when possible.展开更多
In cognitive relay networks, the transmission of Secondary Users （SUs） suffers from the activity of Primary Users （PUs） and wireless channel fading. Therefore, how to achieve robust transmission for cognitive rela...In cognitive relay networks, the transmission of Secondary Users （SUs） suffers from the activity of Primary Users （PUs） and wireless channel fading. Therefore, how to achieve robust transmission for cognitive relay networks is a challenging task. In this paper, we propose a relaying transmission scheme which exploits robust beamforming at the physical layer and rateless codes at higher layers. We derive the optirml beamforng weight vector and analyze the perforrmnce of the pro- posed scheme when the channel estirmtion is not accurate between two SU nodes. We also study how the anaount of channel information between SU and PU impacts the system perforroance. Sinlation results validate our theoretical analysis and demonstrate that the proposed scheme can signifi- cantly enhance the system throughput.展开更多
Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rat...Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.展开更多
基金supported by the National Natural Science Foundation of China(61601147)the Beijing Natural Science Foundation(L182032)。
文摘In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.
基金supported by the projects as follows,Key Research and Development Program of China(2018YFB1801102)the Key Research and Development Program of China(2020YFB1806603)+3 种基金Fundamental Research Funds for the Central Universities under Grant 2242022k60006Tsinghua University-China Mobile Communications Group Co.,Ltd.Joint Institute,Civil Aerospace Technology Project(D040202)National Natural Science Foundation of China(Grant No.92067206)TsinghuaQualcomm Joint Project,Tsinghua University Initiative Scientific Research Program(20193080005)。
文摘This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.Rateless coding is introduced to enhance the reliability of the system.Previous literature has shown that FA-GFRMA can achieve lower access delay than framesynchronous grant-free rateless multiple access(FSGF-RMA),with extreme reliability enabled by rateless coding.To support FA-GF-RMA in more practical scenarios,a joint activity and data detection(JADD)scheme is proposed.Exploiting the feature of sporadic traffic,approximate message passing(AMP)is exploited for transmission signal matrix estimation.Then,to determine the packet start points,a maximum posterior probability(MAP)estimation problem is solved based on the recovered transmitted signals,leveraging the intrinsic power pattern in the codeword.An iterative power-pattern-aided AMP algorithm is devised to enhance the estimation performance of AMP.Simulation results verify that the proposed solution achieves a delay performance that is comparable to the performance limit of FA-GF-RMA.
基金supported in part by Natural Scientific Research Innovation Foundation in Harbin Institute of Technology under Grant No.HIT.NSRIF 2017051Shenzhen Basic Research Program under Grant Nos.JCYJ20150930150304185 and JCYJ2016 0328163327348National High Technology Research & Development Program of China under Grant No.2014AA01A704
文摘In this paper, we propose a novel multiple access rateless network coding scheme for machine-to-machine （M 2M） communications. The presented scheme is capable of increasing transmission efficiency by reducing occupied time slots yet with high decoding suc-cess rates. Unlike existing state-of-the-art distributed rateless coding schemes, the proposed rateless network coding can dynami-cally recode by using simple yet effective XOR operations, which is suitable for M2M erasure networks. Simulation results and analysis demonstrate that the proposed scheme outperforms the existing distributed rateless network coding schemes in the scenar-io of M2M multicast network with heterogeneous erasure features.
基金Supported by the National Science and Technology Support Program(Y2140161A5)the National High Technology Research and Development Program of China(863Program)(O812041A04)
文摘The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.
基金supported by the National Natural Science Foundation of China (61471076)the Program for Changjiang Scholars and Innovative Research Team in University (IRT1299)the Special Fund of Chongqing Key Laboratory (CSTC)
文摘This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols whose absolute value of logarithm likelihood ratio （LLR） is lower than the threshold are removed, together with their corresponding edges, and thus not involved in the decoding process. The relationship between the deletion probability and the likelihood ratio deletion threshold is derived. The average mutual information per received symbol is analyzed in the case of deletion. The required number of symbols for the decoder to keep the same performance as regular decoding decreases since the average mutual information per symbol increases with the deletion, thus reducing the decoding complexity. This paper analyzes the reduction of decoding computations and the consequent transmission efficiency loss from the perspective of mutual information. The simulation results of decoding performance are consistent with those of the theoretical analysis, which show that the method can effectively reduce the decoding complexity at the cost of a slight loss of transmission efficiency.
文摘This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on half-duplex mode. Then, we give out receiving diversity relay scheme and coding diversity relay scheme, and present their jointly decoding methods. Furthermore, we discuss the performance of the two schemes with different power allocation coefficients. Simulations show that our relay schemes can achieve different gain with the help of relay node. And, we should allocate power to source node to just guarantee relay node can decode successfully, and allocate remain power to relay node as far as possible. In this way, this DF relay system not only achieves diversity gain, but also achieves higher and smooth spectrum efficiency.
基金Supported by the National Natural Science Foundation of China (No. 60972039)the Scientific Planning Project of Zhejiang Province entitled "Research and Development of Smart Antenna for the Next Generation Mobile Com-munications Based on TDD"the Young Staff Startup Research Foundation of Hangzhou Dianzi University entitled "Research on Key Technologies of Resource Allocation in Cognitive Radio Networks Based on Multicarrier Modulation"
文摘Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and low complexity is presented, and the optimal design methods of building rateless codes are also proposed. In CRN, anti-jamming rateless coding could recover the lost packets in parallel channels of cognitive OFDM, thus it protects Secondary Users (SUs) from the in-terference by Primary Users (PUs) efficiently. Frame Error Rate (FER) and throughput performance of SU employing anti-jamming rateless coding are analyzed in detail. Performance comparison between rateless coding and piecewise coding are also presented. It is shown that, anti-jamming rateless coding provides low FER and Word Error Rate (WER) performance with uniform sub-channel selection. Meanwhile, it is also verified that, in higher jamming rate and longer code redundancy scenario, rateless coding method could achieve better FER and throughput performance than another anti-jamming coding schemes.
文摘Data-partitioning of IPTV video streams is a way of providing graceful quality degradation in a form that will work in good and difficult wireless channel conditions, as experienced by mobile devices. This paper’s proposal is to combine redundant slice protection along with an adaptive channel coding scheme that is also proposed in the paper. Adaptive channel coding is achieved by retransmission when necessary of additional redundant data to reconstruct corrupted packets. In the proposal, outright packet loss is provided for by a form of redundant slice protection. The paper finds that it is preferable: not to simply protect only the highest priority packets;that a moderate quantization level should be employed;and that video quality is differentiated by content type. It is important also to configure the partitioning correctly to remove inter-partition dependencies when possible.
基金Acknowledgements The authors would like to thank the editor and anonymous reviewers for their detailed reviews and constructive comments, which have helped to greatly improve the quality of this paper. This work was supported by the National Natural Science Foundation of China under Grants No. 60832008, No. 60902001 Beijing Natural Science Foundation Program and Scientific Research Key Program of Beijing Municipal Commission of Education under Grant No. KZ201010009009 the Tsinghua National Laboratory for Infomation Science and Technology （TNList） Cross-discipline Foundation.
文摘In cognitive relay networks, the transmission of Secondary Users （SUs） suffers from the activity of Primary Users （PUs） and wireless channel fading. Therefore, how to achieve robust transmission for cognitive relay networks is a challenging task. In this paper, we propose a relaying transmission scheme which exploits robust beamforming at the physical layer and rateless codes at higher layers. We derive the optirml beamforng weight vector and analyze the perforrmnce of the pro- posed scheme when the channel estirmtion is not accurate between two SU nodes. We also study how the anaount of channel information between SU and PU impacts the system perforroance. Sinlation results validate our theoretical analysis and demonstrate that the proposed scheme can signifi- cantly enhance the system throughput.
基金Project supported by the National Basic Research Program (973) of China (Nos. 2009CB320405 and 2012CB316104)the National High-Tech R & D Program (863) of China (No. 2007AA01Z257)+1 种基金the National Natural Science Foundation of China (No. 60972057)the National Science & Technology Major Project of China (Nos. 2009ZX03003-004-03 and 2010ZX03003-003-01)
文摘Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.
