Reduced complexity maximum likelihood decoder for MIMO communications

H HA reduced complexity maximum likelihood decoder receives a stream of symbols Y and channel estimate H. A transformation converts Y and H into Z and R by computing matrix R, such that the product of R and Q produces matrix H. A second transformation column-swaps matrix H to form H′, thereafter gen...

Full description

Saved in:
Bibliographic Details
Main Authors Vijayan, Logeshwaran, Murali, Partha Sarathy, Vanka, Sundaram
Format Patent
LanguageEnglish
Published 21.06.2011
Online AccessGet full text

Cover

More Information
Summary:H HA reduced complexity maximum likelihood decoder receives a stream of symbols Y and channel estimate H. A transformation converts Y and H into Z and R by computing matrix R, such that the product of R and Q produces matrix H. A second transformation column-swaps matrix H to form H′, thereafter generating Q′ and R′ subject to the same constraints as was described for Q and R. Transformed variables Z and Z′ are formed by multiplying Y by Qand Q′, respectively. Table entries with Z and R and Z′ and R′ have entries of all possible x accompanied by estimates of x derived from x and Z, and similar entries of all possible x accompanied by estimates of x derived from x and Z′. Hard and soft decisions are made by finding the minimum distance metric of the combined entries of the first and second table.