English
Related papers

Related papers: A Direct Construction of Cross Z-Complementary Seq…

200 papers

The construction of complementary sets (CSs) of sequences with different set size and sequence length become important due to its practical application for OFDM systems. Most of the constructions of CSs, based on generalized Boolean…

Information Theory · Computer Science 2020-02-19 Gaoxiang Wang , Avik Ranjan Adhikary , Zhengchun Zhou , Yang Yang

The contributions of this paper are twofold: Firstly, we introduce a novel class of sequence pairs, called "cross Z-complementary pairs (CZCPs)", each displaying zero-correlation zone (ZCZ) properties for both their aperiodic…

Information Theory · Computer Science 2020-04-22 Zilong Liu , Ping Yang , Yong Liang Guan , Pei Xiao

In recent years, traditional zero-correlation zone (ZCZ) sequences are being studied due to support interference-free quasi-synchronous code division multiple access (QS-CDMA) systems. However, in cognitive radio (CR) network, it is…

Information Theory · Computer Science 2023-09-06 Nishant Kumar , Palash Sarkar , Sudhan Majhi

Generalized spatial modulation (GSM) is a novel multiple-antenna technique offering flexibility among spectral efficiency, energy efficiency, and the cost of RF chains. In this paper, a novel class of sequence sets, called enhanced cross…

Information Theory · Computer Science 2023-12-04 Zhen-Ming Huang , Cheng-Yu Pai , Zilong Liu , Chao-Yu Chen

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…

Information Theory · Computer Science 2021-08-16 Zhi Gu , Zhengchun Zhou , Avik Ranjan Adhikary , Yanghe Feng , Pingzhi Fan

We propose new constructions for a two-dimensional ($2$D) perfect array, complete complementary code (CCC), and multiple CCCs as an optimal symmetrical $Z$-complementary code set (ZCCS). We propose a method to generate a two-dimensional…

Information Theory · Computer Science 2024-08-27 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

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,…

Information Theory · Computer Science 2020-10-22 Avik Ranjan Adhikary , Yanghe Feng , Zhengchun Zhou , Pingzhi Fan

We introduce a construction for periodic zero correlation zone (ZCZ) sequences over roots of unity. The sequences share similarities to the perfect periodic sequence constructions of Liu, Frank, and Milewski. The sequences have two non-zero…

Information Theory · Computer Science 2012-12-04 Samuel T. Blake , Andrew Z. Tirkel

Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete complementary codes…

Information Theory · Computer Science 2024-01-12 Palash Sarkar , Chunlei Li , Sudhan Majhi , Zilong Liu

Golay complementary set (GCS) plays a vital role in reducing peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM). A more general version of GCS is a multiple shift complementary set (MSCS), where…

Information Theory · Computer Science 2023-05-12 Abhishek Roy , Sudhan Majhi

Perfect complementary sequence sets (PCSSs) are widely used in multi-carrier code-division multiple-access (MC-CDMA) communication systems. However, the set size of a PCSS is upper bounded by the number of row sequences of each…

Information Theory · Computer Science 2024-12-03 Ziling Heng , Peng Wang , Chunlei Xie , Haiyan Zhou

In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying…

Information Theory · Computer Science 2021-08-05 Alphan Sahin , Rui Yang

For a type-I $(K,M,Z,N)$-ZCCS, it follows $K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. In this paper, we propose a construction of type-II $(p^{k+n},p^k,p^{n+r}-p^r+1,p^{n+r})$-$Z$ complementary code set (ZCCS) using an extended…

Information Theory · Computer Science 2024-05-15 Rajen Kumar , Prashant Kumar Srivastava , Sudhan Majhi

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…

Information Theory · Computer Science 2023-02-23 Gobinda Ghosh , Sudhan Majhi , Shubabrata Paul

A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums (AACSs) for time-shifts within a certain region, called zero correlation zone (ZCZ). Optimal odd-length binary ZCPs (OB-ZCPs) display…

Information Theory · Computer Science 2019-09-24 Avik Ranjan Adhikary , Sudhan Majhi , Zilong Liu , Yong Liang Guan

In this paper, we propose a direct construction of optimal two-dimensional Z-complementary array code sets (2D-ZCACS) using multivariable functions (MVFs). In contrast to earlier works, the proposed construction allows for a flexible array…

Information Theory · Computer Science 2023-01-09 Gobinda Ghosh , Sudhan Majhi , Shubhabrata Paul

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…

Information Theory · Computer Science 2021-09-29 Gaojun Luo , Martianus Frederic Ezerman , San Ling

A new method to construct $q$-ary complementary sequence (or array) sets (CSSs) and complete complementary codes (CCCs) of size $N$ is introduced in this paper. An algorithm on how to compute the explicit form of the functions in…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Dongxu Ma , Guang Gong

The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary sets (ZCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations for this conjectured bound. A ZCS is optimal when…

Information Theory · Computer Science 2024-12-03 Cheng-Yu Pai , Yu-Che Tung , Zhen-Ming Huang , Chao-Yu Chen

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…

Information Theory · Computer Science 2022-04-08 Praveen Kumar , Sudhan Majhi , Subhabrata Paul