arXiv 0812.44872008-12cs.ITcs.DMmath.ITmath.RT

New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts

Zilong Wang, Guang Gong

备注：: 23 pages, accepted by IEEE Transactions on Information Theory

英文摘要：

For a given prime $p$, a new construction of families of the complex valued sequences of period $p$ with efficient implementation is given by applying both multiplicative characters and additive characters of finite field $\mathbb{F}_p$. Such a signal set consists of $p^2(p-2)$ time-shift distinct sequences, the magnitude of the two-dimensional autocorrelation function (i.e., the ambiguity function) in both time and phase of each sequence is upper bounded by $2\sqrt{p}$ at any shift not equal to $(0, 0)$, and the magnitude of the ambiguity function of any pair of phase-shift distinct sequences is upper bounded by $4\sqrt{p}$. Furthermore, the magnitude of their Fourier transform spectrum is less than or equal to 2. A proof is given through finding a simple elementary construction for the sequences constructed from the Weil representation by Gurevich, Hadani and Sochen. An open problem for directly establishing these assertions without involving the Weil representation is addressed.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Cyclotomy of Weil Sums of Binomials

The Weil sum $W_{K,d}(a)=\sum_{x \in K} ψ(x^d + a x)$ where $K$ is a finite field, $ψ$ is an additive character of $K$, $d$ is coprime to $|K^\times|$, and $a \in K^\times$ arises often in number-theoretic calculations, and in applications to finite geometry, cryptography, digital sequence design, and coding theory. Researchers are especially interested in the case where $W_{K,d}(a)$ assumes three distinct values as $a$ runs through $K^\times$. A Galois-theoretic approach, combined with $p$-divisibility results on Gauss sums, is used here to prove a variety of new results that constrain which …

2015-04-02cs.ITmath.COmath.IT

The finite harmonic oscillator and its associated sequences

A system of functions (signals) on the finite line, called the oscillator system, is described and studied. Applications of this system for discrete radar and digital communication theory are explained. Keywords: Weil representation, commutative subgroups, eigenfunctions, random behavior, deterministic construction

2008-12-30cs.CRcs.DMcs.IT

Deterministic Compressed Sensing Matrices from Additive Character Sequences

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive character sequences. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for $N=K^2$, and to present a sufficient condition on the sparsity level for unique sparse recovery. Also, the restricted isometry property (RIP) is statistically studied for the deterministic matrix. Using additive character sequences with small alp…

2010-09-30cs.ITmath.IT

New Families of $p$-ary Sequences of Period $\frac{p^n-1}{2}$ With Low Maximum Correlation Magnitude

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and $m(dt)$, where $d = 4$ and $d = (p^n + 1)/2=N+1$. The upper bound on the magnitude of correlation values of two sequences in the family is derived using Weil bound. Their upper bound is derived as $\frac{3}{\sqrt{2}} \sqrt{N+\frac{1}{2}}+\frac{1}{2}$ and the family size is 4N, which is four times the period of the sequence.

2013-10-10cs.ITmath.IT

Deterministic Compressed Sensing Matrices from Multiplicative Character Sequences

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via multiplicative character sequences. Precisely, a constant multiple of a cyclic shift of an $M$-ary power residue or Sidelnikov sequence is arranged as a column vector of the matrix, through modulating a primitive $M$-th root of unity. The Weil bound is then used to show that the matrix has asymptotically optimal coherence for large $K$ and $M$, and to present a sufficient con…

2010-11-11cs.ITmath.IT

Matrix Construction Using Cyclic Shifts of a Column

This paper describes the synthesis of matrices with good correlation, from cyclic shifts of pseudonoise columns. Optimum matrices result whenever the shift sequence satisfies the constant difference property. Known shift sequences with the constant (or almost constant) difference property are: Quadratic (Polynomial) and Reciprocal Shift modulo prime, Exponential Shift, Legendre Shift, Zech Logarithm Shift, and the shift sequences of some m-arrays. We use these shift sequences to produce arrays for watermarking of digital images. Matrices can also be unfolded into long sequences by diagonal unf…

2005-08-02cs.CRcs.DMcs.IT

更多相关论文收起更多论文

On Shift Sequences for Interleaved Construction of Sequence Sets with Low Correlation

Construction of signal sets with low correlation property is of interest to designers of CDMA systems. One of the preferred ways of constructing such sets is the interleaved construction which uses two sequences a and b with 2-level autocorrelation and a shift sequence e. The shift sequence has to satisfy certain conditions for the resulting signal set to have low correlation properties. This article shows that the conditions reported in literature are too strong and gives a version which results in more number of shift sequences. An open problem on the existence of shift sequences for attaini…

2007-06-21cs.ITmath.IT

On the Shift Value Set of Cyclic Shifted Sequences for PAPR Reduction in OFDM Systems

Orthogonal frequency division multiplexing (OFDM) signals have high peak-to-average power ratio (PAPR), which causes distortion when OFDM signal passes through a nonlinear high power amplifier (HPA). A partial transmit sequence (PTS) scheme is one of the typical PAPR reduction methods. A cyclic shifted sequences (CSS) scheme is evolved from the PTS scheme to improve the PAPR reduction performance, where OFDM signal subsequences are cyclically shifted and combined to generate alternative OFDM signal sequences. The shift value (SV) sets in the CSS scheme should be carefully selected because thos…

2015-06-23cs.ITmath.IT

Linear Shift-Register Synthesis for Multiple Sequences of Varying Length

The problem of finding the shortest linear shift-register capable of generating t finite length sequences over some field F is considered. A similar problem was already addressed by Feng and Tzeng. They presented an iterative algorithm for solving this multi-sequence shift-register synthesis problem, which can be considered as generalization of the well known Berlekamp-Massey algorithm. The Feng-Tzeng algorithm works indeed, if all t sequences have the same length. This paper focuses on multi-sequence shift-register synthesis for generating sequences of varying length. It is exposed, that the …

2006-05-09cs.ITmath.IT

Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis

This work is motivated by the problem of error correction in bit-shift channels with the so-called $ (d,k) $ input constraints (where successive $ 1 $'s are required to be separated by at least $ d $ and at most $ k $ zeros, $ 0 \leq d < k \leq \infty $). Bounds on the size of optimal $ (d,k) $-constrained codes correcting a fixed number of bit-shifts are derived, with a focus on their asymptotic behavior in the large block-length limit. The upper bound is obtained by a packing argument, while the lower bound follows from a construction based on a family of integer lattices. Several properties…

2019-03-14cs.DMcs.ITmath.IT

面向DNA存储的移位交织编码：IDS错误与序列丢失的校正

Shift-Interleave Coding for DNA-Based Storage: Correction of IDS Errors and Sequence Losses

该研究提出一种用于DNA存储的移位交织（SI）编码方案，通过移位、映射、交织处理低密度奇偶校验码码字，采用非迭代解码，可有效校正IDS错误与序列丢失。

2024-01-26cs.ITmath.IT

一类来自函数域的伪随机序列

A class of pseudorandom sequences From Function Fields

本文研究了一类p-ary序列的周期、线性复杂度等特性，基于函数域构造方法，拓展了已有伪随机序列的构造。

2026-02-06cs.ITmath.IT

Generalised Multi-sequence Shift-Register Synthesis using Module Minimisation

We show how to solve a generalised version of the Multi-sequence Linear Feedback Shift-Register (MLFSR) problem using minimisation of free modules over $\mathbb F[x]$. We show how two existing algorithms for minimising such modules run particularly fast on these instances. Furthermore, we show how one of them can be made even faster for our use. With our modeling of the problem, classical algebraic results tremendously simplify arguing about the algorithms. For the non-generalised MLFSR, these algorithms are as fast as what is currently known. We then use our generalised MLFSR to give a new fa…

2013-11-29cs.ITmath.IT

Shift-Inequivalent Decimations of the Sidelnikov-Lempel-Cohn-Eastman Sequences

We consider the problem of finding maximal sets of shift-inequivalent decimations of Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences (as well as the equivalent problem of determining the multiplier groups of the almost difference sets associated with these sequences). We derive a numerical necessary condition for a residue to be a multiplier of an SLCE almost difference set. Using our necessary condition, we show that if $p$ is an odd prime and $S$ is an SLCE almost difference set over $\mathbb{F}_p,$ then the multiplier group of $S$ is trivial. Consequently, for each odd prime $p,$ we obtain …

2018-09-11cs.ITmath.COmath.IT

Protocol Sequences for Multiple-Packet Reception

Consider a time slotted communication channel shared by $K$ active users and a single receiver. It is assumed that the receiver has the ability of the multiple-packet reception (MPR) to correctly receive at most $γ$ ($1 \leq γ< K$) simultaneously transmitted packets. Each user accesses the channel following a specific periodical binary sequence, called the protocol sequence, and transmits a packet within a channel slot if and only if the sequence value is equal to one. The fluctuation in throughput is incurred by inevitable random relative shifts among the users due to the lack of feedback. A …

2014-09-26cs.ITmath.IT

An iterative algorithm for parametrization of shortest length shift registers over finite rings

The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S_1,...,S_N, thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S_1, and constructs at each step a particular type of minimal Gröbner basis. The construction involves a simple update rule at each step which leads to computational efficiency. It is shown that the algorithm simul…

2012-01-28cs.ITcs.SCmath.IT

Doppler Resilient Waveforms with Perfect Autocorrelation

We describe a method of constructing a sequence of phase coded waveforms with perfect autocorrelation in the presence of Doppler shift. The constituent waveforms are Golay complementary pairs which have perfect autocorrelation at zero Doppler but are sensitive to nonzero Doppler shifts. We extend this construction to multiple dimensions, in particular to radar polarimetry, where the two dimensions are realized by orthogonal polarizations. Here we determine a sequence of two-by-two Alamouti matrices where the entries involve Golay pairs and for which the sum of the matrix-valued ambiguity funct…

2007-03-12cs.ITmath.IT

Deterministic Selection of Phase Sequences in Low Complexity SLM Scheme

Selected mapping (SLM) is a suitable scheme, which can solve the peak-to-average power ratio (PAPR) problem. Recently, many researchers have concentrated on reducing the computational complexity of the SLM schemes. One of the low complexity SLM schemes is the Class III SLM scheme which uses only one inverse fast fourier transform (IFFT) operation for generating one orthogonal frequency division multiplexing (OFDM) signal sequence. By selecting rotations and cyclic shifts randomly, it can generate $N^3$ alternative OFDM signal sequences, where $N$ is the FFT size. But this selection can not gua…

2012-10-16cs.ITmath.IT

Arithmetic autocorrelation distribution of binary $m$-sequences

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable pseudorandomness such as balance, uniform pattern distribution and ideal (classical) autocorrelation. In his reseach on arithmetic codes, Mandelbaum \cite{9Mand} introduces a 2-adic version of classical autocorrelation of binary sequences, called arithmetic autocorrelation. Later, Goresky and Klapper \cite{3G1,4G2,5G3,6G4} generalize this notion to nonbinary case a…

2022-11-30cs.ITmath.IT

Aperiodic Crosscorrelation of Sequences Derived from Characters

It is shown that pairs of maximal linear recursive sequences (m-sequences) typically have mean square aperiodic crosscorrelation on par with that of random sequences, but that if one takes a pair of m-sequences where one is the reverse of the other, and shifts them appropriately, one can get significantly lower mean square aperiodic crosscorrelation. Sequence pairs with even lower mean square aperiodic crosscorrelation are constructed by taking a Legendre sequence, cyclically shifting it, and then cutting it (approximately) in half and using the halves as the sequences of the pair. In some of …

2016-07-05cs.ITmath.COmath.IT