Generalized pairwise z-complementary codes

An approach to generate generalized pairwise Z-complementary (GPZ) codes, which works in pairs in order to offer a zero correlation zone (ZCZ) in the vicinity of zero phase shift and fit extremely well in power efficient quadrature carrier modems, is introduced in this letter. Each GPZ code has MK sequences, each of length 4NK, whereMis the number of Z-complementary mates, K is a factor to perform Walsh–Hadamard expansions, and N is the sequence length of the Z-complementary code. The proposed GPZ codes include the generalized pairwise complementary (GPC)codes as special cases

Convolutional compressed sensing using deterministic sequences

This is the author's accepted manuscript (with working title "Semi-universal convolutional compressed sensing using (nearly) perfect sequences"). The final published article is available from the link below. Copyright @ 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.In this paper, a new class of orthogonal circulant matrices built from deterministic sequences is proposed for convolution-based compressed sensing (CS). In contrast to random convolution, the coefficients of the underlying filter are given by the discrete Fourier transform of a deterministic sequence with good autocorrelation. Both uniform recovery and non-uniform recovery of sparse signals are investigated, based on the coherence parameter of the proposed sensing matrices. Many examples of the sequences are investigated, particularly the Frank-Zadoff-Chu (FZC) sequence, the m-sequence and the Golay sequence. A salient feature of the proposed sensing matrices is that they can not only handle sparse signals in the time domain, but also those in the frequency and/or or discrete-cosine transform (DCT) domain

A feasibility approach for constructing combinatorial designs of circulant type

In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having three sets, to which the Douglas-Rachford projection algorithm is applied. The approach is illustrated on three different classes of circulant combinatorial designs: circulant weighing matrices, D-optimal matrices, and Hadamard matrices with two circulant cores. Furthermore, we explicitly construct two new circulant weighing matrices, a $CW(126,64)$ and a $CW(198,100)$, whose existence was previously marked as unresolved in the most recent version of Strassler's table

New Constructions of Zero-Correlation Zone Sequences

In this paper, we propose three classes of systematic approaches for constructing zero correlation zone (ZCZ) sequence families. In most cases, these approaches are capable of generating sequence families that achieve the upper bounds on the family size ($K$) and the ZCZ width ($T$) for a given sequence period ($N$). Our approaches can produce various binary and polyphase ZCZ families with desired parameters $(N,K,T)$ and alphabet size. They also provide additional tradeoffs amongst the above four system parameters and are less constrained by the alphabet size. Furthermore, the constructed families have nested-like property that can be either decomposed or combined to constitute smaller or larger ZCZ sequence sets. We make detailed comparisons with related works and present some extended properties. For each approach, we provide examples to numerically illustrate the proposed construction procedure.Comment: 37 pages, submitted to IEEE Transactions on Information Theor

Intelligent OFDM telecommunication system. Part 4. Anti-eavesdropping and anti-jamming properties of the system, based on many-parameter and fractional Fourier transforms

In this paper, we aim to investigate the superiority and practicability of many-parameter wavelet and Golay transforms (MPWT and MPGT) from the physical layer security (PHY-LS) perspective. We propose novel Intelligent OFDM-telecommunication system (Intelligent-OFDM-TCS), based on many-parameter transforms (MPTs). New system uses inverse MPT for modulation at the transmitter and direct MPT for demodulation at the receiver. The purpose of employing the MPTs is to improve the PHY-LS of wireless transmissions against to the wide-band anti-jamming communication. Each MPT depends on finite set of independent Jacobi parameters (angles), which could be changed independently one of another. When parameters are changed, multi-parametric transform is changed too taking form of a set known (and unknown) orthogonal (or unitary) wavelet transforms. We implement the following performances as bit error rate (BER), symbol error rate (SER), peak to average power ratio (PAPR), the Shannon-Wyner secrecy capacity (SWSC) for novel Intelligent-MPWT-OFDM-TCS. Previous research has shown that the conventional OFDM TCS based on discrete Fourier transform (DFT) has unsatisfactory characteristics in BER, PARP, SWSC and in anti-eavesdropping communications. We study Intelligent-MPT-OFDM-TCS to find out optimal values of angle parameters of MPT optimized BER, PAPR, SWSC, anti-eavesdropping effects. Simulation results show that the proposed Intelligent OFDM-TCS have better performances than the conventional OFDM system based on DFT against eavesdropping. © 2019 IOP Publishing Ltd. All rights reserved