Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2007

A linear groupwise STBC detector based on Strassen algorithm

Thomas Hardtke, Chin Keong Ho, Sumei Sun

Cited by 2Abstract and details only

Abstract

In this paper, we present our results on the implementation of a Strassen's algorithms-based low-complexity linear detector for groupwise space-time block coded (STBC) systems. We propose a modified partitioning scheme which is used for the execution of Strassen's algorithms and exploit properties of the GSTBC system model. The application of our method is discussed in detail for a zero-forcing (ZF) detector, but is applicable for a MMSE detector as well. For performance evaluation, we consider the number of multiplications and divisions. We obtain a significant complexity saving when compared with an equivalent solution [1] in which interference cancelation is performed successively.

Cite this paper

APA 7

Hardtke, T., Ho, C. K., & Sun, S. (2007). A linear groupwise STBC detector based on Strassen algorithm. https://doi.org/10.1109/icics.2007.4449780

MLA 9

Hardtke, Thomas, et al. “A linear groupwise STBC detector based on Strassen algorithm.” 2007, pp. 1–5, https://doi.org/10.1109/icics.2007.4449780.

Chicago

Hardtke, Thomas, Chin Keong Ho, and Sumei Sun. 2007. “A linear groupwise STBC detector based on Strassen algorithm.” https://doi.org/10.1109/icics.2007.4449780.

Harvard

Hardtke, T., Ho, C.K. and Sun, S. (2007) ‘A linear groupwise STBC detector based on Strassen algorithm’. Available at: https://doi.org/10.1109/icics.2007.4449780.

BibTeX
@article{hardtke2007linear,
  title = {{A linear groupwise STBC detector based on Strassen algorithm}},
  author = {Hardtke, Thomas and Ho, Chin Keong and Sun, Sumei},
  pages = {1--5},
  year = {2007},
  doi = {10.1109/icics.2007.4449780}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers