Computer Science – Information Theory
Scientific paper
2012-02-19
Computer Science
Information Theory
9 pages, 11 figures
Scientific paper
The objective of this paper is to design optimal signature matrices for binary inputs. For the determination of such optimal codes, we need certain measures as objective functions. The sum-channel capacity and Bit Error Rate (BER) measures are typical methods for the evaluation of signature matrices. In this paper, in addition to these measures, we use distance criteria to evaluate the optimality of signature matrices. The Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are used to search the optimum signature matrices based on these three measures (Sum channel capacity, BER and Distance). Since the GA and PSO algorithms become computationally expensive for large signature matrices, we propose suboptimal large signature matrices that can be derived from small suboptimal matrices.
Azghani E.
Ghassemian M.
Khoozani Heidari M.
Marvasti Farokh
No associations
LandOfFree
On Finding Sub-optimum Signature Matrices for Overloaded CDMA Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Finding Sub-optimum Signature Matrices for Overloaded CDMA Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Finding Sub-optimum Signature Matrices for Overloaded CDMA Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-419676