Learn More
In this paper we study the recovery conditions of weighted l 1 minimization for signal reconstruction from incomplete linear measurements when partial prior support information is available. We obtain that a high order RIP condition can guarantee stable and robust recovery of signals in bounded l 2 and Dantzig selector noise settings. Meanwhile, we not only(More)
In this paper we consider some dissipative versions of the modified Korteweg de Vries equation u t + u xxx + |D x | α u + u 2 u x = 0 with 0 < α ≤ 3. We prove some well-posedness results on the associated Cauchy problem in the Sobolev spaces H s (R) for s > 1/4 − α/4 on the basis of the [k; Z]−multiplier norm estimate obtained by Tao in [9] for KdV equation.
—Blind recognition of error-correcting code is an essential problem to decode intercepted data. In this paper, a method dedicated to the blind recognition of punctured convolutional encoders is presented. The blind recognition of such encoders is of great significance, because convolutional encoders are embedded in most digital transmission systems where(More)
We consider the fifth order Kadomtsev-Petviashvili I (KP-I) equation as ∂ t u + α∂ 3 x u + ∂ 5 x u + ∂ −1 x ∂ 2 y u + uu x = 0, while α ∈ R. We introduce an interpolated energy space E s to consider the well-posedeness of the initial value problem (IVP) of the fifth order KP-I equation. We obtain the local well-posedness of IVP of the fifth order KP-I(More)
The Kawahara and modified Kawahara equations are fifth-order KdV type equations and have been derived to model many physical phenomena such as gravity-capillary waves and magneto-sound propagation in plasmas. This paper establishes the local well-posedness of the initial-value problem for Kawahara equation in H s (R) with s > − 7 4 and the local(More)
Interleaving is commonly used to guard against burst errors since it provides a form of time diversity in the coded sequence. A novel algorithm for identifying the helical interleaving of the first type is presented based on the linear property of channel coding and the structure characteristic of the helical interleaver. We make use of the basis of(More)
In this paper, we introduce a weighted l2/l1 minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high order block RIP is derived to guarantee stable and robust recovery of block sparse signals via the weighted l2/l1 minimization. We(More)