Skip to main content

Constructions of Fast-Decodable Distributed Space-Time Codes

  • Conference paper
Coding Theory and Applications

Part of the book series: CIM Series in Mathematical Sciences ((CIMSMS,volume 3))

Abstract

Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [6] to the N-relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Belfiore, J.C., Rekaya, G., Viterbo, E.: The golden code: a 2 × 2 full-rate space-time code with nonvanishing determinants. IEEE Trans. Inf. Theory 51(4), 1432–1436 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Biglieri, E., Hong, Y., Viterbo, E.: On fast-decodable space-time block codes. IEEE Trans. Inf. Theory 55(2), 524–530 (2009)

    Article  MathSciNet  Google Scholar 

  3. Hollanti, C., Lahtonen, J., Ranto, K., Vehkalahti, R., Viterbo, E.: On the algebraic structure of the silver code: a 2 × 2 perfect space-time block code. In: 2008 IEEE ITW, Porto, pp. 91–94 (2008)

    Google Scholar 

  4. Hollanti, C., Markin, N.: Algebraic fast-decodable relay codes for distributed communications. In: 2012 IEEE ISIT, Cambridge, pp. 935–939 (2012)

    Google Scholar 

  5. Hollanti, C., Markin, N.: A unified framework for constructing fast-decodable codes for n relays. In: 2012 MTNS, Melbourne (2012)

    Google Scholar 

  6. Markin, N., Oggier, F.: Iterated space-time code constructions from cyclic algebras. IEEE Trans. Inf. Theory 59(9), 5966–5979 (2013)

    Article  MathSciNet  Google Scholar 

  7. Vehkalahti, R., Hollanti, C., Oggier, F.: Fast-decodable asymmetric space-time codes from division algebras. IEEE Trans. Inf. Theory 58(4), 2362–2385 (2011)

    Article  MathSciNet  Google Scholar 

  8. Yang, S., Belfiore, J.C.: Optimal space-time codes for the MIMO amplify-and-forward cooperative channel. IEEE Trans. Inf. Theory 53(2), 647–663 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

N. Markin was supported by the Singapore National Research Foundation under Research Grant NRF-RF2009-07

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Amaro Barreal , Camilla Hollanti or Nadya Markin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Barreal, A., Hollanti, C., Markin, N. (2015). Constructions of Fast-Decodable Distributed Space-Time Codes. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-17296-5_4

Download citation

Publish with us

Policies and ethics