A Divide-and-Conquer Algorithm for the Symmetric TridiagonalEigenproblem
SIAM Journal on Matrix Analysis and Applications
Matrix computations (3rd ed.)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
WSEAS TRANSACTIONS on COMMUNICATIONS
Channel coding as a cryptography enhancer
WSEAS TRANSACTIONS on COMMUNICATIONS
Capacity and performance analysis of space-time block codes in Rayleigh fading channels
WSEAS TRANSACTIONS on COMMUNICATIONS
Capacity scaling in MIMO wireless systems under correlated fading
IEEE Transactions on Information Theory
Computing the capacity of a MIMO fading channel under PSK signaling
IEEE Transactions on Information Theory
Implementation of synchronization for 2x2 MIMO WLAN system
IEEE Transactions on Consumer Electronics
High-speed MB-OFDM system with multiple antennas for multimedia communication and home network
IEEE Transactions on Consumer Electronics
Efficient MIMO Receiving Technique in IEEE 802.11n System for Enhanced Services
IEEE Transactions on Consumer Electronics
A Fine Frequency Synchronization and Tracking for Mobile WiMAX Broadcasting Systems
IEEE Transactions on Consumer Electronics
Distributed Space-Time Coding and Equalization for Cooperative Cellular Communication System
IEEE Transactions on Consumer Electronics
Analysis and performance of some basic space-time architectures
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Multiple-input-multiple-output (MIMO) technique is often employed to increase capacity in comparing to systems with single antenna. However, the computational complexity in evaluating channel capacity or transmission rate (data rate) grows proportionally to the number of employed antennas at both ends of the wireless link. Recently, the QR decomposition (QRD) based detection schemes have emerged as a low-complexity solution. After conducting QRD on a full channel matrix that results in a triangular matrix, we claim that computational complexity can be simplified by the following ways. First, to simplify channel capacity calculation, we prove that eigenvalues of the full channel matrix multiplication equals eigenvalues of the triangular channel matrix multiplication. Second, to simply evaluate optimal transmission rate constrained constellation, we propose a simplified multiplication of the resulted simple triangular matrix and a transmitted signal vector. Then, we also propose a modified mutual information calculation (MMIC) to reduce the multiplication complexity in combinational multiplication processes via the divided calculation. This divided calculation is employed in the parallel architecture for the field-programmable gate array (FPGA) implementation. That is, the number of multiplications can be reduced via increasing the number of additions in the FPGA implementation. By using the computer and FPGA implementation, simulation results show that the proposed QRD-based schemes are capable of achieving conventional performance, but at a low-complexity level.