VLSI implementation of a high-speed iterative sorted MMSE QR decomposition

The QR decomposition is an important, but often underestimated prerequisite for pseudo- or non-linear detection methods such as successive interference cancellation or sphere decoding for multiple-input multiple-output (MIMO) systems. The ability of concurrent iterative sorting during the QR decomposition introduces a moderate overall latency, but provides the base for an improved layered stream decoding. This paper describes the architecture and results of the first VLSI implementation of an iterative sorted QR decomposition preprocessor for MIMO receivers. The presented architecture performs MIMO channel preprocessing using Givens rotations in order to compute the minimum mean squared error QR decomposition.


Published in:
2007 Ieee International Symposium On Circuits And Systems, Vols 1-11, 1421-1424
Presented at:
IEEE International Symposium on Circuits and Systems, New Orleans, LA, May 27-30, 2007
Year:
2007
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-0920-4
Laboratories:




 Record created 2011-06-06, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)