Finite-step algorithms for constructing optimal CDMA signature sequences. Tropp, J., Dhillon, I., & Heath Jr., R. IEEE Transactions on Information Theory, 2004. abstract bibtex A description of optimal sequences for direct-spread code-division multiple access (S-CDMA) is a byproduct of recent characterizations of the sum capacity. This correspondence restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods. ? 2004 IEEE.
@article{
title = {Finite-step algorithms for constructing optimal CDMA signature sequences},
type = {article},
year = {2004},
identifiers = {[object Object]},
volume = {50},
id = {e0f5bd9a-f8e0-3920-b604-786611af7fbd},
created = {2016-09-06T19:47:43.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 (S-CDMA) is a byproduct of recent characterizations of the sum capacity. This correspondence restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods. ? 2004 IEEE.},
bibtype = {article},
author = {Tropp, J.A. and Dhillon, I.S. and Heath Jr., R.W.},
journal = {IEEE Transactions on Information Theory},
number = {11}
}
Downloads: 0
{"_id":"FZzhWLo6JY3dXoGeK","bibbaseid":"tropp-dhillon-heathjr-finitestepalgorithmsforconstructingoptimalcdmasignaturesequences-2004","authorIDs":[],"author_short":["Tropp, J.","Dhillon, I.","Heath Jr., R."],"bibdata":{"title":"Finite-step algorithms for constructing optimal CDMA signature sequences","type":"article","year":"2004","identifiers":"[object Object]","volume":"50","id":"e0f5bd9a-f8e0-3920-b604-786611af7fbd","created":"2016-09-06T19:47:43.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 (S-CDMA) is a byproduct of recent characterizations of the sum capacity. This correspondence restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods. ? 2004 IEEE.","bibtype":"article","author":"Tropp, J.A. and Dhillon, I.S. and Heath Jr., R.W.","journal":"IEEE Transactions on Information Theory","number":"11","bibtex":"@article{\n title = {Finite-step algorithms for constructing optimal CDMA signature sequences},\n type = {article},\n year = {2004},\n identifiers = {[object Object]},\n volume = {50},\n id = {e0f5bd9a-f8e0-3920-b604-786611af7fbd},\n created = {2016-09-06T19:47:43.000Z},\n file_attached = {false},\n profile_id = {be62f108-1255-3a2e-9f9e-f751a39b8a03},\n last_modified = {2017-03-24T19:20:02.182Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {A description of optimal sequences for direct-spread code-division multiple access (S-CDMA) is a byproduct of recent characterizations of the sum capacity. This correspondence restates the sequence design problem as an inverse singular value problem and shows that the problem can be solved with finite-step algorithms from matrix theory. It proposes a new one-sided algorithm that is numerically stable and faster than previous methods. ? 2004 IEEE.},\n bibtype = {article},\n author = {Tropp, J.A. and Dhillon, I.S. and Heath Jr., R.W.},\n journal = {IEEE Transactions on Information Theory},\n number = {11}\n}","author_short":["Tropp, J.","Dhillon, I.","Heath Jr., R."],"bibbaseid":"tropp-dhillon-heathjr-finitestepalgorithmsforconstructingoptimalcdmasignaturesequences-2004","role":"author","urls":{},"downloads":0},"bibtype":"article","creationDate":"2020-10-14T23:11:31.484Z","downloads":0,"keywords":[],"search_terms":["finite","step","algorithms","constructing","optimal","cdma","signature","sequences","tropp","dhillon","heath jr."],"title":"Finite-step algorithms for constructing optimal CDMA signature sequences","year":2004}