flag flag  

Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Description : The computational complexity of optimum decoding for an orthogonal space-time block code {cal G}_N satisfying {cal G}_N^H{cal G}_N=c(∑_{k=1}^Kos_ko^2)I_N where c is a positive integer is quantified. Four equivalent techniques of optimum decoding which have the same computational complexity are speci...
Language(s) : English
Subject(s) : OSTBC , maximum likelihood decoding , quadrature amplitude modulation (QAM) , decoding QAM , square QAM , TECHNOLOGY , TEKNIKVETENSKAP
Publisher(s) : Linköping University, Linköping University, Communication Systems , Linköping University, Linköping University, Communication Systems
Contributor(s) :
Source(s) :
Publication Date(s) : 2011-01-01