English
Related papers

Related papers: Asymptotically Optimal Golay-ZCZ Sequence Sets wit…

200 papers

Spectrally constrained sequences (SCSs) play an important role in modern communication and radar systems operating over non-contiguous spectrum. Despite numerous research attempts over the past years, very few works are known on the…

Information Theory · Computer Science 2022-09-27 Zhifan Ye , Zhengchun Zhou , Zilong Liu , Xiaohu Tang , Pingzhi Fan

Zadoff-Chu (ZC) sequences have been used as synchronization sequences in modern wireless communication systems, replacing the conventional pseudo-random noise (PN) sequences due to their perfect autocorrelation properties. We first study…

Networking and Internet Architecture · Computer Science 2014-06-16 Min Hua , Kristo W. Yang , M. Wang , Kingsley J. Zou

Like other pseudorandom sequences, decimal sequences may be used in designing a Code Division Multiple Access (CDMA) system. They appear to be ideally suited for this since the cross-correlation of d-sequences taken over the LCM of their…

Information Theory · Computer Science 2008-04-22 Sandeep Chalasani

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

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

Information Theory · Computer Science 2019-05-30 Christian Günther , Kai-Uwe Schmidt

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

Aperiodic autocorrelation is an important indicator of performance of sequences used in communications, remote sensing, and scientific instrumentation. Knowing a sequence's autocorrelation function, which reports the autocorrelation at…

Information Theory · Computer Science 2025-01-07 Daniel J. Katz , Adeebur Rahman , Michael J Ward

Using the minimal parameter sequence of a given chain sequence, we introduce the concept of complementary chain sequences, which we view as perturbations of chain sequences. Using the relation between these complementary chain sequences and…

Classical Analysis and ODEs · Mathematics 2018-02-21 Kiran Kumar Behera , A. Sriranga , A. Swaminathan

We will investigate practical aspects for a recently introduced blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), which enables reliable transmission of sporadic and short-packets at ultra-low…

Information Theory · Computer Science 2019-02-11 Philipp Walk , Peter Jung , Babak Hassibi , Hamid Jafarkhani

The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for…

Information Theory · Computer Science 2010-03-16 Chenggao Han , Naoki Suehiro , Takeshi Hashimoto

Sequences with good correlation properties are widely used in engineering applications, especially in the area of communications. Among the known sequences, cyclotomic families have the optimal autocorrelation property. In this paper, we…

Information Theory · Computer Science 2009-09-28 Kai Cai , Rongquan Feng , Zhiming Zheng

Pairs of binary sequences formed using linear combinations of multiplicative characters of finite fields are exhibited that, when compared to random sequence pairs, simultaneously achieve significantly lower mean square autocorrelation…

Information Theory · Computer Science 2017-03-28 Kelly T. R. Boothby , Daniel J. Katz

The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…

Information Theory · Computer Science 2016-02-12 Kai-Uwe Schmidt

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

In 2008, a class of binary sequences of period $N=4(2^k-1)(2^k+1)$ with optimal autocorrelation magnitude has been presented by Yu and Gong based on an $m$-sequence, the perfect sequence $(0,1,1,1)$ of period $4$ and interleaving technique.…

Information Theory · Computer Science 2020-09-17 Yuhua Sun , Tongjiang Yan , Qiuyan Wang

Certain applications require the use of signals that combine both the capability to operate with low signal-to-noise ratios and the ability to support multiple users without interference. In the case where many users have very different…

Information Theory · Computer Science 2021-03-10 Patricio G. Donato , Matias N. Hadad , Marcos A. Funes

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…

Information Theory · Computer Science 2023-08-10 Dan Zhang , Staal A. Vinterbo

Pseudorandom sequences are used extensively in communications and remote sensing. Correlation provides one measure of pseudorandomness, and low correlation is an important factor determining the performance of digital sequences in…

Information Theory · Computer Science 2018-06-14 Daniel J. Katz
‹ Prev 1 3 4 5 6 7 10 Next ›