The list demapper has been widely employed for coded multiple-input multiple-output (coded-MIMO) receivers, where only a list of signal vectors is examined in the calculation of likelihood ratio. In the literature, the search of list is operated in the symbol level in accordance with a search metric defined as a function of signal (symbol) vector. Since a signal vector is mapped from a group of (coded) bits, the search may be operated in the bit level if the search metric is made from the aspect of bit. In this paper, beginning with the study of a posteriori probability of bit, a bit-level list generation is proposed for iterative coded-MIMO receivers. With the information coming out of decoder, promising bit tuples can be searched in a low-complexity way, and then mapped to signal vectors for the calculation of likelihood ratio. By the complexity analysis and performance simulation, the proposed bit-level list generation is shown to have a good performance-complexity tradeoff over other existing methods.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Bit-Level List Generation for Iterative MIMO Receivers


    Contributors:


    Publication date :

    2015-09-01


    Size :

    431817 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Iterative MRC and EGC Receivers for MIMO-OFDM Systems

    Pereira, Andreia / Bento, Pedro / Gomes, Marco et al. | IEEE | 2018


    Efficient random multiple-access using iterative interference cancelation receivers

    Grinewitschus, Lukas / Schlegel, Christian | IEEE | 2018


    Energy Efficiency Optimizations of Massive MIMO Systems with Linear Receivers

    Xue, Guan / Li, Lihua / Lu, Guangyan et al. | IEEE | 2017



    Joint Placement of Transmitters and Receivers for Distributed MIMO Radars

    Jianxin Yi / Xianrong Wan / Leung, Henry et al. | IEEE | 2017