Related papers: Two-Dimensional Z-Complementary Array Quads with L…
We propose a novel paradigm for the QCD axion with high-quality Peccei-Quinn (PQ) symmetry on the basis of electric-magnetic duality in the conformal window of a supersymmetric gauge theory. PQ breaking fields, that contain the QCD axion,…
High-frequency wideband cellular communications over mmWave and sub-THz offer the opportunity for high data rates. However, it also presents high path loss, resulting in limited coverage. High-gain beamforming from the antenna array is…
It was recently shown that low rank matrix completion theory can be employed for designing new sampling schemes in the context of MIMO radars, which can lead to the reduction of the high volume of data typically required for accurate target…
This paper introduces a novel finite Zak transform (FZT)-aided framework for constructing multiple zero-correlation zone (ZCZ) sequence sets with optimal correlation properties. Specifically, each sequence is perfect with zero…
Generalized spatial modulation (GSM) is a novel multiple-antenna technique offering flexibility among spectral efficiency, energy efficiency, and the cost of RF chains. In this paper, a novel class of sequence sets, called enhanced cross…
Sparse sensor arrays offer a cost effective alternative to uniform arrays. By utilizing the co-array, a sparse array can match the performance of a filled array, despite having significantly fewer sensors. However, even sparse arrays can…
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for q <= 9109. From these new bounds it follows that for q <= 2621 and q = 2659,2663,2683,2693,2753,2801, the relation…
Many-body perturbation theory methods, such as the $G_0W_0$ approximation, are able to accurately predict quasiparticle (QP) properties of several classes of materials. However, the calculation of the QP band structure of two-dimensional…
This paper studies exact semidefinite programming relaxations (SDPRs) for separable quadratically constrained quadratic programs (QCQPs). We consider the construction of a larger separable QCQP from multiple QCQPs with exact SDPRs. We show…
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for 853<= q<= 2879 and q=3511,4096, 4523,5003,5347,5641,5843,6011. For q<= 2377 and q=2401,2417,2437, the relation…
The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing…
In this paper, we present a new family of cross $Z$-complementary pairs (CZCPs) based on generalized Boolean functions and two roots of unity. Our key idea is to consider an arbitrary partition of the set $\{1,2,\cdots, n\}$ with two…
Low-coherence sequences with low peak-to-average power ratio (PAPR) are crucial for multi-carrier wireless communication systems and are used for pilots, spreading sequences, and so on. This letter proposes an efficient low-coherence…
The previous constructions of quadrature amplitude modulation (QAM) Golay complementary sequences (GCSs) were generalized as $4^q $-QAM GCSs of length $2^{m}$ by Li \textsl{et al.} (the generalized cases I-III for $q\ge 2$) in 2010 and Liu…
This paper proposes a novel joint non-binary network-channel code for the Time-Division Decode-and-Forward Multiple Access Relay Channel (TD-DF-MARC), where the relay linearly combines -- over a non-binary finite field -- the coded…
Two arrays form a periodic complementary pair if the sum of their periodic autocorrelations is a delta function. Finding such pairs, however, is challenging for large arrays whose entries are constrained to a small alphabet. One such…
Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Yan et al.. It can be used to design coded caching scheme. In…
An $(m,n,R)$-de Bruijn covering array (dBCA) is a doubly periodic $M \times N$ array over an alphabet of size $q$ such that the set of all its $m \times n$ windows form a covering code with radius $R$. An upper bound of the smallest array…
The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…
The design of sub-arrayed phased arrays (PAs) with sub-array-only amplitude and phase controls that afford arbitrary-shaped power patterns matching reference ones is addressed. Such a synthesis problem is formulated in the power pattern…