Fast Algorithms for Generating Real-Valued Spreading Sequences for High-Speed Wireless Communication Systems Based on PSSS
Łukasz Łopaciński, N. Maletic, Alireza Hasani, Jesús Gutiérrez, Eckhard Grass · 2021
This paper proposes four uncomplicated algorithms for generating real-valued spreading sequences, which have all coefficients defined in the real domain and achieve excellent bit error rate (BER) performance in parallel sequence spread spectrum (PSSS) systems. The proposed algorithms are less complicated than other solutions published so far. Moreover, our methods do not have the length limitations of 2m-l like in the case of binary m-sequences. Thus, we can build a sequence in any length and use PSSS with the symbol sizes of 16, 32, 64, and 128 bits. Such symbol sizes are more friendly for embedded systems than symbols with 15, 31, 63, 127 bits supported by binary m-sequences.