Abstract

In this letter, ternary semi-bent functions and a complex Hadamard matrix are used to construct spreading sequences for code-division multiple-access systems. An efficient assignment of these sequences to a lattice of regular hexagonal cells, which are mutually orthogonal within each cell and the adjacent cells, is achieved and most notably the number of sequences per cell is maximum possible. The large sequence reuse distances, being $\sqrt {27}$ , and low cross-correlation between non-orthogonal sequences (in non-adjacent cells) make these sequences appealing for practical applications.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.