|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
24 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Almost-Optimum Signature Matrices in Binary-Input Synchronous Overloaded CDMA | | M. Heidari Khoozani
; A. Rashidinejad
; M. H. Lotfi Froushani
; P. Pad
; F. Marvasti
; | | Date: |
9 Dec 2010 | | Abstract: | 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. | | Source: | arXiv, 1012.2073 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER