Related papers: Sparse Complementary Pairs with Additional Aperiod…
In this study, we propose partitioned complementary sequences (CSs) where the gaps between the clusters encode information bits to achieve low peak-to-average-power ratio (PAPR) orthogonal frequency division multiplexing (OFDM) symbols. We…
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…
We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive…
Model merging has emerged as a promising paradigm for composing the capabilities of large language models by directly operating in weight space, enabling the integration of specialized models without costly retraining. However, existing…
Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constraints such decoding strategies can result in unacceptable…
We present cross sections for production of electroweak vector boson pairs, $WW$, $WZ$ and $ZZ$, in $p\bar{p}$ and $pp$ collisions, at next-to-leading order in $\alpha_s$. We treat the leptonic decays of the bosons in the narrow-width…
This letter introduces a real valued summation known as Complex Conjugate Pair Sum (CCPS). The space spanned by CCPS and its one circular downshift is called {\em Complex Conjugate Subspace (CCS)}. For a given positive integer $N\geq3$,…
There is a multiplicity of charge ordered, pairing-based or pair density wave theories of the cuprate pseudogap, albeit arising from different microscopic mechanisms. For mean field schemes (of which there are many) we demonstrate here that…
Cross-correlation is a popular signal processing technique used in numerous location tracking systems for obtaining reliable range information. However, its efficient design and practical implementation has not yet been achieved on mote…
We examine supersymmetric theories with approximately conformal sectors. Without an IR cutoff the theory has a continuum of modes, which are often referred to as "unparticles." Making use of the AdS/CFT correspondence we find that in the…
When the number of strongly correlated electrons becomes larger, the single-reference coupled-cluster (CC) CCSD, CCSDT, etc. hierarchy displays an erratic behavior, while traditional multi-reference approaches may no longer be applicable…
Mutually orthogonal complementary sets (MOCSs) and Z-complementary code sets (ZCCSs) have many applications in practical scenarios such as synthetic aperture imaging systems and multi-carrier code division multiple access (MC-CDMA) systems.…
We introduce generalized spatially coupled parallel concatenated codes (GSC-PCCs), a class of spatially coupled turbo-like codes obtained by coupling parallel concatenated codes (PCCs) with a fraction of information bits repeated before the…
Some elements of the theory and algorithmics corresponding to the computation of semilinear sparse models for discrete-time signals are presented. In this study, we will focus on approximately eventually periodic discrete-time signals, that…
Associative memories are structures that store data patterns and retrieve them given partial inputs. Sparse Clustered Networks (SCNs) are recently-introduced binary-weighted associative memories that significantly improve the storage and…
A set of quadratic forms is simultaneously diagonalizable via congruence (SDC) if there exists a basis under which each of the quadratic forms is diagonal. This property appears naturally when analyzing quadratically constrained quadratic…
A subspace code is a nonempty collection of subspaces of the vector space $\mathbb{F}_q^{n}$. A pair of linear codes is called a linear complementary pair (in short LCP) of codes if their intersection is trivial and the sum of their…
Sparse Subspace Clustering (SSC) is one of the most popular methods for clustering data points into their underlying subspaces. However, SSC may suffer from heavy computational burden. Orthogonal Matching Pursuit applied on SSC accelerates…
A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…
Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…