Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Electrical, Control and Communication Engineering
Volume 13 (2017): Issue 1 (December 2017)
Open Access
Computationally Efficient Chaotic Spreading Sequence Selection for Asynchronous DS-CDMA
Anna Litviņenko
Anna Litviņenko
Riga Technical University
Search for this author on
Sciendo
|
Google Scholar
Litviņenko, Anna
and
Artūrs Āboltiņš
Artūrs Āboltiņš
Riga Technical University
Search for this author on
Sciendo
|
Google Scholar
Āboltiņš, Artūrs
Dec 29, 2017
Electrical, Control and Communication Engineering
Volume 13 (2017): Issue 1 (December 2017)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Dec 29, 2017
Page range:
75 - 80
DOI:
https://doi.org/10.1515/ecce-2017-0011
Keywords
Baseband
,
Binary sequences
,
Chaotic communication
,
Communication systems
,
Direct-sequence code-division multiple access
,
Minimization
,
Wireless sensor networks
© 2017 Anna Litviņenko et al., published by De Gruyter Open
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
