Beamforming techniques employing Singular Value Decomposition (SVD) are
commonly used in Multi-Input Multi-Output (MIMO) wireless communication
systems. For frequency selective channels, Bit-Interleaved Coded Multiple
Beamforming with Orthogonal Frequency Division Multiplexing (BICMB-OFDM) can be
applied to achieve both spatial diversity and multipath diversity. However, the
diversity analysis of BICMB-OFDM is a challenging problem because of its
complicated system structure.
In Singular Value Decomposition (SVD) beamforming, without channel coding,
there is a trade-off between full diversity and full multiplexing. Adding
channel coding, full diversity and full multiplexing can be both achieved, as
long as the code rate Rc and the number of subchannels S satisfy RcS<=1.
The Golden Code is a full-rate full-diversity space-time code, which achieves
maximum coding gain for Multiple-Input Multiple-Output (MIMO) systems with two
transmit and two receive antennas. Since four information symbols taken from an
M-QAM constellation are selected to construct one Golden Code codeword, a
maximum likelihood decoder using sphere decoding has the worst-case complexity
of O(M^4), when the Channel State Information (CSI) is available at the
receiver. Previously, this worst-case complexity was reduced to O(M^(2.5))
without performance degradation.
Beamforming techniques that employ Singular Value Decomposition (SVD) are
commonly used in Multi-Input Multi-Output (MIMO) wireless communication
systems. In the absence of channel coding, when a single symbol is transmitted,
these systems achieve the full diversity order provided by the channel; whereas
when multiple symbols are simultaneously transmitted, this property is lost.
When channel coding is employed, full diversity order can be achieved.
The complexity of sphere decoding (SD) has been widely studied in that the
algorithm is vital in providing the optimal Maximum Likelihood performance with
low complexity. In this paper, we propose a proper tree search technique that
reduces overall SD computational complexity without sacrificing performance. We
build a check-table to pre-calculate and store some terms, temporally store
some mid-stage terms, and take advantage of a new lattice representation of our
previous work.