Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems

The objective of maximizing the minimum Euclidean distance between two received data vectors via real-valued linear precoding is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions. Assuming that perfect channel state information (CSI) is available at both the tran...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 62; no. 4; pp. 1258 - 1271
Main Authors: Xu, Xiaodong, Chen, Zhiyong
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.2014
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Channels
Codes
Coding, codes
Construction
Detection, estimation, filtering, equalization, prediction
Euclidean distance
Euclidean theory
Exact sciences and technology
Exact solutions
Information, signal and communications theory
lattice theory
Lattices
linear precoding
Mathematical analysis
Matrix decomposition
MIMO
minimum Euclidean distance
Optimization
Radiocommunications
Recursive
recursive construction
Signal and communications theory
Signal, noise
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
Transmitters. Receivers
Vectors (mathematics)
Performance evaluation
MIMO system
minimum Euclidean distance
Parameter estimation
State of the art
Coding circuit
Transmitter
lattice theory
Algorithm
linear precoding
Simulation
Coding
Channel estimation
Optimal solution
Analytical method
Recursive method
Minimal distance
MIMO
Pretreatment
recursive construction
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The objective of maximizing the minimum Euclidean distance between two received data vectors via real-valued linear precoding is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions. Assuming that perfect channel state information (CSI) is available at both the transmitter side and the receiver side, a novel low-complexity precoding algorithm is proposed to recursively construct the full-rank, the rank-deficient and the rank-one precoders with respect to particular channel realization. From the lattice theoretical perspective, the full-rank precoder is generated by using well-known dense packing lattices, which can also be recursively involved into the construction of higher-dimensional rank-deficient precoders. Moreover, the optimal solution is clearly figured out for the specific case of rank-one precoder. The closed-form expression of the achievable minimum distance is obtained and the analytical results reveal the performance bounds for different rank-constraint precoders. Simulation results validate the efficiency of the proposed precoder as compared with the state of the art.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2014.021614.130377