In *IEEE International Symposium on Spread Spectrum Techniques and Applications*, 2004.

abstract bibtex

abstract bibtex

A description of optimal sequences for direct-spread code division multiple access is a byproduct of recent characterizations of the sum capacity. This papers restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that obtains the sequences directly instead of computing the Gram matrix of the optimal signatures. ? 2004 IEEE.

@inproceedings{ title = {Optimal CDMA signatures: A finite-step approach}, type = {inproceedings}, year = {2004}, identifiers = {[object Object]}, id = {29aae1ee-cf59-3721-9c48-07cd1415efe9}, created = {2016-09-06T19:47:46.000Z}, file_attached = {false}, profile_id = {be62f108-1255-3a2e-9f9e-f751a39b8a03}, last_modified = {2017-03-24T19:20:02.182Z}, read = {false}, starred = {false}, authored = {true}, confirmed = {false}, hidden = {false}, private_publication = {false}, abstract = {A description of optimal sequences for direct-spread code division multiple access is a byproduct of recent characterizations of the sum capacity. This papers restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that obtains the sequences directly instead of computing the Gram matrix of the optimal signatures. ? 2004 IEEE.}, bibtype = {inproceedings}, author = {Tropp, J.A. and Dhillon, I.S. and Heath Jr., R.W.}, booktitle = {IEEE International Symposium on Spread Spectrum Techniques and Applications} }

Downloads: 0