A generalized Boolean function generator for complementary sequences

Abstract

-We present a general algorithm for generating arbitrary standard complementary pairs of sequences (including binary, polyphase, M-PSK and QAM) of length using Boolean functions. The algorithm follows our earlier paraunitary algorithm, but does not require matrix multiplications. The algorithm can be easily and efficiently implemented in hardware. As a special case, it reduces to the non-recursive (direct) algorithm for generating binary sequences given by Golay, to the algorithm for generating M-PSK sequences given by Davis and Jedwab (and later improved by Paterson) and to all published algorithms for generating QAM sequences. The Boolean index form of the algorithm can directly be generalized to complementary sets.

Efficient PAPR reduction scheme for OFDM-NOMA systems based on DSI & precoding methods

“…The digital signal modulation scheme used in this simulation is quadrature phaseshift keying (QPSK). We utilized the method described in [36] to generate complementary pairs for the proposed dummy sequence generation algorithm. Finally, the additive white Gaussian noise (AWGN) channel is used in the simulations.…”

Design of a Multiorder OFDM Frequency Diversity Approach

“…Algebraic lattices are partially ordered sets such that a least upper bound and a greatest lower bound can be found for any subset consisting of two elements and [21] that means, for any two elements , ∈ Q, glb{ , } and lub{ , } are exist. If Q set is a lattice then we can define ∧ = glb{ , } and ∨ = lub{ , } [22,23]. For the purpose of this paper the simple dimensional algebraic lattice is expressed by…”