Upper bounds for a coded DHA FH OFDMA system with noncoherent threshold reception

2012 ◽  
Author(s):  
Dmitry Osipov
Keyword(s):  
Upper Bounds ◽  
Ofdma System

Low-Complexity Resource Allocation Algorithm for Multicell OFDMA System

2013 ◽  
Vol E96.B (5) ◽  
pp. 1218-1221 ◽  
Author(s):  
Qingli ZHAO ◽  
Fangjiong CHEN ◽  
Sujuan XIONG ◽  
Gang WEI
Keyword(s):  
Resource Allocation ◽  
Low Complexity ◽  
Ofdma System ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm

Extension of the Spatial PDI Model to Three Dimensions

1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien
Keyword(s):  
Population Density ◽  
Dimensional Space ◽  
Finite Lattice ◽  
Three Dimensional ◽  
Upper Bounds ◽  
Three Dimensions ◽  
Lower And Upper Bounds ◽  
Density Index ◽  
Three Dimensional Space

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.

Energy of spherical fuzzy graphs

2020 ◽  
pp. 321-332
Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali
Keyword(s):  
Adjacency Matrix ◽  
Upper Bounds ◽  
Fuzzy Graph ◽  
Lower And Upper Bounds ◽  
Fuzzy Graphs

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.

scholarly journals Analysis of Low Probability of Detection Capability for Chaotic Standard Map-Based FH-OFDMA System

2021 ◽  
Vol 11 (5) ◽  
pp. 2198
Author(s):  
Junwoo Jung ◽  
Jaesung Lim ◽  
Sungyeol Park ◽  
Haengik Kang ◽  
Seungbok Kwon
Keyword(s):  
Detection Probability ◽  
Probability Of Detection ◽  
Lower Probability ◽  
Symbol Sequence ◽  
Ofdma System ◽  
Standard Map ◽  
Detection Probabilities ◽  
Low Probability ◽  
Transmitted Symbol ◽  
Basic Symbol

A frequency hopping orthogonal frequency division multiple access (FH-OFDMA) can provide low probability of detection (LPD) and anti-jamming capabilities to users against adversary detectors. To obtain an extreme LPD capability that cannot be provided by the basic symbol-by-symbol (SBS)-based FH pattern, we proposed two FH patterns, namely chaotic standard map (CSM) and cat map for FH-OFDMA systems. In our previous work, through analysis of complexity to regenerate the transmitted symbol sequence, at the point of adversary detectors, we found that the CSM had a lower probability of intercept than the cat map and SBS. It is possible when a detector already knows symbol and frame structures, and the detector has been synchronized to the FH-OFDMA system. Unlike the previous work, here, we analyze whether the CSM provides greater LPD capability than the cat map and SBS by detection probability using spectrum sensing technique. We analyze the detection probability of the CSM and provide detection probabilities of the cat map and SBS compared to the CSM. Based on our analysis of the detection probability and numerical results, it is evident that the CSM provides greater LPD capability than both the cat map and SBS-based FH-OFDMA systems.

Sign in / Sign up

Export Citation Format

Share Document