A high-speed multiple input multiple output (MIMO) wireless communication system is proposed for metro transportation. In order to better mitigate the inter-antenna interference (IAI) which degrades the quality of the MIMO receiver, we propose an efficient hybrid multiuser detection (MUD) technique. This approach consists of a two-stage procedure to achieve the optimum multiuser detector (OMD) by an acceptable computational complexity. The first stage performs interference cancellation by using sorted QR decomposition (SQRD), and the second stage performs the genetic algorithm (GA). It has two significant advantages: 1) The SQRD scheme provides ¿good initial setting knowledge¿to improve the fitness of the population for GA. 2) The effect of fitness calculation is obtained from the QR decomposition (QRD) of a MIMO channel. Simulation results demonstrate that the two-stage procedure obtains a gain of 3 dB to 25 dB than other well-known MUD schemes. The computational complexity of the two-stage procedure can be reduced by 30% with QRD than other fitness calculation scheme in GA-MUD.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Efficient Near-ML Algorithm with SQRD for Wireless MIMO Communications in Metro Transportation Systems


    Contributors:
    Pan, Chien-Hung (author) / Lee, Ta-Sung (author) / Li, Yiming (author)


    Publication date :

    2007-09-01


    Size :

    364767 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Wireless communications for intelligent transportation systems

    Elliott, Scott D. / Dailey, Daniel J. | TIBKAT | 1995


    Communications-based train control of metro systems

    British Library Online Contents | 1996



    Verticle transportation in modern metro stations

    Horgan, D. J. | British Library Online Contents | 1999


    Verticle transportation in modern metro stations

    Horgan, D.J. | Online Contents | 1999