Computer Science – Information Theory
Scientific paper
2010-12-09
Computer Science
Information Theory
6 Pages, 5 Figures, Submitted to the International Conference on Telecommunications 2011 (ICT-2011)
Scientific paper
The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is computationally expensive, we have focused on introducing a set of alternative criteria that not only speed up the matrix formation procedure, but also maintain optimality. The Bit Error Rate (BER) and Constellation measures are our main criteria propositions. Simulation results also verify our analytical justifications.
Khoozani Heidari M.
Lotfi Froushani M. H.
Marvasti Farokh
Pad Pedram
Rashidinejad A.
No associations
LandOfFree
Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA 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 Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77586