Efficient Algorithmic and Architectural Optimization of QR-based Detector for V-BLAST
Author(s) -
Fariborz Sobhanmanesh,
Saeid Nooshabadi
Publication year - 2017
Publication title -
journal of communications software and systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.191
H-Index - 13
eISSN - 1846-6079
pISSN - 1845-6421
DOI - 10.24138/jcomss.v1i1.317
Subject(s) - computer science , robustness (evolution) , mimo , matlab , very large scale integration , detector , computational complexity theory , computer engineering , qr decomposition , reduction (mathematics) , parallel computing , algorithm , computer hardware , computer architecture , embedded system , channel (broadcasting) , computer network , telecommunications , mathematics , biochemistry , chemistry , eigenvalues and eigenvectors , physics , geometry , quantum mechanics , gene , operating system
The use of multiple antennas at both transmitting and receiving sides of a rich scattering communication channel improves the spectral efficiency and capacity of digital transmission systems compared with the single antenna communication systems. However algorithmic complexity in the realization of the receiver is a major problem for its implementation in hardware. This paper investigates a near optimal algorithm for V-BLAST detection in MIMO wireless communication systems based on the QR factorization technique, offering remarkable reduction in the hardware complexity. Specifically, we analyze some hardware implementation aspects of the selected algorithm through MATLAB simulations and demonstrate its robustness. This technique can be used in an efficient fixed point VLSI implementation of the algorithm. We also provide the VLSI architecture that implements the algorithm.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom