Substream Selection in Wireless MIMO Systems for Complexity Reduction

Document Type

Conference Proceeding

Publication Date

4-4-2005

Publication Title

ITCC 2005 - International Conference on Information Technology: Coding and Computing

Publisher

IEEE

First page number:

729

Last page number:

733

Abstract

Although MIMO channels offer the potential to dramatically improve the channel capacity, the incurred implementation complexity and massive computation requirements have made MIMO difficult to be integrated in today's wireless systems. In this paper, we attempt to introduce a dominant block diagonal permutation technique to reduce the dimensionality of the overall MIMO receiver. As such, we may trade small performance degradation for significantly reduced computation complexity, which may finally lead to a low power real time MIMO receiver design. In particular, a large channel transfer function matrix is decomposed into many weakly coupled submatrices by a proper permutation. Finding such a decomposition is formulated as an NP-hard combinatorial problem, and a special generic algorithm based procedure has been developed.

Keywords

Antenna arrays; Channel capacity; Communication complexity; Genetic algorithms; Mobile communication; transfer function matrices

Disciplines

Computer Engineering | Electrical and Computer Engineering | Engineering

Language

English

Comments

From: Information Technology: Coding and Computing, 2005. ITCC 2005. International Conference on 4-6 April 2005.

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library

Share

COinS