Hardware architecture for matrix factorization in mimo receivers
Authors:
Open Access
- 11 March 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 196-199
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.Keywords
This publication has 7 references indexed in Scilit:
- A VLSI Decoder for the Golden code2006
- FPGA Implementation of Matrix Inversion Using QRD-RLS Algorithm2006
- The Golden Code: A$2,times,2$Full-Rate Space–Time Code With Nonvanishing DeterminantsIEEE Transactions on Information Theory, 2005
- An optimal two transmit antenna space-time code and its stacked extensions2004
- Scaled and decoupled Cholesky and QR decompositions with application to spherical MIMO detection2004
- Fast division algorithm with a small lookup table2003
- A universal lattice code decoder for fading channelsIEEE Transactions on Information Theory, 1999