English
Related papers

Related papers: Generalized Constructions of Complementary Sets of…

200 papers

Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean…

Information Theory · Computer Science 2020-03-17 Shing-Wei Wu , Chao-Yu Chen , Zilong Liu

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

A new method to construct $q$-ary complementary sequence sets (CSSs) and complete complementary codes (CCCs) of size $N$ is proposed by using desired para-unitary (PU) matrices. The concept of seed PU matrices is introduced and a systematic…

Information Theory · Computer Science 2020-01-15 Zilong Wang , Dongxu Ma , Guang Gong , Erzhong Xue

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

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

One of the important applications of Golay complementary sets (GCSs) is the reduction of peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. OFDM has played a major role in modern wireless…

Information Theory · Computer Science 2025-01-06 Abhishek Roy , Sudhan Majhi , Subhabrata Paul

A major drawback of orthogonal frequency division multiplexing (OFDM) systems is their high peak-to-mean envelope power ratio (PMEPR). The PMEPR problem can be solved by adopting large codebooks consisting of complementary sequences with…

Information Theory · Computer Science 2020-06-24 Palash Sarkar , Sudhan Majhi , Zilong Liu

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of…

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

The previous constructions of quadrature amplitude modulation (QAM) Golay complementary sequences (GCSs) were generalized as $4^q $-QAM GCSs of length $2^{m}$ by Li \textsl{et al.} (the generalized cases I-III for $q\ge 2$) in 2010 and Liu…

Information Theory · Computer Science 2020-12-22 Zilong Wang , Erzhong Xue , Guang Gong

In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can…

Information Theory · Computer Science 2021-05-24 Zhengchun Zhou , Fangrui Liu , Avik Ranjan Adhikary , Pingzhi Fan

One-dimensional (1-D) Golay complementary sets(GCSs) possess numerous well-known properties and have achieved extensive use in communication engineering. The concept of 1-D GCSs can be extended to two-dimensional (2-D) Golay complementary…

Signal Processing · Electrical Eng. & Systems 2025-03-25 Zhaoyu Zhang , Xiaoyu Chen , Yuqiong Du , Luyi Zheng

This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ width…

Information Theory · Computer Science 2022-07-26 Praveen Kumar , Sudhan Majhi , Subhabrata Paul

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

Mutually orthogonal complementary sets (MOCSs) and Z-complementary code sets (ZCCSs) have many applications in practical scenarios such as synthetic aperture imaging systems and multi-carrier code division multiple access (MC-CDMA) systems.…

Information Theory · Computer Science 2023-08-10 Hongyang Xiao , Xiwang Cao

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

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

Previously, we have presented a framework to use the para-unitary (PU) matrix-based approach for constructing new complementary sequence set (CSS), complete complementary code (CCC), complementary sequence array (CSA), and complete…

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

In this work, we construct $4$-phase Golay complementary sequence (GCS) set of cardinality $2^{3+\lceil \log_2 r \rceil}$ with arbitrary sequence length $n$, where the $10^{13}$-base expansion of $n$ has $r$ nonzero digits. Specifically,…

Information Theory · Computer Science 2024-01-30 Cheng Du , Yi Jiang

We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length 2^N using Boolean functions. The algorithm follows our earlier paraunitary algorithm,…

Information Theory · Computer Science 2013-11-20 Srdjan Budišin , Predrag Spasojević

Due to the zero nontrivial aperiodic correlation of complete complementary code (CCCs), it is used in asynchronous multi carrier code division multiple access (MC-CDMA) communication to provide zero interference performance. However, there…

Information Theory · Computer Science 2021-05-24 Bingsheng Shen , Yang Yang , Zhengchun Zhou
‹ Prev 1 2 3 10 Next ›