Tuesday 26 May 2009

Wseas Transactions

New Subscription to Wseas Transactions

The following information was submitted:

Transactions: WSEAS TRANSACTIONS ON COMMUNICATIONS
Transactions ID Number: 32-517
Full Name: chien-hung pan
Position: Doctor (Researcher)
Age: ON
Sex: Male
Address: 1001 Ta-Hsueh Rd., Hsinchu city, Hsinchu 300, Taiwan.
Country: TAIWAN
Tel:
Tel prefix:
Fax:
E-mail address: pch.cm92g@nctu.edu.tw
Other E-mails:
Title of the Paper: A Simplistic MIMO Detection and Low-Complexity Selection Criterion Employed in Switching between Multiplexing and Diversity System
Authors as they appear in the Paper:
Email addresses of all the authors:
Number of paper pages: 14
Abstract: In multiple-input multiple-output (MIMO) transmission, spatial multiplexing (SM) and spatial diversity (SD) can achieve spectral efficiency and high reliability of the wireless communication link, respectively. To improve the diversity performance of SM, the transmitter switches between SM and SD transmission which are developed via a minimum square Euclidean distance selection criterion, where SD or SM is selected based on the instantaneous channel (H) state information. However, this selection criterion involves the exhaustive search of each codeword operating on the channel. In this paper, we propose 1) a simplistic MIMO detection, and 2) a low-complexity selection criterion in switching between SM and SD. For 1), at the receiver, only a QR-based detection is used to realize the SM and SD detection, respectively. To reduce the QR-decomposition (H = QR) processes for SM, the real and imaginary parts of the channel elements are rearranged to achieve a column-wise!
orthogonal structure. For SD, the maximum-likelihood decoding can be simplistic as the QR-based detection is error-propagation-free. For 2), to achieve low-complexity, for SM, we claim that the minimum diagonal entry of R operating on the minimum distance of each codeword difference is less than or equal to the minimum square Euclidean distance. For SD, we claim that a diagonal entry of R operating on the minimum distance of each codeword difference is equal to the minimum square Euclidean distance. Based on these two conditions, the proposed QR-based selection can realize the minimum square Euclidean distance selection. Simulation results show that the proposed scheme is capable of achieving optimum performance, but at a low-complexity level.
Keywords: Multiple-input multiple-output, switching, minimum Euclidean distance, QR-decomposition, Demmel condition number channel.
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress:
IP ADDRESS: 140.113.86.155