4,862 research outputs found
A baseband wireless spectrum hypervisor for multiplexing concurrent OFDM signals
The next generation of wireless and mobile networks will have to handle a significant increase in traffic load compared to the current ones. This situation calls for novel ways to increase the spectral efficiency. Therefore, in this paper, we propose a wireless spectrum hypervisor architecture that abstracts a radio frequency (RF) front-end into a configurable number of virtual RF front ends. The proposed architecture has the ability to enable flexible spectrum access in existing wireless and mobile networks, which is a challenging task due to the limited spectrum programmability, i.e., the capability a system has to change the spectral properties of a given signal to fit an arbitrary frequency allocation. The proposed architecture is a non-intrusive and highly optimized wireless hypervisor that multiplexes the signals of several different and concurrent multi-carrier-based radio access technologies with numerologies that are multiple integers of one another, which are also referred in our work as radio access technologies with correlated numerology. For example, the proposed architecture can multiplex the signals of several Wi-Fi access points, several LTE base stations, several WiMAX base stations, etc. As it able to multiplex the signals of radio access technologies with correlated numerology, it can, for instance, multiplex the signals of LTE, 5G-NR and NB-IoT base stations. It abstracts a radio frequency front-end into a configurable number of virtual RF front ends, making it possible for such different technologies to share the same RF front-end and consequently reduce the costs and increasing the spectral efficiency by employing densification, once several networks share the same infrastructure or by dynamically accessing free chunks of spectrum. Therefore, the main goal of the proposed approach is to improve spectral efficiency by efficiently using vacant gaps in congested spectrum bandwidths or adopting network densification through infrastructure sharing. We demonstrate mathematically how our proposed approach works and present several simulation results proving its functionality and efficiency. Additionally, we designed and implemented an open-source and free proof of concept prototype of the proposed architecture, which can be used by researchers and developers to run experiments or extend the concept to other applications. We present several experimental results used to validate the proposed prototype. We demonstrate that the prototype can easily handle up to 12 concurrent physical layers
Generalized Fast-Convolution-based Filtered-OFDM: Techniques and Application to 5G New Radio
This paper proposes a generalized model and methods for fast-convolution
(FC)-based waveform generation and processing with specific applications to
fifth generation new radio (5G-NR). Following the progress of 5G-NR
standardization in 3rd generation partnership project (3GPP), the main focus is
on subband-filtered cyclic prefix (CP) orthogonal frequency-division
multiplexing (OFDM) processing with specific emphasis on spectrally well
localized transmitter processing. Subband filtering is able to suppress the
interference leakage between adjacent subbands, thus supporting different
numerologies for so-called bandwidth parts as well as asynchronous multiple
access. The proposed generalized FC scheme effectively combines overlapped
block processing with time- and frequency-domain windowing to provide highly
selective subband filtering with very low intrinsic interference level. Jointly
optimized multi-window designs with different allocation sizes and design
parameters are compared in terms of interference levels and implementation
complexity. The proposed methods are shown to clearly outperform the existing
state-of-the-art windowing and filtering-based methods.Comment: To appear in IEEE Transactions on Signal Processin
IRCI Free Range Reconstruction for SAR Imaging with Arbitrary Length OFDM Pulse
Our previously proposed OFDM with sufficient cyclic prefix (CP) synthetic
aperture radar (SAR) imaging algorithm is inter-range-cell interference (IRCI)
free and achieves ideally zero range sidelobes for range reconstruction. In
this OFDM SAR imaging algorithm, the minimum required CP length is almost equal
to the number of range cells in a swath, while the number of subcarriers of an
OFDM signal needs to be more than the CP length. This makes the length of a
transmitted OFDM sequence at least almost twice of the number of range cells in
a swath and for a wide swath imaging, the transmitted OFDM pulse length becomes
long, which may cause problems in some radar applications. In this paper, we
propose a CP based OFDM SAR imaging with arbitrary pulse length, which has IRCI
free range reconstruction and its pulse length is independent of a swath width.
We then present a novel design method for our proposed arbitrary length OFDM
pulses. Simulation results are presented to illustrate the performances of the
OFDM pulse design and the arbitrary pulse length CP based OFDM SAR imaging.Comment: 29 pages, 10 figures, regular pape
Democratic Representations
Minimization of the (or maximum) norm subject to a constraint
that imposes consistency to an underdetermined system of linear equations finds
use in a large number of practical applications, including vector quantization,
approximate nearest neighbor search, peak-to-average power ratio (or "crest
factor") reduction in communication systems, and peak force minimization in
robotics and control. This paper analyzes the fundamental properties of signal
representations obtained by solving such a convex optimization problem. We
develop bounds on the maximum magnitude of such representations using the
uncertainty principle (UP) introduced by Lyubarskii and Vershynin, and study
the efficacy of -norm-based dynamic range reduction. Our
analysis shows that matrices satisfying the UP, such as randomly subsampled
Fourier or i.i.d. Gaussian matrices, enable the computation of what we call
democratic representations, whose entries all have small and similar magnitude,
as well as low dynamic range. To compute democratic representations at low
computational complexity, we present two new, efficient convex optimization
algorithms. We finally demonstrate the efficacy of democratic representations
for dynamic range reduction in a DVB-T2-based broadcast system.Comment: Submitted to a Journa
- …