اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGeometric Sequence Decomposition with $k$-simplexes Transform
54
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We present spatial-Slepian transform~(SST) for the representation of signals on the sphere to support localized signal analysis. We use well-optimally concentrated Slepian functions, obtained by solving the Slepian spatial-spectral concentration prob
lem of finding bandlimited and spatially optimally concentrated functions on the sphere, to formulate the proposed transform and obtain the joint spatial-Slepian domain representation of the signal. Due to the optimal energy concentration of the Slepian functions in the spatial domain, the proposed spatial-Slepian transform allows us to probe spatially localized content of the signal. Furthermore, we present an inverse transform to recover the signal from the spatial-Slepian coefficients, and show that well-optimally concentrated rotated Slepian functions form a tight frame on the sphere. We develop an algorithm for the fast computation of the spatial-Slepian transform and carry out computational complexity analysis. We present the formulation of SST for zonal Slepian functions, which are spatially optimally concentrated in the polar cap~(axisymmetric) region, and provide an illustration using the Earth topography map. To demonstrate the utility of the proposed transform, we carry out localized variation analysis; employing SST for detecting hidden localized variations in the signal.
The sparsity of multipaths in wideband channel has motivated the use of compressed sensing for channel estimation. In this letter, we propose an entirely different approach to sparse channel estimation. We exploit the fact that $L$ taps of channel im
pulse response in time domain constitute a non-orthogonal superposition of $L$ geometric sequences in frequency domain. This converts the channel estimation problem into the extraction of the parameters of geometric sequences. Notably, the proposed scheme achieves the error-free estimation of the whole bandwidth with a few pilot symbols if the excess delay is bounded to a certain value.
In this study, we propose an approach to constructing on-off keying (OOK) symbols for wake-up radios (WURs) by using sequences in the frequency domain. The proposed method enables orthogonal multiplexing of wake-up signals (WUSs) and orthogonal frequ
ency division multiplexing (OFDM) waveforms. We optimize the sequences with a tractable algorithm by considering the reliability of WUSs in fading channels. The proposed algorithm relies on an alternating minimization technique, i.e. cyclic algorithm-new (CAN), which was originally proposed for obtaining a unimodular sequence with good aperiodic correlation properties. In this study, we extend CAN to generate OOK waveforms with Manchester coding. We demonstrate the performance of four optimized sequences and compare with state-of-the-art approaches. We show that the proposed scheme improves the wake-up radio receiver (WURx) performance by controlling the energy distribution in frequency domain while removing the interference-floor at the OFDM receiver.
In this paper we revisit the deterministic version of the Sparse Fourier Transform problem, which asks to read only a few entries of $x in mathbb{C}^n$ and design a recovery algorithm such that the output of the algorithm approximates $hat x$, the Di
screte Fourier Transform (DFT) of $x$. The randomized case has been well-understood, while the main work in the deterministic case is that of Merhi et al.@ (J Fourier Anal Appl 2018), which obtains $O(k^2 log^{-1}k cdot log^{5.5}n)$ samples and a similar runtime with the $ell_2/ell_1$ guarantee. We focus on the stronger $ell_{infty}/ell_1$ guarantee and the closely related problem of incoherent matrices. We list our contributions as follows. 1. We find a deterministic collection of $O(k^2 log n)$ samples for the $ell_infty/ell_1$ recovery in time $O(nk log^2 n)$, and a deterministic collection of $O(k^2 log^2 n)$ samples for the $ell_infty/ell_1$ sparse recovery in time $O(k^2 log^3n)$. 2. We give new deterministic constructions of incoherent matrices that are row-sampled submatrices of the DFT matrix, via a derandomization of Bernsteins inequality and bounds on exponential sums considered in analytic number theory. Our first construction matches a previous randomized construction of Nelson, Nguyen and Woodruff (RANDOM12), where there was no constraint on the form of the incoherent matrix. Our algorithms are nearly sample-optimal, since a lower bound of $Omega(k^2 + k log n)$ is known, even for the case where the sensing matrix can be arbitrarily designed. A similar lower bound of $Omega(k^2 log n/ log k)$ is known for incoherent matrices.
Sequences play an important role in many engineering applications and systems. Searching sequences with desired properties has long been an interesting but also challenging research topic. This article proposes a novel method, called HpGAN, to search
desired sequences algorithmically using generative adversarial networks (GAN). HpGAN is based on the idea of zero-sum game to train a generative model, which can generate sequences with characteristics similar to the training sequences. In HpGAN, we design the Hopfield network as an encoder to avoid the limitations of GAN in generating discrete data. Compared with traditional sequence construction by algebraic tools, HpGAN is particularly suitable for intractable problems with complex objectives which prevent mathematical analysis. We demonstrate the search capabilities of HpGAN in two applications: 1) HpGAN successfully found many different mutually orthogonal complementary code sets (MOCCS) and optimal odd-length Z-complementary pairs (OB-ZCPs) which are not part of the training set. In the literature, both MOCSSs and OB-ZCPs have found wide applications in wireless communications. 2) HpGAN found new sequences which achieve four-times increase of signal-to-interference ratio--benchmarked against the well-known Legendre sequence--of a mismatched filter (MMF) estimator in pulse compression radar systems. These sequences outperform those found by AlphaSeq.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
