A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,...A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart（a shift mapping）,but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.展开更多
Recently, Du has given a new strong definition of chaos by using the shift map. In this paper, we give a proof of the main theorem by constructing a dense uncountable invariant subset of the symbol space E2 containing...Recently, Du has given a new strong definition of chaos by using the shift map. In this paper, we give a proof of the main theorem by constructing a dense uncountable invariant subset of the symbol space E2 containing transitive points in a simpler way with the help of a different metric. We also provide two examples, which support this new definition.展开更多
This paper deals with chaos for subshifts of finite type. We show that for any subshift of finite type determined by an irreducible and aperiodic matrix, there is a finitely chaotic set with full Hausdorff dimension. ...This paper deals with chaos for subshifts of finite type. We show that for any subshift of finite type determined by an irreducible and aperiodic matrix, there is a finitely chaotic set with full Hausdorff dimension. Moreover, for any subshift of finite type determined by a matrix, we point out that the cases including positive topological entropy, distributional chaos, chaos and Devaney chaos are mutually equivalent.展开更多
We present a sufficient and necessary condition for the subshift of finite type to be a measure-preserving transformation or to be a strong mixing measure-preserving transformation with respect to the Hausdorff measur...We present a sufficient and necessary condition for the subshift of finite type to be a measure-preserving transformation or to be a strong mixing measure-preserving transformation with respect to the Hausdorff measure. It is proved that a strong mixing subshift of finite type has a chaotic set with full Hausdorff measure.展开更多
A modified constant modulus algorithm (MCMA) for blind channel equalization is proposed by modifying the constant modulus error function. The MCMA is compared with the conventional constant modulus algorithm (CMA) for...A modified constant modulus algorithm (MCMA) for blind channel equalization is proposed by modifying the constant modulus error function. The MCMA is compared with the conventional constant modulus algorithm (CMA) for symbol-spaced equalization of 4PSK signals. The result shows that the performance of the MCMA is superior to that of the CMA in both convergence rate and intersymbol interference for frequency selective channels in noisy environments. Simulation results using 8PSK signals also demonstrate that a fractionally spaced equalizer can preserve performance over variations in symbol-timing phase, whereas a baud-rate equalizer cannot.展开更多
基金supported by Latvian Scientific(09.1220)ESF Project(2009/0223/1DP/1.1.1.2.0/09APIA/VIAA/008)
文摘A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart（a shift mapping）,but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.
基金CSIR (project no. F.NO. 8/3 (45)/2005-EMR-I) for their financial support
文摘Recently, Du has given a new strong definition of chaos by using the shift map. In this paper, we give a proof of the main theorem by constructing a dense uncountable invariant subset of the symbol space E2 containing transitive points in a simpler way with the help of a different metric. We also provide two examples, which support this new definition.
基金National Natural Science Funds of China (10171034)
文摘This paper deals with chaos for subshifts of finite type. We show that for any subshift of finite type determined by an irreducible and aperiodic matrix, there is a finitely chaotic set with full Hausdorff dimension. Moreover, for any subshift of finite type determined by a matrix, we point out that the cases including positive topological entropy, distributional chaos, chaos and Devaney chaos are mutually equivalent.
基金Supported by National Natural Science Foundation of China （Grant No. 60763009）
文摘We present a sufficient and necessary condition for the subshift of finite type to be a measure-preserving transformation or to be a strong mixing measure-preserving transformation with respect to the Hausdorff measure. It is proved that a strong mixing subshift of finite type has a chaotic set with full Hausdorff measure.
基金the National Natural Science Foundation of China (60072001)
文摘A modified constant modulus algorithm (MCMA) for blind channel equalization is proposed by modifying the constant modulus error function. The MCMA is compared with the conventional constant modulus algorithm (CMA) for symbol-spaced equalization of 4PSK signals. The result shows that the performance of the MCMA is superior to that of the CMA in both convergence rate and intersymbol interference for frequency selective channels in noisy environments. Simulation results using 8PSK signals also demonstrate that a fractionally spaced equalizer can preserve performance over variations in symbol-timing phase, whereas a baud-rate equalizer cannot.
