Matrix computations (3rd ed.)
Space-Time Coding
Diversity techniques to combat fading in WiMAX
WSEAS TRANSACTIONS on COMMUNICATIONS
Analysis of a fixed-complexity sphere decoding method for spatial multiplexing MIMO
WSEAS TRANSACTIONS on COMMUNICATIONS
WSEAS TRANSACTIONS on COMMUNICATIONS
Joint transceiver design for MIMO communications using geometric mean decomposition
IEEE Transactions on Signal Processing - Part I
Design and Analysis of MIMO Spatial Multiplexing Systems With Quantized Feedback
IEEE Transactions on Signal Processing
Limited feedback unitary precoding for orthogonal space-time block codes
IEEE Transactions on Signal Processing
Optimal designs for space-time linear precoders and decoders
IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
Reduced complexity closest point decoding algorithms for random lattices
IEEE Transactions on Wireless Communications
On maximum-likelihood detection and the search for the closest lattice point
IEEE Transactions on Information Theory
Grassmannian beamforming for multiple-input multiple-output wireless systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Limited feedback unitary precoding for spatial multiplexing systems
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Analysis and performance of some basic space-time architectures
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In multiple-input multiple-output (MIMO) channel (H) communication, when channel status information (CSI) is known to the receiver but not to the transmitter, the precoding technique can achieve a highly reliable communication link, when the receiver informs an optimal precoding matrix index to the transmitter based on current CSI. To select an optimal precoding matrix (F), the maximum capacity selection criterion and the maximum minimum singular value selection criterion are developed. However, with QR-decomposition detection (HF = QR) in the precoding system, these two selection criteria may involve high complexity and poor detection performance due to the full matrix multiplication and inaccurate detection of the first layer, respectively. In this paper, to simplify the QR-decomposition processes, the real and imaginary parts of channel elements are rearranged to achieve a column-wise orthogonal structure to reduce the repeated computation. In precoding systems, to achieve 1) low-complexity and 2) performance enhancement, the efficient QR-based selection (QR-selection) criterion is proposed to select an optimal precoding matrix by maximizing the absolute value of the lowest layer of the upper triangular matrix R. For low-complexity, to reduce the multiplication complexity of computing R, we prove that the absolute value of R is equal to the absolute value of R (RF=QR), where H = QR. Based on this equivalence, we can reduce the multiplication complexity because the number of multiplications for computing RF is less than the number of multiplications for computing HF. For performance enhancement, the proposed QR-selection criterion can effectively mitigate the impact of error-propagation because the probability of an early error in the sequence of decisions is lower. Simulation results show that the proposed scheme with a low-complexity level has a better performance than others, and that it can improve detection performance as the codebook size increases.