Abstract
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requires the computation of a QR decomposition for each of the data-carrying OFDM tones. Since the number of data-carrying tones ranges from 48 (as in the IEEE 802.11a/g standards) to 6817 (as in the DVB-T standard), the corresponding computational complexity will in general be significant. This paper presents two algorithms for interpolation-based QR decomposition in MIMO-OFDM systems. An in-depth computational complexity analysis shows that the proposed algorithms, for a sufficiently high number of data-carrying tones and small channel order exhibit significantly smaller complexity than brute-force per-tone QR decomposition
Original language | English |
---|---|
Title of host publication | IEEE 6th Workshop on Signal Processing Advances in Wireless Communications (SPAWC) |
Pages | 945-949 |
DOIs | |
Publication status | Published - 5 Jun 2005 |
Externally published | Yes |
Event | IEEE 6th Workshop on Signal Processing Advances in Wireless Communications: SPAWC 2005 - New York, NY, United States Duration: 5 Jun 2005 → 8 Jun 2005 |
Conference
Conference | IEEE 6th Workshop on Signal Processing Advances in Wireless Communications |
---|---|
Abbreviated title | SPAWC 2005 |
Country/Territory | United States |
City | New York, NY |
Period | 5/06/05 → 8/06/05 |