Gauss-Ramanujan Functions: Constructions, Properties, and Applications in Communications and Signal Processing
In this article, I construct a new set of functions based on Ramanujan sequences (RSEs), Gaussian pulse (GP), and its delayed Gaussian pulse (DGP). The motivation for this construction is based on the special properties of RSEs, GP, and DGP. First, I present a procedure for constructing Gauss-Ramanujan (GauRam) functions using selected RSEs. I develop an insightful analysis for deterministic and stochastic overlap between GP and DGP. Specifically, I present exact and closed form approximation expressions for delay-averaged GP and DGP overlap and then evaluate them numerically. Later, I derive and analyze the mathematical (spectral) properties of selected GauRam functions. I extend the analysis by analyzing the Hilbert transform of the first-order GauRam function and validating orthogonality and its usefulness in analytic signal representations. Furthermore, I present insightful applications of these functions in communications and signal processing. Specifically, I present the continuous-wave Gauss-Ramanujan modulation (GRM) scheme, Gauss-Ramanujan Shift Keying (GRSK) scheme, and Gauss-Ramanujan wavelets and their analysis and comparisons with benchmarking. The desirable properties of these novel modulation schemes and wavelets enable their use in next-generation hybrid and energy-efficient communication systems and signal processing.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
New and Explicit Constructions of Unbalanced Ramanujan Bipartite Graphs
The objectives of this article are three-fold. Firstly, we present for the first time explicit constructions of an infinite family of \textit{unbalanced} Ramanujan bigraphs. Secondly, we revisit some of the known methods…
Matrix CompletionRevisiting the Lottery Ticket Hypothesis: A Ramanujan Graph Perspective
Neural networks often yield to weight pruning resulting in a sparse subnetwork that is adequate for a given task. Retraining these `lottery ticket' subnetworks from their initialization minimizes the computational burden…
Ramanujan Graph Rewiring with Non Negative Resistance Curvature
Graph Neural Networks (GNNs) have emerged as a powerful paradigm for learning on graph-structured data by iteratively propagating and aggregating information across edges. However, conventional message passing schemes of…
When Ramanujan meets time-frequency analysis in complicated time series analysis
To handle time series with complicated oscillatory structure, we propose a novel time-frequency (TF) analysis tool that fuses the short time Fourier transform (STFT) and periodic transform (PT). Since many time series os…
Time SeriesTime Series AnalysisHierarchical Non-Stationary Temporal Gaussian Processes With $L^1$-Regularization
This paper is concerned with regularized extensions of hierarchical non-stationary temporal Gaussian processes (NSGPs) in which the parameters (e.g., length-scale) are modeled as GPs. In particular, we consider two commo…
Gaussian Processesregression