Geometric Sequence Decomposition with $k$-simplexes Transform
This paper presents a computationally efficient technique for decomposing non-orthogonally superposed $k$ geometric sequences. The method, which is named as geometric sequence decomposition with $k$-simplexes transform (GSD-ST), is based on the concept of transforming an observed sequence to multiple $k$-simplexes in a virtual $k$-dimensional space and correlating the volumes of the transformed simplexes. Hence, GSD-ST turns the problem of decomposing $k$ geometric sequences into one of solving a $k$-th order polynomial equation. Our technique has significance for wireless communications because sampled points of a radio wave comprise a geometric sequence. This implies that GSD-ST is capable of demodulating randomly combined radio waves, thereby eliminating the effect of interference. To exemplify the potential of GSD-ST, we propose a new radio access scheme, namely non-orthogonal interference-free radio access (No-INFRA). Herein, GSD-ST enables the collision-free reception of uncoordinated access requests. Numerical results show that No-INFRA effectively resolves the colliding access requests when the interference is dominant.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Smooth Feedback Motion Planning with Reduced Curvature
Feedback motion planning over cell decompositions provides a robust method for generating collision-free robot motion with formal guarantees. However, existing algorithms often produce paths with unnecessary bending, lea…
Motion PlanningThe topology of higher-order complexes associated with brain-function hubs in human connectomes
Higher-order connectivity in complex systems described by simplexes of different orders provides a geometry for simplex-based dynamical variables and interactions. Simplicial complexes that constitute a functional geomet…
HippocampusVandermonde Trajectory Bounds for Linear Companion Systems
Fast and accurate safety assessment and collision checking are essential for motion planning and control of highly dynamic autonomous robotic systems. Informative, intuitive, and explicit motion trajectory bounds enable …
Motion Planningmotion predictionLoss Surface Simplexes for Mode Connecting Volumes and Fast Ensembling
With a better understanding of the loss surfaces for multilayer networks, we can build more robust and accurate training procedures. Recently it was discovered that independently trained SGD solutions can be connected al…
Multi-Scale Reversible Chaos Game Representation: A Unified Framework for Sequence Classification
Biological classification with interpretability remains a challenging task. For this, we introduce a novel encoding framework, Multi-Scale Reversible Chaos Game Representation (MS-RCGR), that transforms biological sequen…
Protein Language Model