ACM Home Page
Please provide us with feedback. Feedback
Hardware architecture for matrix factorization in mimo receivers
Full text PdfPdf (555 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 17th ACM Great Lakes symposium on VLSI table of contents
Stresa-Lago Maggiore, Italy
POSTER SESSION: Poster session 1 table of contents
Pages: 196 - 199  
Year of Publication: 2007
ISBN:978-1-59593-605-9
Authors
Barbara Cerato  Politecnico di Torino, Torino, Italy
Guido Masera  Politecnico di Torino, Torino, Italy
Peter Nilsson  Lund University, Lund, Sweden
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 91,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1228784.1228835
What is a DOI?

ABSTRACT

This paper presents the hardware realization of the factorization algorithm required in a MIMO OFDM receiver to make the detection and decoding a non-orthogonal space-time code. Requirements of a real scenario represented by the standard IEEE 802.11n for WLAN have been analyzed and exploited to draw out the specifications of the proposed implementation. A very high throughput hardware realization has been obtained able to factorize 128 8x8 real channel matrices during the channel updating period of 28 &3956;s, with a final throughput of 4,63 millions of matrices processed per second. Synthesis results on both 0.13 &3956;m CMOS standard cell technology and FPGA compare favourably to previous implementations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J.-C. Belfiore, G. Rekaya, and E. Viterbo. The Golden code: A 2 x 2 full-rate space-time code with non-vanishing determinants. IEEE Trans. Inform. Theory, 51(4):1432--1436, April 2005.
 
2
B. Cerato, G. Masera, and E. Viterbo. A VLSI decoder for the golden code. In Proc. IEEE ICECS 2006, pages 162--174, 10-13 Dec. 2006.
 
3
L. M. Davis. Scaled and decoupled Cholesky and QR decompositions with application to spherical MIMO detection. In Proc. IEEE WCNC 2003, pages 326--331, Mar. 2003.
 
4
P. Dayal and M. Varanasi. An optimal two transmit antenna space-time code and its stacked extensions. In Proc. of Asilomar Conf., November 2003.
 
5
R. Dölher. Squared Givens Rotation. IMA Journal of numerical analysis, 11:1--5, 1991.
 
6
F. Edman. Digital Hardware Aspects of Multiantenna Algorithms. PhD thesis, Lund University, Department of Electroscience, Lund, Sweden, February 2006.
 
7
Z. Guo and P. Nilsson. A VLSI architecture for the Schnorr-Euchner decoder for MIMO systems. In Proc. IEEE CAS Symp. Emerging Technologies, pages 65--68, June 2004.
 
8
P. Hung, H. Fahmy, O. Mencer, and M. Flynn. Fast division algorithm with a small lookup table. In Proc. 33th Asilomar Conf., volume 2, pages 1465--1468 vol.2, October 1999.
 
9
M. Karkooti, J. R. Cavallaro, and C. Dick. FPGA implementation of matrix inversion using QRD-RLS algorithm. In Proc. of Asilomar Conf., pages 1625--1629, November 2005.
 
10
E. Viterbo and J. Boutros. A universal lattice code decoder for fading channels. IEEE Trans. Inform. Theory, 45(5):1639--1642, July 1999.


Collaborative Colleagues:
Barbara Cerato: colleagues
Guido Masera: colleagues
Peter Nilsson: colleagues