The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions
Authors:
- 26 June 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 11 (8) , 1-6
Abstract
In a recent paper spreading codes for CDMA systems were constructed based on Hadamard matrices and semi-bent functions. These codes were applicable to synchronous CDMA systems and to quasi-synchronous CDMA systems when a loosely-synchronized code is used. The codes consist of the union of rows of four Hadamard matrices. The codes can be assigned to a regular tessellation of hexagonal cells in such a way that the correlation between codewords assigned to adjacent cells is zero, while the correlation between codewords assigned to non-adjacent cells is small. The use of codewords from four Hadamard matrices allows greater codeword re-use distances than the use of codewords from a single Hadamard matrix. This has advantages for both satellite and terrestrial systems. These codes only support a single data rate. The current paper shows how orthogonal variable spreading factor codes can be created from them by a careful selection of the semi-bent functions used.Keywords
This publication has 8 references indexed in Scilit:
- Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard MatricesIEEE Transactions on Information Theory, 2010
- Boolean Functions for Cryptography and Error-Correcting Codes2010
- Gold codes, Hadamard partitions and the security of CDMA systemsDesigns, Codes and Cryptography, 2008
- Design of spreading codes for quasi-synchronous CDMA with intercell interferenceIEEE Journal on Selected Areas in Communications, 2005
- On Bent and Semi-Bent Quadratic Boolean FunctionsIEEE Transactions on Information Theory, 2005
- Quasi-orthogonal sequences for code-division multiple-access systemsIEEE Transactions on Information Theory, 2000
- Spreading codes for direct sequence CDMA and wideband CDMA cellular networksIEEE Communications Magazine, 1998
- Semi-bent functions1995