期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Compactly Supported Distributional Solutions of Nonstationary Nonhomogeneous Refinement Equations 被引量:1
1
作者 Qi Yu SUN 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2001年第1期1-14,共14页
Let A be a matrix with the absolute values of all eigenvalues strictly larger than one, and let Z<sub>0</sub> be a subset of Z such that n∈Z<sub>0</sub> implies n+1∈Z<sub>0</sub>.... Let A be a matrix with the absolute values of all eigenvalues strictly larger than one, and let Z<sub>0</sub> be a subset of Z such that n∈Z<sub>0</sub> implies n+1∈Z<sub>0</sub>. Denote the space of all compactly supported distributions by D’, and the usual convolution between two compactly supported distributions f and g by f*g. For any bounded sequence G<sub>n</sub> and H<sub>n</sub>, n∈Z<sub>0</sub>, in D’, define the corresponding nonstationary nonhomogeneous refinement equation Φ<sub>n</sub>=H<sub>n</sub>*Φ<sub>n+1</sub>(A.)+G<sub>n</sub> for all n∈Z<sub>0</sub>, (*) where Φ<sub>n</sub>, n∈Z<sub>0</sub>, is in a bounded set of D’. The nonstationary nonhomogeneous refinement equation (*) arises in the construction of wavelets on bounded domain, multiwavelets, and of biorthogonal wavelets on nonuniform meshes. In this paper, we study the existence problem of compactly supported distributional solutions Φ<sub>n</sub>, n∈Z<sub>0</sub>, of the equation (*). In fact, we reduce the existence problem to finding a bounded solution F<sub>n</sub> of the linear equations <sub>n</sub>-S<sub>n</sub> <sub>n+1</sub>= <sub>n</sub> for all n∈Z<sub>0</sub>, where the matrices S<sub>n</sub> and the vectors <sub>n</sub>, n∈Z<sub>0</sub>, can be constructed explicitly from H<sub>n</sub> and G<sub>n</sub> respectively. The results above are still new even for stationary nonhomogeneous refinement equations. 展开更多
关键词 Nonhomogeneous refinement equation Nonstationary refinement equation colltinuous refinement equation Refinement equation WAVELETS
原文传递
BINARY SEQUENCE WITH PERFECT SPREADING STAIRCASE PROFILE OF LINEAR COMPLEXITY
2
作者 YANG Yi-clan SUN Dengfeng (Department of Information Engineering, Beijing University of Posts & Telecommunications, Be iiing 100088 China) 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1997年第1期75-79,共5页
This paper makes the following investigations.1. To solve the second open problem proposed by M.Morii and M.Kasahar[1];2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) density;3. To find the... This paper makes the following investigations.1. To solve the second open problem proposed by M.Morii and M.Kasahar[1];2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) density;3. To find the PSSP sequence with (complementary) Hamming weight m for every positive integer m;4. To propose a generalization form of the known IYM sequence. 展开更多
关键词 Linear complexity PSEUDO-RANDOM sequence colltinued FRACTION CRYPTOGRAPHY
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部