Abstract
Golay complementary sequences are highly valued in Orthogonal Frequency-Division Multiplexing (OFDM) systems due to their excellent Peak-to-Mean Envelope Power Ratio (PMEPR) properties. However, as code length increases, the code rate of standard Golay sequences declines dramatically. While significant research has addressed the code rate problem, constructing large classes of sequences with low PMEPR remains a complex challenge. This paper proposes a novel method to construct $q$-ary Golay complementary sets of size $N$ and length $N^n$ using $N \times N$ Hadamard matrices, where $n$ is arbitrary and $N$ is a power of 2. By representing sequence items as products of specific Hadamard matrix entries, this approach generalizes previous frameworks and identifies new quaternary Golay sets with higher algebraic complexity than those previously reported.
Introduction
In modern wireless communication, Orthogonal Frequency-Division Multiplexing (OFDM) serves as a foundational technology for standards like Wi-Fi and LTE. Despite its efficiency, OFDM faces a significant hurdle: high Peak-to-Mean Envelope Power Ratio (PMEPR). When signal peaks significantly exceed average power, expensive and inefficient power amplifiers are required to prevent distortion.
Golay complementary sequences offer a mathematical solution to this problem, as they possess a guaranteed PMEPR of at most 2. However, the utility of "standard" Golay sequences (specifically GDJ sequences) is limited by a "code rate decline"—as sequence length increases, the density of available sequences drops, limiting data transmission efficiency. This research addresses the need for new, non-standard classes of sequences to expand the available codebook for OFDM applications.
Methodology: A Matrix-Based Approach
Traditional constructions of Golay sequences often rely on Boolean functions. This paper pivots toward a matrix-based framework, utilizing the properties of Butson-type Hadamard matrices and paraunitary matrices.
Key Components
- Butson-type Hadamard Matrices: These are $N \times N$ matrices where every entry is a $q$-th root of unity and all rows are mutually orthogonal.
- Paraunitary Matrices: These matrix polynomials remain unitary across all points on a unit circle, ensuring signal energy preservation.
- Recursive Construction: The authors define a recursive method where sequences are generated through the product of specific Hadamard matrix entries interspersed with diagonal paraunitary matrices.
While prior landmark studies (e.g., Budisin and Spasojevic) focused primarily on cases where $N=2$, this work generalizes the construction for any $N$ that is a power of 2 and for any arbitrary length $N^n$.
Breaking the Algebraic Barrier
A pivotal insight of this research is the transition from second-order to third-order algebraic complexity. Most standard Golay sequences are restricted to an algebraic degree of 2. By utilizing the non-commutative nature of matrix multiplication—where the order of operations significantly impacts the outcome—the authors demonstrate that their method produces sequences with an algebraic degree of 3.
This higher degree of complexity is significant because it allows for the discovery of sequences that Boolean-function methods, which are typically limited to second-order cosets, cannot reach. The non-commutativity of the matrices essentially acts as a feature, allowing for the generation of vast families of unique sequences by simply altering the selection or sequence of the Hadamard matrices used in the construction.
Key Results and Discovery
The paper provides rigorous mathematical proofs (Theorems 2 and 5) confirming that any sequence generated via this "Construction 1" is guaranteed to be a $q$-ary Golay complementary set.
Major findings include:
- New Quaternary Sets: The identification of previously unreported quaternary (4-ary) Golay sets of size 4 and degree 3.
- PMEPR Guarantees: The constructed sequences maintain a PMEPR upper-bounded by $N$. For the specific case of $N=4$, this provides a stable and predictable power envelope for OFDM subcarriers.
- Generalization of Prior Work: The authors successfully demonstrate that previous algorithms in the field are actually special cases of this broader, more flexible framework.
Conclusion and Future Directions
This research expands the mathematical toolkit for wireless engineers by providing a systematic way to generate high-complexity Golay sets. While the paper focuses on the case of $N=4$ to maintain clarity in its proofs, the logic is applicable to all $N=2^k$.
Future work will involve exploring the computational overhead required to implement these degree-3 sequences in real-time hardware compared to standard sequences. Additionally, because any Butson-type Hadamard matrix can be integrated into this construction, there remains a massive, yet-to-be-categorized family of sequences that could further optimize future generations of wireless communication systems.
Summary updated