M. D. De Campos, S. Werner, J. A. Apolinário, T. Laakso
{"title":"CDMA移动通信的约束拟牛顿算法","authors":"M. D. De Campos, S. Werner, J. A. Apolinário, T. Laakso","doi":"10.1109/ITS.1998.713150","DOIUrl":null,"url":null,"abstract":"This work presents the derivation of the constrained version of a quasi-Newton (QN) algorithm. Application of such an algorithm to the problem of direct-sequence code-division multiple access (DS-CDMA) is investigated through simulations. The algorithm is compared to other constrained adaptation algorithms known in the literature in terms of convergence rate for a similar misadjustment level. Two scenarios describing synchronous and asynchronous transmission are used in simulations of interference suppression in DS-CDMA communication, showing the capabilities of the algorithm in such applications.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Constrained quasi-Newton algorithm for CDMA mobile communications\",\"authors\":\"M. D. De Campos, S. Werner, J. A. Apolinário, T. Laakso\",\"doi\":\"10.1109/ITS.1998.713150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work presents the derivation of the constrained version of a quasi-Newton (QN) algorithm. Application of such an algorithm to the problem of direct-sequence code-division multiple access (DS-CDMA) is investigated through simulations. The algorithm is compared to other constrained adaptation algorithms known in the literature in terms of convergence rate for a similar misadjustment level. Two scenarios describing synchronous and asynchronous transmission are used in simulations of interference suppression in DS-CDMA communication, showing the capabilities of the algorithm in such applications.\",\"PeriodicalId\":205350,\"journal\":{\"name\":\"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.1998.713150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.1998.713150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constrained quasi-Newton algorithm for CDMA mobile communications
This work presents the derivation of the constrained version of a quasi-Newton (QN) algorithm. Application of such an algorithm to the problem of direct-sequence code-division multiple access (DS-CDMA) is investigated through simulations. The algorithm is compared to other constrained adaptation algorithms known in the literature in terms of convergence rate for a similar misadjustment level. Two scenarios describing synchronous and asynchronous transmission are used in simulations of interference suppression in DS-CDMA communication, showing the capabilities of the algorithm in such applications.