Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Rank-2-optimal binary spreading codes

Karystinos Georgios, Pados D. A.

Simple record

URIhttp://purl.tuc.gr/dl/dias/FAF88EC4-0DD5-4BE7-B3AD-4E8B199D5A57-
Identifierhttps://doi.org/10.1109/CISS.2006.286383-
Languageen-
Extent5en
TitleRank-2-optimal binary spreading codesen
CreatorKarystinos Georgiosen
CreatorΚαρυστινος Γεωργιοςel
Creator Pados D. A.en
PublisherInstitute of Electrical and Electronics Engineersen
Content SummaryOver 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.en
Type of ItemΠλήρης Δημοσίευση σε Συνέδριοel
Type of ItemConference Full Paperen
Licensehttp://creativecommons.org/licenses/by-nc-nd/4.0/en
Date of Item2015-11-10-
Date of Publication2015-
SubjectBinary sequencesen
Subjectcode-division multiple-access (CDMA)en
Subjectcode-division multiplexingen
Bibliographic CitationG. 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.286383en

Services

Statistics

 

Copyright © DIAS 2013