A New Two-Step Precoding Strategy for Closed-Loop MIMO Systems
- Authors
- Lee, Heunchul; Park, Seokhwan; Lee, Inkyu
- Issue Date
- 3월-2009
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Closed-loop systems; maximum likelihood detection (MLD); MIMO systems; space division multiplexing (SDM)
- Citation
- IEEE TRANSACTIONS ON COMMUNICATIONS, v.57, no.3, pp.861 - 870
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON COMMUNICATIONS
- Volume
- 57
- Number
- 3
- Start Page
- 861
- End Page
- 870
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/120494
- DOI
- 10.1109/TCOMM.2009.03.060633
- ISSN
- 0090-6778
- Abstract
- In this paper, we present a new precoding technique using rotation transformations for closed loop multiple-input multiple-output (MIMO) wireless systems, which does not require the singular value decomposition (SVD) operation of the channel transfer matrix and allows a simple maximum-likelihood (ML) decoding at the receiver. We divide the precoding process into two steps: orthogonalization transformation which induces orthogonality between transmitted signals and beamforming transformation which achieves diversity gain. In the proposed method, we utilize a design criterion based on the minimum Euclidean distance between the received signals and then the vector orthogonalization is connected to the vector-norm maximization. In this paper, we focus on spatial multiplexing systems transmitting two independent data streams. Compared with the SVD based schemes, the proposed approach maintains a low complexity by relying only on three different kinds of rotation matrices for both the orthogonalization and beamforming transformation. Simulation results confirm that the proposed two step precoding achieves the better performance than the conventional SVD based MIMO precodings with reduced complexity.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.