Waseem Lone

Dr. Waseem Lone

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 April 2021 in Mathematical Methods in the Applied Sciences
Verified
Journal Article
Closed access
PDF file
FSFirdous Ahmad Shah
Firdous Ahmad Shah
KNKottakkaran Sooppy Nisar
Kottakkaran Sooppy Nisar
WLWaseem Lone
Waseem Lone
ATAzhar Y. Tantary
Azhar Y. Tantary

1 November 2021 in Optik
Verified
Journal Article
Closed access
FSFirdous Ahmad Shah
Firdous Ahmad Shah
WLWaseem Lone
Waseem Lone
ATAzhar Y. Tantary
Azhar Y. Tantary

15 November 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
Hari Mohan SrivastavaHari Mohan Srivastava
Hari Mohan Srivastava
FSFirdous Ahmad Shah
Firdous Ahmad Shah
TGTarun Kumar Garg
Tarun Kumar Garg
WLWaseem Lone
Waseem Lone
HQHuzaifa L. Qadri
Huzaifa L. Qadri
This study aims to achieve an efficient time-frequency representation of higher-dimensional signals by introducing the notion of a non-separable linear canonical wavelet transform in L2(Rn). The preliminary analysis encompasses the derivation of fundamental properties of the novel integral transform including the orthogonality relation, inversion formula, and the range theorem. To extend the scope of the study, we formulate several uncertainty inequalities, including the Heisenberg’s, logarithmic, and Nazorav’s inequalities for the proposed transform in the linear canonical domain. The obtained results are reinforced with illustrative examples.

8 October 2021 in Mathematical Methods in the Applied Sciences
Verified
Journal Article
Closed access
PDF file
FSFirdous Ahmad Shah
Firdous Ahmad Shah
WLWaseem Lone
Waseem Lone

23 September 2022 in Entropy
Verified
Journal Article
Open access
PDF file
Hari Mohan SrivastavaHari Mohan Srivastava
Hari Mohan Srivastava
WLWaseem Lone
Waseem Lone
FSFirdous Ahmad Shah
Firdous Ahmad Shah
AZAhmed I. Zayed
Ahmed I. Zayed
The discrete Fourier transform is considered as one of the most powerful tools in digital signal processing, which enable us to find the spectrum of finite-duration signals. In this article, we introduce the notion of discrete quadratic-phase Fourier transform, which encompasses a wider class of discrete Fourier transforms, including classical discrete Fourier transform, discrete fractional Fourier transform, discrete linear canonical transform, discrete Fresnal transform, and so on. To begin with, we examine the fundamental aspects of the discrete quadratic-phase Fourier transform, including the formulation of Parseval’s and reconstruction formulae. To extend the scope of the present study, we establish weighted and non-weighted convolution and correlation structures associated with the discrete quadratic-phase Fourier transform.

27 October 2022 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
FSFirdous A. Shah
Firdous A. Shah
WLWaseem Lone
Waseem Lone
KNKottakkaran Sooppy Nisar
Kottakkaran Sooppy Nisar
TAThabet Abdeljawad
Thabet Abdeljawad
The coupled fractional Fourier transform $\mathcal {F}_{\alpha ,\beta}$Fα,β is a two-dimensional fractional Fourier transform depending on two anglesαandβ, which are coupled in such a way that the transform parameters are $\gamma =(\alpha +\beta )/2$γ=(α+β)/2 and $\delta =(\alpha -\beta )/2$δ=(α−β)/2 . It generalizes the two-dimensional Fourier transform and serves as a prominent tool in some applications of signal and image processing. In this article, we formulate a new class of uncertainty inequalities for the coupled fractional Fourier transform (CFrFT). Firstly, we establish a sharp Heisenberg-type uncertainty inequality for the CFrFT and then formulate some logarithmic and local-type uncertainty inequalities. In the sequel, we establish several concentration-based uncertainty inequalities, including Nazarov, Amrein–Berthier–Benedicks, and Donoho–Stark’s inequalities. Towards the end, we formulate Hardy’s and Beurling’s inequalities for the CFrFT.