A novel fast codebook search for MIMO beamforming systems

Shang Ju Lee*, Shang Ho Tsai, Ping Fan Ho

*Corresponding author for this work

    Research output: Contribution to conferencePaperpeer-review

    Abstract

    In this paper, we propose a fast algorithm to quickly search the best codeword in a given codebook for MIMO beamforming systems. The proposed algorithm can effectively reduce the computational complexity and feedback latency for various codebooks. Moreover, we analyze both the complexity and the performance for the proposed algorithm. From the complexity analysis, we found that around half of the computational complexity will be reduced in each iteration. From the performance analysis, we found that as the number of quantization bits increases, the analytical result is close to the simulation result. Simulation results are provided to evaluate the proposed algorithm in several beamforming scenarios.

    Original languageEnglish
    Pages185-188
    Number of pages4
    StatePublished - 1 Dec 2010
    Event2nd Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2010 - Biopolis, Singapore
    Duration: 14 Dec 201017 Dec 2010

    Conference

    Conference2nd Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2010
    Country/TerritorySingapore
    CityBiopolis
    Period14/12/1017/12/10

    Fingerprint

    Dive into the research topics of 'A novel fast codebook search for MIMO beamforming systems'. Together they form a unique fingerprint.

    Cite this