Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/FAF88EC4-0DD5-4BE7-B3AD-4E8B199D5A57 | ||
| Year | 2015 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | G. N. Karystinos and D. A. Pados, “Rank-2-optimal binary spreading codes,” in Proc. Conference on Information Sciences and Systems (CISS'06),Princeton, pp. 1534-1539, doi: 10.1109/CISS.2006.286383 https://doi.org/10.1109/CISS.2006.286383 | ||
| Appears in Collections |
Over the real/complex field, the spreading code that maximizes the output signal-to-interference-plus-noise ratio (SINR) of the linear maximum-SINR receiver is the minimum-eigenvalue eigenvector of the interference autocovariance matrix. In the context of binary spreading codes, the maximization problem is NP-hard with complexity exponential in the code length. A new method for the optimization of binary spreading codes under a rank-2 approximation of the inverse interference autocovariance matrix is presented where the rank-2-optimal binary code is obtained in lower than quadratic complexity. Significant SINR performance improvement is demonstrated over the common binary hard-limited eigenvector design which is seen to be equivalent to the rank-1-optimal solution.
Copyright © DIAS 2013
