• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Minimizing the symbol-error-rate for amplify-and-forward relaying systems using evolutionary algorithms

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Ahmed, Qasim Zeeshan
    Ahmed, Sajid
    Alouini, Mohamed-Slim cc
    Aïssa, Sonia
    KAUST Department
    Communication Theory Lab
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Physical Science and Engineering (PSE) Division
    Date
    2015-02
    Permanent link to this record
    http://hdl.handle.net/10754/564040
    
    Metadata
    Show full item record
    Abstract
    In this paper, a new detector is proposed for an amplify-and-forward (AF) relaying system. The detector is designed to minimize the symbol-error-rate (SER) of the system. The SER surface is non-linear and may have multiple minimas, therefore, designing an SER detector for cooperative communications becomes an optimization problem. Evolutionary based algorithms have the capability to find the global minima, therefore, evolutionary algorithms such as particle swarm optimization (PSO) and differential evolution (DE) are exploited to solve this optimization problem. The performance of proposed detectors is compared with the conventional detectors such as maximum likelihood (ML) and minimum mean square error (MMSE) detector. In the simulation results, it can be observed that the SER performance of the proposed detectors is less than 2 dB away from the ML detector. Significant improvement in SER performance is also observed when comparing with the MMSE detector. The computational complexity of the proposed detector is much less than the ML and MMSE algorithms. Moreover, in contrast to ML and MMSE detectors, the computational complexity of the proposed detectors increases linearly with respect to the number of relays.
    Citation
    Ahmed, Q. Z., Ahmed, S., Alouini, M.-S., & Aissa, S. (2015). Minimizing the Symbol-Error-Rate for Amplify-and-Forward Relaying Systems Using Evolutionary Algorithms. IEEE Transactions on Communications, 63(2), 390–400. doi:10.1109/tcomm.2014.2375255
    Sponsors
    This work was supported by a KAUST Global Cooperative Research (GCR) fund. The work of M.-S. Alouini was supported by the Qatar National Research Fund (a member of Qatar Foundation) under NPRP Grant NPRP 5-250-2-087. This work was presented in part at the IEEE Vehicular Technology Conference (VTC-Spring), Yokohama, Japan, May 2012. The associate editor coordinating the review of this paper and approving it for publication was J. Yuan.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Communications
    DOI
    10.1109/TCOMM.2014.2375255
    ae974a485f413a2113503eed53cd6c53
    10.1109/TCOMM.2014.2375255
    Scopus Count
    Collections
    Articles; Physical Science and Engineering (PSE) Division; Electrical and Computer Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.