English
Related papers

Related papers: A Generic Complementary Sequence Construction and …

200 papers

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

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

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

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

In this study, we propose partitioned complementary sequences (CSs) where the gaps between the clusters encode information bits to achieve low peak-to-average-power ratio (PAPR) orthogonal frequency division multiplexing (OFDM) symbols. We…

Information Theory · Computer Science 2021-09-16 Alphan Sahin

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

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

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

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

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

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

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

Z-complementary code set (ZCCS), an extension of perfect complementary codes (CCs), refers to a set of two-dimensional matrices having zero correlation zone properties. ZCCS can be used in various multi-channel systems to support, for…

Information Theory · Computer Science 2019-11-11 Palash Sarkar , Sudhan Majhi , Zilong Liu

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

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

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

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

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

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

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ć

In this study, we propose two schemes for uplink control channels based on non-contiguous complementary sequences (CSs) where the peak-to-average-power ratio (PAPR) of the resulting orthogonal frequency division multiplexing (OFDM) signal…

Information Theory · Computer Science 2019-04-03 Alphan Şahin , Rui Yang
‹ Prev 1 2 3 10 Next ›