• 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

    Evaluation framework for K-best sphere decoders

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Shen, Chungan
    Eltawil, Ahmed M.
    Salama, Khaled N. cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Electrical Engineering Program
    Physical Science and Engineering (PSE) Division
    Sensors Lab
    Date
    2011-11-21
    Online Publication Date
    2011-11-21
    Print Publication Date
    2010-08
    Permanent link to this record
    http://hdl.handle.net/10754/561492
    
    Metadata
    Show full item record
    Abstract
    While Maximum-Likelihood (ML) is the optimum decoding scheme for most communication scenarios, practical implementation difficulties limit its use, especially for Multiple Input Multiple Output (MIMO) systems with a large number of transmit or receive antennas. Tree-searching type decoder structures such as Sphere decoder and K-best decoder present an interesting trade-off between complexity and performance. Many algorithmic developments and VLSI implementations have been reported in literature with widely varying performance to area and power metrics. In this semi-tutorial paper we present a holistic view of different Sphere decoding techniques and K-best decoding techniques, identifying the key algorithmic and implementation trade-offs. We establish a consistent benchmark framework to investigate and compare the delay cost, power cost, and power-delay-product cost incurred by each method. Finally, using the framework, we propose and analyze a novel architecture and compare that to other published approaches. Our goal is to explicitly elucidate the overall advantages and disadvantages of each proposed algorithms in one coherent framework. © 2010 World Scientific Publishing Company.
    Citation
    SHEN, C.-A., ELTAWIL, A. M., & SALAMA, K. N. (2010). EVALUATION FRAMEWORK FOR K-BEST SPHERE DECODERS. Journal of Circuits, Systems and Computers, 19(05), 975–995. doi:10.1142/s0218126610006554
    Publisher
    World Scientific Pub Co Pte Lt
    Journal
    Journal of Circuits, Systems and Computers
    DOI
    10.1142/S0218126610006554
    ae974a485f413a2113503eed53cd6c53
    10.1142/S0218126610006554
    Scopus Count
    Collections
    Articles; Physical Science and Engineering (PSE) Division; Electrical and Computer Engineering Program; Sensors 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.