Fast lattice decodability of space-time block codes
Authors:
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1917-1921
Abstract
We study fast decodability for general rate space-time block codes. We derive bounds on the number of generators that can be in mutually orthogonal groups and use these to show that that the ML decoding complexity of a full-rate n × n space-time block code is unfortunately quite high: at least of the order of |S| n 2+1 , where S is the effective real constellation. We also show that g-group decodability is not possible for full-rate codes.Keywords
This publication has 10 references indexed in Scilit:
- Minimizing the Complexity of Fast Sphere Decoding of STBCsIEEE Transactions on Wireless Communications, 2013
- Asymptotically-Good, Multigroup Decodable Space-Time Block CodesIEEE Transactions on Wireless Communications, 2013
- An Introduction to Central Simple Algebras and Their Applications to Wireless Communication2013
- Iterated Space-Time Code Constructions From Cyclic AlgebrasIEEE Transactions on Information Theory, 2013
- Fast-Decodable Asymmetric Space-Time Codes From Division AlgebrasIEEE Transactions on Information Theory, 2011
- Generalized Silver CodesIEEE Transactions on Information Theory, 2011
- Fast-group-decodable space-time block code2010
- On Fast-Decodable Space–Time Block CodesIEEE Transactions on Information Theory, 2009
- On the Search for High-Rate Quasi-Orthogonal Space–Time Block CodeInternational Journal of Wireless Information Networks, 2006
- Full-diversity, high-rate space-time block codes from division algebrasIEEE Transactions on Information Theory, 2003