A joint design approach for spectrum sharing between radar and communication systems

Li, Bo; Kumar, Harshat; Petropulu, Athina P.

doi:10.1109/icassp.2016.7472289

Cited by 40 publications

(21 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jiang [17] settles the problem by showing that p = o(n 1/2 ) and q = o(n 1/2 ) are the largest orders to make the total variation distance go to zero. If the distance is the weak distance, or equivalently, the maximum norm, Jiang [17] further proves that the largest order of q is n log n with p = n. Based on this work some applications are obtained, for example, for the properties of eigenvalues of the Jacobi ensemble in the random matrix theory [18], the wireless communications [24,25,26] and data storage from Big Data [5]. However, even with the affirmative answer by Jiang [17], a conjecture [(1) below] and a question [(2) below] still remain.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Plot of CLT

Jiang

2019

Trans. Amer. Math. Soc.

View full text Add to dashboard Cite

Abstract. Let Γn be an n × n Haar-invariant orthogonal matrix. Let Zn be the p × q upper-left submatrix of Γn, where p = pn and q = qn are two positive integers. Let Gn be a p × q matrix whose pq entries are independent standard normals. In this paper we consider the distance between √ nZn and Gn in terms of the total variation distance, the Kullback-Leibler distance, the Hellinger distance and the Euclidean distance. We prove that each of the first three distances goes to zero as long as pq/n goes to zero, and not so if (p, q) sits on the curve pq = σn, where σ is a constant. However, it is different for the Euclidean distance, which goes to zero provided pq 2 /n goes to zero, and not so if (p, q) sits on the curve pq 2 = σn. A previous work by Jiang [17] shows that the total variation distance goes to zero if both p/ √ n and q/ √ n go to zero, and it is not true provided p = c √ n and q = d √ n with c and d being constants. One of the above results confirms a conjecture that the total variation distance goes to zero as long as pq/n → 0 and the distance does not go to zero if pq = σn for some constant σ.

show abstract

Section: Introductionmentioning

confidence: 99%

“…As mentioned earlier, the work [17] has been applied to other random matrix problems [18], the wireless communications [24,25,26] and a problem from Big Data [5]. In this paper we consider other three probability metrics: the Hellinger distance, the Kullback-Leibler distance and the Euclidean distance.…”

Section: Remarks and Future Questionsmentioning

confidence: 99%

Plot of CLT

Jiang

2019

Trans. Amer. Math. Soc.

View full text Add to dashboard Cite

show abstract

“…This joint design was beneficial in terms both of enhancing the radar functions as well as of maintaining a substantial throughput for the communication system. Furthermore, the network association was formulated as a signal-to-interference-plusnoise ratio (SINR) maximization problem at the radar receiver, which was also subjected to the rate and power constraints of the communication system by Li et al [9]. In [10], an adaptive radar beamforming technique was proposed by Geng et al for eliminating the wireless interferences imposed by communication systems during spectrum sharing.…”

Section: Introductionmentioning

confidence: 99%

Network Association in Machine-Learning Aided Cognitive Radar and Communication Co-Design

Wang

Guan

Jiang

et al. 2019

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

In order to beneficially exploit the scarce wireless spectral resources, spectrum sharing between communication and radar systems has become a promising research topic. However, traditional network association strategies may not result in efficient hybrid communication and radar systems. We circumvent this problem by formulating a partially observable Markov decision processes (POMDP) aided network association scheme, where the radar user acts as the primary user (PU), while the cognitive communication user is the secondary user (SU). For maximizing the network throughput, whilst minimizing the interference imposed on the radar user, the communication user is configured for adaptively selecting its underlay or overlay access mode. Moreover, a low-complexity near-optimal reinforcement learning algorithm is proposed for the co-design by considering both its complexity and feasibility. Finally, we quantify the performance of our proposed POMDP based network association scheme.

show abstract

“…Recently, the coexistence of radar and communications has been the focus of research due to its advantages of reducing equipment size and improving resource utilisation [1–3]. However, the implementation of radar–communications system is subject to the design of radar–communications signal.…”

Section: Introductionmentioning

confidence: 99%