Sökning: onr:"swepub:oai:DiVA.org:liu-39861" >
Complexity Reductio...
Complexity Reduction of Matrix Manipulation for Multi-User STBC-MIMO Decoding
-
- Eilert, Johan, 1980- (författare)
- Linköpings universitet,Tekniska högskolan,Datorteknik
-
- Wu, Di, 1979- (författare)
- Linköpings universitet,Tekniska högskolan,Datorteknik
-
- Liu, Dake, 1957- (författare)
- Linköpings universitet,Tekniska högskolan,Datorteknik
-
visa fler...
-
Wang, Dandan (författare)
-
Al-Dhahir, Naofal (författare)
-
Minn, Hlaing (författare)
-
visa färre...
-
(creator_code:org_t)
- 2007
- 2007
- Engelska.
-
Ingår i: IEEE Sarnoff Symmposium,2007. - 9781424424832 ; , s. 1-5
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- This paper studies efficient complex valued matrix manipulations for multi-user STBC-MIMO decoding. A novel method called Alamouti blockwise analytical matrix inversion (ABAMI) is proposed for the inversion of large complex matrices that are based on Alamouti sub-blocks. Another method using a variant of Givens rotation is proposed for fast QR decomposition of this kind of matrices. Our solutions significantly reduce the number of operations which makes them more than 4 times faster than several other solutions in the literature. Furthermore, compared to fixed function VLSI implementations, our solution is more flexible and consumes less silicon area because the hardware is programmable and it can be reused for many other operations such as filtering, correlation and FFT/IFFT. Besides the analysis of the general computational complexity based on the number of basic operations, the computational latency is also measured in clock cycles based on the conceptual hardware for real-time matrix manipulations.
Nyckelord
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas