نتایج جستجو برای: generalized fourier bessel transform
تعداد نتایج: 303462 فیلتر نتایج به سال:
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
This paper is about a new efficient method for the implementation of convolvers and correlators using the Fermat Number Transform (FNT) and the inverse (IFNT). The latter present advantages compared to Inverse Fast Fourier Transform (IFFT). An efficient state space method for implementing the Inverse FNT (IFNT) over rectangular windows is proposed for the cases where there is a large overlap be...
Fusion frames are a generalized form of frames in Hilbert spaces. In the present paper we introduce Bessel subfusion sequences and subfusion frames and we investigate the relationship between their operation. Also, the definition of the orthogonal complement of subfusion frames and the definition of the completion of Bessel fusion sequences are provided and several results related with these no...
We present an efficient and accurate algorithm for principal component analysis (PCA) of a large set of two-dimensional images and, for each image, the set of its uniform rotations in the plane and its reflection. The algorithm starts by expanding each image, originally given on a Cartesian grid, in the Fourier-Bessel basis for the disk. Because the images are essentially band limited in the Fo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید