Scheduling approach for MIMO with Tomlinson-Harashima precoding

Warning The system is temporarily closed to updates for reporting purpose.

Özdemir, Battal and Gürbüz, Özgür (2006) Scheduling approach for MIMO with Tomlinson-Harashima precoding. In: IEEE Vehicular Technology Conference, Melbourne, Australia

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=1682830&isnumber=35441&punumber=11096&k2dockey=1682830@ieeecnfs&query=%28gurbuz+%3Cin%3E+metadata%29+%3Cand%3E+%28%28131%2C504%2C657%2C757%2C832%2C1129%2C3677%2C3758%2C3812%2C4664%2C5616%2C6314%2


We consider the downlink of a wireless network, where Tomlinson-Harashima Precoding (THP) is applied as a MIMO spatial multiplexing method. THP facilitates a point-tomultipoint transmission strategy, in which a subset of mobile stations receives data packets over parallel subchannels formed by precoding. In this paper, we propose a low-complexity scheduling algorithm that determines the best subset of stations to maximize the system capacity. TH precoding is based on the QR factorization of the channel matrix H, and the proposed scheduling algorithm here makes use of incremental implementation for QR factorization with Gram-Schmidt algorithm. We show that significant reduction in complexity can be obtained over classical exhaustive search, while providing the same maximum capacity.

Item Type:Papers in Conference Proceedings
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
ID Code:1247
Deposited By:Battal Özdemir
Deposited On:11 Dec 2006 02:00
Last Modified:29 Apr 2016 15:31

Repository Staff Only: item control page