Complete complementary codes with larger sets improve wireless communication
Construction of New Complete Complementary Codes Using Extended Boolean Functions and Permutations
Information Theory
Summary
Wireless communication systems need special codes to reduce interference so many users can connect at once. The authors found a new way to build these codes using extended Boolean functions and permutations. Their new codes allow bigger sets than before, which means more users can be supported without interference. They also control signal properties that affect quality, making them potentially useful for better wireless networks.
What this means in practice
- •For wireless network engineers: Design interference-resistant codes that support more users simultaneously in wireless systems with improved signal quality.
- •For communications hardware developers: Implement new coding schemes with bounded PMEPR to optimize transmitter performance in multi-user environments.
Authors
Aditya Prakash, Rajen Kumar
Abstract
Complete complementary code (CCC) is a crucial component in the design and optimization of modern wireless communication systems, particularly in addressing challenges related to interference, spectral efficiency, and signal quality. The design of CCCs is an active area of research, as it directly impacts the number of users that can be supported interference-free in the system. In the literature, CCC constructions are restricted by a set size smaller than the sequence length. In this paper, we introduce a novel construction method for CCCs based on the extended Boolean functions (EBF) that overcome existing restrictions by including a set size bigger than the sequence length. Further, the proposed construction uses functions which are new in literature and provide us with new CCCs. This is also the very first construction where row PMEPR is also bounded by $n$ for a set size in the form of power of $n$.