Finding sub-optimum signature matrices for overloaded code division multiple access systems

The objective of this study is to design sub-optimal signature matrices for binary inputs for an overloaded code division multiple access (CDMA) system as developed by this author group. In this study, the authors propose to use the sum capacity, the bit error rate and distance criteria as objective functions for signature matrix optimisation. Three optimisation techniques, the genetic algorithm, the particle swarm optimisation and the conjugate gradient (CG) are exploited in this work. Since the optimisation computational complexity increases by matrix dimensions, it is practically impossible to directly optimise the large signature matrices. In order to address this problem, a method is proposed to enlarge small-scale signature matrices. It is also proved that the sum channel capacity of the enlarged matrix is scaled by its enlargement factor. The results indicate that this proposed signature matrices provide higher sum capacity than the commonly used signature matrices. The authors also address that this matrices are applicable for highly overloaded CDMA systems.

[1]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[2]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[3]  Toshiyuki Tanaka,et al.  A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors , 2002, IEEE Trans. Inf. Theory.

[4]  J. Massey,et al.  Welch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems , 1993 .

[5]  Pedram Pad,et al.  Bounds on the Sum Capacity of Synchronous Binary CDMA Channels , 2008, IEEE Transactions on Information Theory.

[6]  Paul Cotae Optimal sequences and total weighted square correlation of synchronous CDMA systems , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[8]  Wŏn-yŏng Yang,et al.  Applied Numerical Methods Using MATLAB , 2005 .

[9]  Pedram Pad,et al.  A review on synchronous CDMA systems: optimum overloaded codes, channel capacity, and power control , 2011, EURASIP J. Wirel. Commun. Netw..

[10]  Ugo Vaccaro,et al.  Sequences II: Methods in Communication, Security, and Computer Science , 2011 .

[11]  Pedram Pad,et al.  Design of Signature Sequences for Overloaded CDMA and Bounds on the Sum Capacity With Arbitrary Symbol Alphabets , 2012, IEEE Transactions on Information Theory.

[12]  Rudolf Ahlswede,et al.  Multi-way communication channels , 1973 .

[13]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[14]  K. Horadam Hadamard Matrices and Their Applications , 2006 .

[15]  R. Ahlswede The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[16]  Dirk Sudholt,et al.  Computational complexity of evolutionary algorithms, hybridizations, and swarm intelligence , 2008 .

[17]  Pedram Pad,et al.  Almost-optimum signature matrices in binary-input synchronous overloaded CDMA , 2011, 2011 18th International Conference on Telecommunications.

[18]  O. Weck,et al.  A COMPARISON OF PARTICLE SWARM OPTIMIZATION AND THE GENETIC ALGORITHM , 2005 .

[19]  Nicolas Macris,et al.  Tight Bounds on the Capacity of Binary Input Random CDMA Systems , 2008, IEEE Transactions on Information Theory.

[20]  Saieed Akbari,et al.  A Class of Errorless Codes for Overloaded Synchronous Wireless and Optical CDMA Systems , 2009, IEEE Transactions on Information Theory.