On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel-Reference-Cited by-同舟云学术

On the average complexity of sphere decoding in lattice space-time coded multiple-input multiple-output channel

Published:2012-12-21 Issue:3 Volume:26 Page:355-366
ISSN:2161-3915
Container-title:Transactions on Emerging Telecommunications Technologies
language:en
Short-container-title:Trans. Emerging Tel. Tech.

Author:

Abediseid Walid¹

Affiliation:

1. Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division King Abdullah University for Science and Technology (KAUST) Thuwal; Saudi Arabia

Publisher

Wiley

Subject

Electrical and Electronic Engineering

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/ett.2610/fullpdf

Reference21 articles.

1. On the sphere decoding algorithm: Part I , the expected complexity;Hassibi;IEEE Transactions on Signal Processing,2005

2. On the sphere decoding algorithm: Part II, generalization, second-order statistics, and applications to communication;Hassibi;IEEE Transactions on Signal Processing,2005

3. On the complexity of sphere decoding in digital communication;Jaldén;IEEE Transactions on Signal Processing,2005

4. Fast Maximum-Likelihood Decoding of the Golden Code;Sinnokrot;IEEE Transactions on Wireless Communications,2010

5. On the complexity distribution of sphere-decoding;Seethaler;IEEE Transactions on Information Theory,2011

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Joint steepest descent and non‐stationary Richardson method for low‐complexity detection in massive MIMO systems;Transactions on Emerging Telecommunications Technologies;2022-06-05

2. A Seysen's algorithm–based incremental lattice reduction;Transactions on Emerging Telecommunications Technologies;2019-03-22

3. Partitioned scheduling for sphere decoding with runtime constraints for practical MIMO communication systems;International Journal of Communication Systems;2015-05-22