English
Related papers

Related papers: Non-standard Golay Complementary Sequence Pair ove…

200 papers

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

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ć

Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…

Information Theory · Computer Science 2019-10-24 Zilong Wang , Gaofei Wu , Dongxu Ma

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

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 provide a complete enumeration of all complex Golay pairs of length up to 25, verifying that complex Golay pairs do not exist in lengths 23 and 25 but do exist in length 24. This independently verifies work done by F. Fiedler in 2013…

Logic in Computer Science · Computer Science 2018-11-09 Curtis Bright , Ilias Kotsireas , Albert Heinle , Vijay Ganesh

Golay complementary matrices (GCM) have recently drawn considerable attentions owing to its potential applications in omnidirectional precoding. In this paper we generalize the GCM to multi-dimensional Golay complementary arrays (GCA) and…

Signal Processing · Electrical Eng. & Systems 2024-10-15 Cheng Du , Yi Jiang

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

3-phase Golay sequence and array triads are a natural generalisation of 2-phase Golay sequence pairs, yet their study has until now been largely neglected. We present exhaustive search results for 3-phase Golay sequence triads for all…

Combinatorics · Mathematics 2019-10-15 Aki Ayukawa Avis , Jonathan Jedwab

Sequences with good correlation properties have been widely adopted in modern communications, radar and sonar applications. In this paper, we present our new findings on some constructions of single $H$-ary Golay sequence and $4^q$-QAM…

Information Theory · Computer Science 2011-06-24 Guang Gong , Fei Huo , Yang Yang

To find the non-standard binary Golay complementary sequences (GCSs) of length $2^{m}$ or theoretically prove the nonexistence of them are still open. Since it has been shown that all the standard $q$-ary (where $q$ is even) GCSs of length…

Information Theory · Computer Science 2022-07-12 Erzhong Xue , Zilong Wang

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

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

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

In this paper, we provide algorithmic methods for conducting exhaustive searches for periodic Golay pairs. Our methods enumerate several lengths beyond the currently known state-of-the-art available searches: we conducted exhaustive…

Discrete Mathematics · Computer Science 2025-10-20 Tyler Lumsden , Ilias Kotsireas , Curtis Bright

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

We extend the paraunitary (PU) theory for complementary pairs to comple- mentary sets and complete complementary codes (CCC) by proposing a new PU construction. A special, but very important case of complementary sets (and CC- C), based on…

Information Theory · Computer Science 2018-08-31 Srdjan Z. Budisin

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

Golay sequences are well suited for the use as codewords in orthogonal frequency-division multiplexing (OFDM), since their peak-to-mean envelope power ratio (PMEPR) in q-ary phase-shift keying (PSK) modulation is at most 2. It is known that…

Information Theory · Computer Science 2007-07-16 Kai-Uwe Schmidt

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
‹ Prev 1 2 3 10 Next ›