A modiΡed pseudo-noise（PN） code regeneration method is proposed to improve the clock tracking accuracy without impairing the code acquisition time performance.Thus,the method can meet the requirement of high accura...A modiΡed pseudo-noise（PN） code regeneration method is proposed to improve the clock tracking accuracy without impairing the code acquisition time performance.Thus,the method can meet the requirement of high accuracy ranging measurements in short time periods demanded by radio-science missions.The tracking error variance is derived by linear analysis.For some existing PN codes,which can be acquired rapidly,the tracking error variance performance of the proposed method is about 2.6 dB better than that of the JPL scheme（originally proposed by Jet Propulsion Laboratory）,and about 1.5 dB better than that of the traditional double loop scheme.展开更多
To improve the performance of composite pseudo-noise （PN） code clock recovery in a regenerative PN ranging system at a low symbol signal-to-noise ratio （SNR）, a novel chip tracking loop （CTL） used for regenerati...To improve the performance of composite pseudo-noise （PN） code clock recovery in a regenerative PN ranging system at a low symbol signal-to-noise ratio （SNR）, a novel chip tracking loop （CTL） used for regenerative PN ranging clock recovery is adopted. The CTL is a modified data transition tracking loop （DTTL）. The difference between them is that the Q channel output of the CTL is directly multiplied by a clock component, while that of the DTTL is multiplied by the Ⅰ channel transition detector output. Under the condition of a quasi-squareware PN ranging code, the tracking （ mean square timing jitter） performance of the CTL is analyzed. The tracking performances of the CTL and the DTTL, are compared over a wide range of symbol SNRs. The result shows that the CTL and the DTTL have the same performance at a large symbol SNR, while at a low symbol SNR, the former offers a noticeable enhancement.展开更多
Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual perm...Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.展开更多
The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we stud...The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we study self-dual codes over R_∞by means of self-dual codes over Ri,and give some characterizations of self-dual codes over R_∞.展开更多
In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power s...In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.展开更多
A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L ...A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.展开更多
The capabilities of decoding beyond the bound of the Complex-Rotary code （CRcodes） and its dual code are analyzed. It is obtained that the CR codes with normal error-correcting ability t = （p+1）/2 can correct （t+...The capabilities of decoding beyond the bound of the Complex-Rotary code （CRcodes） and its dual code are analyzed. It is obtained that the CR codes with normal error-correcting ability t = （p+1）/2 can correct （t+1）-errors up to C<sub>p<sup>2</sup>+p（p+1）</sub><sup>t+1</sup>-p<sup>2Ct</sup><sub>2t+1</sub> and itsdual code can correct （t<sub>1</sub>+1）-errors up to C<sub>p<sup>2</sup>+2tp</sub><sup>t<sub>1</sub>+1</sup>-2tpC<sub>p+1</sub><sup>t<sub>1</sub>+1</sup> where t<sub>1</sub>=（p+1）/2-1 and pis a prime.展开更多
This paper proposes a cross-layer dual adaptive coded modulation architecture using turbo codes for mobile multimedia communication, which adapts to both the varying channel characteristics and the QoS of various mult...This paper proposes a cross-layer dual adaptive coded modulation architecture using turbo codes for mobile multimedia communication, which adapts to both the varying channel characteristics and the QoS of various multimedia services simultancously to increase the average system throughput substantially. A pragmatic channeladaptive turbo coded modulation schcme, which comes within 2.5 dB of the Shannon limit, is optimally designed, and then a QoS-adaptive scheme is superimposed to build the dual adaptive architecture. Simulation results show that the novel dual adaption reduces the gap from the fading channel capacity to 2 dB when assuming different services occur in equal probability and the service duration follows exponential distribution.展开更多
In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized...In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes.展开更多
In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner pro...In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.展开更多
The ionospheric time delay is one of the main error sources in C/A code GPS navigation and positioning applications. In this paper, a method is proposed for real-time dual-frequency ionospheric time-delay correcting u...The ionospheric time delay is one of the main error sources in C/A code GPS navigation and positioning applications. In this paper, a method is proposed for real-time dual-frequency ionospheric time-delay correcting using a C/A code GPS receiver, and the principle of the circuit block diagram for this method is analyzed with its feasibility theoretically demonstrated.展开更多
Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, ...Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.展开更多
基金supported by the National Natural Science Foundation of China (60904090)the Postdoctoral Science Foundation of China(20080431306)the Special Postdoctoral Science Foundation of China (20081458)
文摘A modiΡed pseudo-noise（PN） code regeneration method is proposed to improve the clock tracking accuracy without impairing the code acquisition time performance.Thus,the method can meet the requirement of high accuracy ranging measurements in short time periods demanded by radio-science missions.The tracking error variance is derived by linear analysis.For some existing PN codes,which can be acquired rapidly,the tracking error variance performance of the proposed method is about 2.6 dB better than that of the JPL scheme（originally proposed by Jet Propulsion Laboratory）,and about 1.5 dB better than that of the traditional double loop scheme.
文摘To improve the performance of composite pseudo-noise （PN） code clock recovery in a regenerative PN ranging system at a low symbol signal-to-noise ratio （SNR）, a novel chip tracking loop （CTL） used for regenerative PN ranging clock recovery is adopted. The CTL is a modified data transition tracking loop （DTTL）. The difference between them is that the Q channel output of the CTL is directly multiplied by a clock component, while that of the DTTL is multiplied by the Ⅰ channel transition detector output. Under the condition of a quasi-squareware PN ranging code, the tracking （ mean square timing jitter） performance of the CTL is analyzed. The tracking performances of the CTL and the DTTL, are compared over a wide range of symbol SNRs. The result shows that the CTL and the DTTL have the same performance at a large symbol SNR, while at a low symbol SNR, the former offers a noticeable enhancement.
基金Supported by the National Natural Science Foundation of China (60373087, 60473023, 90104005, 60673071)
文摘Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.
基金Foundation item： Supported by the Scientific Research Foundation of Hubei Provincial Education Depart- ment（B2013069） Supported by the National Science Foundation of Hubei Polytechnic University（12xjzl4A, 11yjz37B）
文摘The codes of formal power series rings R_∞=F[[r]]={sum from i=0 to ∞(a_lr^l|a_l∈F)}and finite chain rings R_i={a_0+a_1r+…+a_(i-1)r^(i-1)|a_i∈F}have close relationship in lifts and projection.In this paper,we study self-dual codes over R_∞by means of self-dual codes over Ri,and give some characterizations of self-dual codes over R_∞.
文摘In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.
基金The National Natural Science Foundation of China (No60472018)
文摘A definition of a self-dual code on graph and a procedure based on factor graphs to judge a self-dual code were presented. Three contributions of this paper were described as follows. To begin with, transform T_ R→L were defined, which was the basis of self-dual codes defined on graphs and played a key role in the paper. The second were that a self-dual code could be defined on factor graph, which was much different from conventional algebraic method. The third was that a factor graph approach to judge a self-dual code was illustrated, which took advantage of duality properties of factor graphs and our proposed transform T_ R→L to offer a convenient and geometrically intuitive process to judge a self-dual code.
文摘The capabilities of decoding beyond the bound of the Complex-Rotary code （CRcodes） and its dual code are analyzed. It is obtained that the CR codes with normal error-correcting ability t = （p+1）/2 can correct （t+1）-errors up to C<sub>p<sup>2</sup>+p（p+1）</sub><sup>t+1</sup>-p<sup>2Ct</sup><sub>2t+1</sub> and itsdual code can correct （t<sub>1</sub>+1）-errors up to C<sub>p<sup>2</sup>+2tp</sub><sup>t<sub>1</sub>+1</sup>-2tpC<sub>p+1</sub><sup>t<sub>1</sub>+1</sup> where t<sub>1</sub>=（p+1）/2-1 and pis a prime.
基金This work is supported by the High Technology Research and Development Program of China(No. 2001AA121031)the National Natural Science Foundation of China (No. 60072028)
文摘This paper proposes a cross-layer dual adaptive coded modulation architecture using turbo codes for mobile multimedia communication, which adapts to both the varying channel characteristics and the QoS of various multimedia services simultancously to increase the average system throughput substantially. A pragmatic channeladaptive turbo coded modulation schcme, which comes within 2.5 dB of the Shannon limit, is optimally designed, and then a QoS-adaptive scheme is superimposed to build the dual adaptive architecture. Simulation results show that the novel dual adaption reduces the gap from the fading channel capacity to 2 dB when assuming different services occur in equal probability and the service duration follows exponential distribution.
文摘In this paper, we construct MDS Euclidean self-dual codes which are ex-tended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and constacyclic codes.
基金supported in part by the National Science Foundation of China under Grant 11571005in part by the Key Research Project of Higher Education of the Education Department of Henan Province under Grant 19A120010
文摘In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
文摘In this paper, we discuss a kind of Hermitian inner product - symplectic inner product, which is different from the original inner product - Euclidean inner product. According to the definition of symplectic inner product, the codes under the symplectic inner product have better properties than those under the general Hermitian inner product. Here we present the necessary and sufficient condition for judging whether a linear code C over Fp with a generator matrix in the standard form is a symplectic self-dual code. In addition, we give a method for constructing a new symplectic self-dual codes over Fp, which is simpler than others.
文摘The ionospheric time delay is one of the main error sources in C/A code GPS navigation and positioning applications. In this paper, a method is proposed for real-time dual-frequency ionospheric time-delay correcting using a C/A code GPS receiver, and the principle of the circuit block diagram for this method is analyzed with its feasibility theoretically demonstrated.
文摘Deep holes are very important in the decoding of generalized RS codes, and deep holes of RS codes have been widely studied, but there are few works on constructing general linear codes based on deep holes. Therefore, we consider constructing binary linear codes by combining deep holes with binary BCH codes. In this article, we consider the 2-error-correcting binary primitive BCH codes and the extended codes to construct new binary linear codes by combining them with deep holes, respectively. Furthermore, three classes of binary linear codes are constructed, and then we determine the parameters and the weight distributions of these new binary linear codes.
