Related papers: Sparse Complementary Pairs with Additional Aperiod…
In this paper, we consider compressed sensing (CS) of block-sparse signals, i.e., sparse signals that have nonzero coefficients occurring in clusters. An efficient algorithm, called zero-point attracting projection (ZAP) algorithm, is…
Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating…
Golay complementary pairs (GCPs) and complete complementary codes (CCCs) have found a wide range of practical applications in coding, signal processing and wireless communication due to their ideal correlation properties. In fact, binary…
Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one and ideal periodic autocorrelation function. Such sequences are used in cellular radio communications systems, e.g., for reference signals, synchronization signals…
We formulate the notion of parity for the periodic XXZ spin chain within the Quantum Inverse Scattering Method. We also propose an expression for the eigenvalues of the charge conjugation operator. We use these discrete symmetries to help…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…
Sparse coding aims to model data vectors as sparse linear combinations of basis elements, but a majority of related studies are restricted to continuous data without spatial or temporal structure. A new model-based sparse coding (MSC)…
The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for…
Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding…
Very recently, we have introduced correlation consistent effective core potentials (ccECPs) derived from many-body approaches with the main target being its use in explicitly correlated methods but also in mainstream approaches. The ccECPs…
A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…
We construct a sparse $Z_2$ chain complex (with three different degrees, so that it corresponds to a quantum code) which does not admit a sparse lift to the integers, answering a question in Ref. 1.
A recursive algorithm named Zero-point Attracting Projection (ZAP) is proposed recently for sparse signal reconstruction. Compared with the reference algorithms, ZAP demonstrates rather good performance in recovery precision and robustness.…
We present an extension of the pair coupled cluster doubles (p-CCD) method to quasiparticles and apply it to the attractive pairing Hamiltonian. Near the transition point where number symmetry gets spontaneously broken, the proposed…
Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some constructions of single $H$-ary Golay sequence and $4^q$-QAM…
Sparse principal component analysis (sparse PCA) is a widely used technique for dimensionality reduction in multivariate analysis, addressing two key limitations of standard PCA. First, sparse PCA can be implemented in high-dimensional low…
Like other pseudorandom sequences, decimal sequences may be used in designing a Code Division Multiple Access (CDMA) system. They appear to be ideally suited for this since the cross-correlation of d-sequences taken over the LCM of their…
This article explores a new type of nonlinear complementarity problem, namely the horizontal tensor complementarity problem (HTCP), which is a natural extension of the horizontal linear complementarity problem studied in [12]. We extend the…
This paper proposes two coherent broadband focusing algorithms for spatial correlation estimation using sparse linear arrays. Both algorithms decompose the time-domain array data into disjoint frequency bands through discrete Fourier…
Sparse dictionary coding represents signals as linear combinations of a few dictionary atoms. It has been applied to images, time series, graph signals and multi-way spatio-temporal data by jointly employing temporal and spatial…