Related papers: Sparse Complementary Pairs with Additional Aperiod…
It is shown that replacing the sinusoidal chip in Golay complementary code pairs by special classes of waveforms that satisfy two conditions, symmetry/anti-symmetry and quazi-orthogonality in the convolution sense, renders the complementary…
We propose Sparse Neural Network architectures that are based on random or structured bipartite graph topologies. Sparse architectures provide compression of the models learned and speed-ups of computations, they can also surpass their…
We propose a streamlined combination scheme of the transcorrelation (TC) and coupled cluster (CC) theory, which not only increases the convergence rate with respect to the basis set, but also extends the applicability of the lowest order CC…
We introduce and solve exactly a class of interacting particle systems in one dimension where particles hop asymmetrically. In its simplest form, namely asymmetric zero range process (AZRP), particles hop on a one dimensional periodic…
The standard model (SM) one-loop contributions to the most general $H^*Z^*Z^*$ coupling are obtained via the background field method in terms of Passarino-Veltman scalar functions, from which the contributions to the $H^*ZZ$ and $HZZ^*$…
Sequences with excellent ambiguity functions are very useful in radar detection and modern mobile communications. Doppler resilient complementary sequence (DRCS) is a new type of sequence proposed recently, which can achieve lower ambiguity…
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…
Supracolloidal magnetic polymers (SMPs) are structures made by crosslinking magnetic particles. In this work, using Langevin dynamics simulations, we study the zero-field magnetic properties of clusters formed in suspensions of SMPs with…
Sliding cable system with frictions is encountered in many engineering applications. Such system is typically characterized by existences of complex and varied motion states of different sliding nodes (pulleys), which leads to significant…
Sparse coding in learned dictionaries has been established as a successful approach for signal denoising, source separation and solving inverse problems in general. A dictionary learning method adapts an initial dictionary to a particular…
In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…
We propose an sparse Bayesian learning (SBL)-based method that leverages group sparsity and multiple parameterized dictionaries to detect the relevant dictionary entries and estimate their continuous parameters by combining data from…
There is currently a large gap in performance between the statistically rigorous methods like linear regression or additive splines and the powerful deep methods using neural networks. Previous works attempting to close this gap have failed…
We discuss asymptotics of the zeros of orthogonal polynomials on the real line and on the unit circle when the recursion coefficients are periodic. The zeros on or near the absolutely continuous spectrum have a clock structure with spacings…
This study used the pairing gap to identify nuclei as candidates for critical point symmetry around Z=40 and A=100. Nuclei around A = 100 display complex shape evolution and configuration crossing patterns. We utilized the experimental and…
This paper investigates the design of self-connected spatially coupled low-density parity-check (SC-LDPC) codes. First, a termination method is proposed to reduce rate loss. Particularly, a single-side open SC-LDPC ensemble is introduced,…
We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most…
Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink…
Through the last years, different strategies to enhance synchronization in complex networks have been proposed. In this Letter, we show that the synchronization in a small-world network of attractively coupled non-identical neurons is…
Matching pursuits are a class of greedy algorithms commonly used in signal processing, for solving the sparse approximation problem. They rely on an atom selection step that requires the calculation of numerous projections, which can be…