相关论文: Complementary Set Matrices Satisfying a Column Cor…

Zero correlation zone (ZCZ) sequences and Golay sequences are two kinds of sequences with different preferable correlation properties. It was shown by Gong \textit{et al.} and Chen \textit{et al.} that some Golay sequences also possess a…

Sets of sequences with good correlation properties are desired in many active sensing and communication systems, e.g., multiple-input-multiple-output (MIMO) radar systems and code-division multiple-access (CDMA) cellular systems. In this…

In this paper, we design low correlation binary sequences favorable in wireless communication and radar applications. First, we formulate the designing problem as a nonconvex combination optimization problem with flexible correlation…

In this paper, we first propose a new design strategy of 2D $Z$-complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular arrays satisfying zero 2D auto-correlation sums for non-trivial…

Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…

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…

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

PAR-constrained sequences are widely used in communication systems and radars due to various practical needs; specifically, sequences are required to be unimodular or of low peak-to-average power ratio (PAR). For unimodular sequence design,…

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

Unimodular sequences with good auto/cross-correlation properties are favorable in wireless communication and radar applications. In this paper, we focus on designing these kinds of sequences. The main content is as follows: first, we…

We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local $w$-uniqueness of the solutions to the linear complementarity problem can be identified by the column competent matrices.…

For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple in form, can perform surprisingly well compared to the…

In many manufacturing processes, batch processing is frequently needed for capacity reasons. This applies both to parallel and serial batching. However, while the serial batch processing is largely studied in the literature, as it is…

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

A novel matrix approximation problem is considered herein: observations based on a few fully sampled columns and quasi-polynomial structural side information are exploited. The framework is motivated by quantum chemistry problems wherein…

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…

Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the…

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard,…

We consider the problem of sparse matrix multiplication by the column row method in a distributed setting where the matrix product is not necessarily sparse. We present a surprisingly simple method for "consistent" parallel processing of…

The simultaneous orthogonal matching pursuit (SOMP) algorithm aims to find the joint support of a set of sparse signals acquired under a multiple measurement vector model. Critically, the analysis of SOMP depends on the maximal inner…