Back to Search
Start Over
Recursive Construction of Minimum Euclidean Distance-Based Precoder for Arbitrary-Dimensional MIMO Systems.
- Source :
-
IEEE Transactions on Communications . Apr2014, Vol. 62 Issue 4, p1258-1271. 14p. - Publication Year :
- 2014
-
Abstract
- 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. [ABSTRACT FROM PUBLISHER]
- Subjects :
- *MIMO systems
*MATRIX decomposition
*EUCLIDEAN distance
*ALGORITHMS
*LATTICE theory
Subjects
Details
- Language :
- English
- ISSN :
- 00906778
- Volume :
- 62
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Communications
- Publication Type :
- Academic Journal
- Accession number :
- 95720768
- Full Text :
- https://doi.org/10.1109/TCOMM.2014.021614.130377