A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to...A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to find a method for the correct generation to pave the way for future research.L1C codes are based on only one Legendre sequence which consists of Legendre symbols.To calculate these Legendre symbols,the Euler criterion is always used to evaluate quadratic residues.However,due to the great length of L1C codes,this procedure causes overflow problems.Therefore,the quadratic reciprocity law,some related theorems and properties are introduced to solve the problems.Moreover,if the quadratic reciprocity law,some related theorems and properties are used to calculate different Legendre symbols,the combination modes may vary,which causes a complex generation process.The proposed generation method deals with this complex generation process effectively.In addition,through simulations,it is found that the autocorrelation features of obtained Legendre sequences and L1C codes are in accordance with theoretical results,which proves the correctness of the proposed method.展开更多
LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)...LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.展开更多
基金supported by the National High Technology Research and Development Program of China(863Program)(2011AA110101)the National Basic Research Program of China(973Program)(2009CB724002)
文摘A new code concept is used for the L1 civil（L1C） signal of the global positioning system（GPS）.The generation of L1C codes is quite different from the generation of traditional ranging codes.Thus,it is necessary to find a method for the correct generation to pave the way for future research.L1C codes are based on only one Legendre sequence which consists of Legendre symbols.To calculate these Legendre symbols,the Euler criterion is always used to evaluate quadratic residues.However,due to the great length of L1C codes,this procedure causes overflow problems.Therefore,the quadratic reciprocity law,some related theorems and properties are introduced to solve the problems.Moreover,if the quadratic reciprocity law,some related theorems and properties are used to calculate different Legendre symbols,the combination modes may vary,which causes a complex generation process.The proposed generation method deals with this complex generation process effectively.In addition,through simulations,it is found that the autocorrelation features of obtained Legendre sequences and L1C codes are in accordance with theoretical results,which proves the correctness of the proposed method.
基金supported by Research Fund Chosun Univerity,2011
文摘LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only(1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.
