Reconstruction of functions in principal shift-invariant subspaces of mixed Lebesgue spaces
Abstract
In this paper, we discuss to the nonuniform sampling problem in principal shift-invariant subspaces of mixed Lebesgue spaces. We proposed a fast reconstruction algorithm which allows to exactly reconstruct the functions in the principal shift-invariant subspaces as long as the sampling set X=\(xj,yk):k,j∈ J\ is sufficiently dense. Our results improve the result in LiLiu.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.