English
Related papers

Related papers: New Construction of Complementary Sequence (or Arr…

200 papers

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ć

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

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 characterize group symmetries of poly-phase complementary code matrices (CCMs), which we use to classify CCMs in terms of their equivalence classes. We also present classification results for CCMs of dimension $N\times 4$ where…

Information Theory · Computer Science 2015-06-02 Brooke Logan , Hieu D. Nguyen

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

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

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

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

Two arrays form a periodic complementary pair if the sum of their periodic autocorrelations is a delta function. Finding such pairs, however, is challenging for large arrays whose entries are constrained to a small alphabet. One such…

Signal Processing · Electrical Eng. & Systems 2020-04-29 Nitin Jonathan Myers , Robert W. Heath

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

Information Theory · Computer Science 2022-02-25 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

In this paper, we propose a direct construction of a novel type of code set, which has combined properties of complete complementary code (CCC) and zero-correlation zone (ZCZ) sequences and called it complete complementary-ZCZ (CC-ZCZ) code…

Information Theory · Computer Science 2022-07-28 Nishant Kumar , Sudhan Majhi , A. K. Upadhyay

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

The rapid progression in wireless communication technologies, especially in multicarrier code-division multiple access (MC-CDMA), there is a need of advanced code construction methods. Traditional approaches, mainly based on generalized…

Information Theory · Computer Science 2024-09-13 Gobinda Ghosh , Sachin Pathak

We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…

Information Theory · Computer Science 2013-12-05 Gaofei Wu , Matthew G. Parker

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

Golay complementary pair (GCP), first introduced by Golay in 1951, has been extensively studied and widely applied in communication systems. A $q$-ary GCP $\{\mathbf{A},\mathbf{B}\}$ consists of two $q$-ary complex sequences…

Information Theory · Computer Science 2026-04-17 Zhiye Yang , Keqin Feng

The concept of paraunitary (PU) matrices arose in the early 1990s in the study of multi-rate filter banks. So far, these matrices have found wide applications in cryptography, digital signal processing, and wireless communications. Existing…

Information Theory · Computer Science 2019-06-25 Shibsankar Das , Udaya Parampalli , 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

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Discrete Mathematics · Computer Science 2017-11-02 Alexander M. Romanov