A Complexity Efficient Dmt-Optimal Tree Pruning Based Sphere Decoding

This video program is a part of the Premium package:

A Complexity Efficient Dmt-Optimal Tree Pruning Based Sphere Decoding


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

A Complexity Efficient Dmt-Optimal Tree Pruning Based Sphere Decoding

0 views
  • Share
We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD) algorithm, while maintaining the DMT optimality at high signal to noise ra
We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD) algorithm, while maintaining the DMT optimality at high signal to noise ra