<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     naa a22        4500</leader>
  <controlfield tag="001">510796737</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180411083339.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">180411e20131201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s11277-013-1224-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s11277-013-1224-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Abdulhamid Zahedi, Hamidreza Bakhshi]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">In this paper, we present an efficient evolutionary algorithm for the multi-user detection (MUD) problem in direct sequence-code division multiple access (DS-CDMA) communication systems. The optimum detector for MUD is the maximum likelihood (ML) detector, but its complexity is very high and involves an exhaustive search to reach the best fitness of transmitted and received data. Thus, there has been considerable interest in suboptimal multiuser detectors with less complexity and reasonable performance. The proposed algorithm is a combination of adaptive LMS Algorithm and modified genetic algorithm (GA). Indeed the LMS algorithm provides a good initial response for GA, and GA will be applied for this response to reach the best answer. The proposed GA reduces the dimension of the search space and provides a suitable framework for future extension to other optimization algorithms. Our algorithm is compared to ML detector, Matched Filter (MF) detector, conventional detector with GA; and Adaptive LMS detector which have been used for MUD in DS-CDMA. Simulation results show that the performance of this algorithm is close to the optimal detector with very low complexity, and it works better in comparison to other algorithms.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2013</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Direct sequence-code division multiple access (DS-CDMA)</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Multiuser detection</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Adaptive LMS algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Genetic algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Zahedi</subfield>
   <subfield code="D">Abdulhamid</subfield>
   <subfield code="u">Faculty of Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Bakhshi</subfield>
   <subfield code="D">Hamidreza</subfield>
   <subfield code="u">Department of Electrical Engineering, Shahed University, Persian Gulf Highway, Tehran, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">73/3(2013-12-01), 931-947</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:3&lt;931</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s11277-013-1224-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s11277-013-1224-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Zahedi</subfield>
   <subfield code="D">Abdulhamid</subfield>
   <subfield code="u">Faculty of Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Bakhshi</subfield>
   <subfield code="D">Hamidreza</subfield>
   <subfield code="u">Department of Electrical Engineering, Shahed University, Persian Gulf Highway, Tehran, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Wireless Personal Communications</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">73/3(2013-12-01), 931-947</subfield>
   <subfield code="x">0929-6212</subfield>
   <subfield code="q">73:3&lt;931</subfield>
   <subfield code="1">2013</subfield>
   <subfield code="2">73</subfield>
   <subfield code="o">11277</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
