Related papers: Quasi-Large Sparse-Sequence CDMA: Approach to Sing…
Mode-pairing quantum key distribution (MP-QKD) offers significant potential for long-distance secure communication, benefiting from its quadratic scaling capacity and phase compensation-free characteristic. However, MP-QKD still requires…
In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K <…
This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…
Spectrum sharing is a critical strategy for meeting escalating user demands via commercial wireless services, yet its effective regulation and technological enablement, particularly concerning coexistence with incumbent systems, remain…
We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals Kamax is the…
Sparsely spread code division multiple access (SCDMA) is a non-orthogonal superposition coding scheme that permits a base station simultaneously communicates with multiple users over a common channel. The detection performance of an SCDMA…
As the demand of wireless communication continues to rise, the radio spectrum (a finite resource) requires increasingly efficient utilization. This trend is driving the evolution from static, stand-alone spectrum allocation toward spectrum…
Quantum secret sharing (QSS) is an essential primitive for the future quantum internet, which promises secure multiparty communication. However, developing a large-scale QSS network is a huge challenge due to the channel loss and the…
We study a problem of constructing codes that transform a channel with high bit error rate (BER) into one with low BER (at the expense of rate). Our focus is on obtaining codes with smooth ("graceful") input-output BER curves (as opposed to…
In this paper, we first propose a new iterative algorithm, called the K-sets+ algorithm for clustering data points in a semi-metric space, where the distance measure does not necessarily satisfy the triangular inequality. We show that the…
Contemporary cosmic microwave background (CMB) experiments typically have observing bands covering the range 20 - 800 GHz. Certain science goals, including the detection of $\mu$-type distortions to the CMB spectrum and the characterization…
We consider the interference management problem in a multicell MIMO heterogenous network. Within each cell there are a large number of distributed micro/pico base stations (BSs) that can be potentially coordinated for joint transmission. To…
This paper introduces a random modulation technique that is decoupled from the channel matrix, allowing it to be applied to arbitrary norm-bounded and spectrally convergent channel matrices. The proposed random modulation constructs an…
For $\alpha > 1$, an $\alpha$-approximate (bi-)kernel is a polynomial-time algorithm that takes as input an instance $(I, k)$ of a problem $\mathcal{Q}$ and outputs an instance $(I',k')$ (of a problem $\mathcal{Q}'$) of size bounded by a…
Long-range Rayleigh-based Distributed Acoustic Sensing (DAS) systems are often limited in their sensitivity and bandwidth. The former limitation is a result of the low backscattered power and poor \textit{dynamic-strain to optical-phase}…
We present the results from the optical component of a survey for damped Lyman-alpha systems (DLAs) towards radio-loud quasars. Our quasar sample is drawn from the Texas radio survey with the following primary selection criteria: z_em >…
We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…
Kernel methods obtain superb performance in terms of accuracy for various machine learning tasks since they can effectively extract nonlinear relations. However, their time complexity can be rather large especially for clustering tasks. In…
In a distributed network environment, the diffusion-least mean squares (LMS) algorithm gives faster convergence than the original LMS algorithm. It has also been observed that, the diffusion-LMS generally outperforms other distributed LMS…
This paper proposes a spectrum sensing algorithm from one bit measurements in a cognitive radio sensor network. A likelihood ratio test (LRT) for the one bit spectrum sensing problem is derived. Different from the one bit spectrum sensing…