Search arXivSearch

arXiv · 1708.04407

Throughput Enhancement of Multicarrier Cognitive M2M Networks: Universal-Filtered OFDM Systems

Abstract

We consider a cognitive radio network consisting of a primary cellular system and a secondary cognitive machine-to-machine (M2M) system, and study the throughput enhancement problem of the latter system employing universal-filtered orthogonal frequency division multiplexing (UF-OFDM) modulation. The downlink transmission capacity of the cognitive M2M system is thereby maximized, while keeping the interference introduced to the primary users (PUs) below the pre-specified threshold, under total transmit power budget of the secondary base station (SBS). The performance of UF-OFDM based CR system is compared to the performances of OFDM-based and filter bank multicarrier (FBMC)-based CR systems. We also propose a near-optimal resource allocation method separating the subband and power allocation. The solution is less complex compared to optimization of the original combinatorial problem. We present numerical results that show that for given interference thresholds of the PUs and maximum transmit power limit of the SBS, the UF-OFDM based CR system exhibits intermediary performance in terms of achievable capacity compared to OFDM and FBMC-based CR systems. Interestingly, for a certain degree of robustness of the PUs, the UF-OFDM performs equally well as FBMC. Furthermore, the percentage rate-gain of UF-OFDM based CR system increases by a large amount when UF-OFDM modulation with lower sidelobes ripple is employed. Numerical results also show that the proposed throughput enhancing method despite having lower computational complexity compared to the optimal solution achieves near-optimal performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mirza Golam Kibria, Gabriel Porto Villardi, Kentaro Ishizu, Fumihide Kojima. 2017-08-15. Throughput Enhancement of Multicarrier Cognitive M2M Networks: Universal-Filtered OFDM Systems. https://doi.org/10.1109/jiot.2015.2509259

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT