A Fast Algorithm for Transmit Antenna Selection in Group Layered Space-Time Architectures

@article{Bo2008AFA,
  title={A Fast Algorithm for Transmit Antenna Selection in Group Layered Space-Time Architectures},
  author={Yu Zhao Bo and Zhang Xingzhou and Li Honglin},
  journal={2008 4th International Conference on Wireless Communications, Networking and Mobile Computing},
  year={2008},
  pages={1-4}
}
Group layered space-time architecture (GLST) which combines space-time block coding and layered space-time processing can achieve a good diversity-multiplexing tradeoff. For GLST, we present an antenna selection (AS) algorithm based on QR decomposition of the equivalent channel matrix. The presented AS algorithm can achieve excellent error rate performance for GLST with the QR decomposition-based successive interference cancellation receiver. Moreover, a fast AS algorithm with only a small loss… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

An efficient detector for combined space-time coding and layered processing

  • IEEE Transactions on Communications
  • 2005
VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Fast antenna subset selection in MIMO systems

  • IEEE Transactions on Signal Processing
  • 2004
VIEW 3 EXCERPTS

A simple transmit diversity technique for wireless communications

  • IEEE Journal on Selected Areas in Communications
  • 1998
VIEW 1 EXCERPT

On the probability of error of antenna-subset selection with space-time block codes

D. J. Love
  • IEEE Trans. Commun., vol. 53, no. 11, pp. 1799-1803, Nov. 2005.
  • 1803
VIEW 1 EXCERPT