Low complexity decoding of a class of linear space-time block codes by subspace partitioning


Marc Kuhn and Armin Wittneben


IEEE Vehicular Technology Conference, VTC Fall 2002, Sept. 2002.

DOI: 10.1109/VETECF.2002.1040606

[BibTeX, LaTeX, and HTML Reference]


Future broadband wireless communication systems will be characterized by heterogeneity with regard to node capabilities, link level requirements, cell structures etc. High carrier frequencies and large system bandwidth will make extreme diversity factors feasible. We consider a recently proposed class of linear space-time block codes (and associated decoders), which meet the requirements of future communication systems. In the case of these codes an increase of the block length can lead to higher diversity factors but the required decoder complexity increases too. It is not always possible for the transmitter to adapt the used block length to the decoder complexity of every receiver (e.g. for a broadcast transmission or if the transmitter has no knowledge about the receiver complexity), especially when high diversity gains are favorable. In this paper we present an approach to low complexity decoding by subspace partitioning. So, if a transmitter uses large block lengths, low complexity nodes can handle these blocks and achieve moderate diversity gains while nodes with higher capabilities can profit from high diversity gains.


low complexity decoding, space-time block codes, decoder structures, diversity

Download this document:


Copyright Notice: © 2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.