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...

Full description

Saved in:
Bibliographic Details
Published inIET communications Vol. 7; no. 4; pp. 295 - 306
Main Authors Khoozani, Mohsen Heidari, Marvasti, Farokh, Azghani, Masoumeh, Ghassemian, Mona
Format Journal Article
LanguageEnglish
Published Stevenage The Institution of Engineering and Technology 01.03.2013
John Wiley & Sons, Inc
Subjects
Online AccessGet full text
ISSN1751-8628
1751-8636
1751-8636
DOI10.1049/iet-com.2012.0208

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1751-8628
1751-8636
1751-8636
DOI:10.1049/iet-com.2012.0208