Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4851))

Abstract

The aim of this paper is to show the connection between certain, previously constructed multi-block and asymmetric space-time codes. The Gram determinants of the two constructions coincide, and hence the corresponding lattices share the same density. Using the notion of density, we define the normalized minimum determinant and give an implicit lower bound depending on the center of the cyclic division algebra in use. The calculation of the normalized minimum determinant is then performed in practice by using explicit code constructions.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hollanti, C., Ranto, K.: Asymmetric Space-Time Block Codes for MIMO Systems. In: 2007 IEEE ITW, Bergen, Norway, pp. 101–105 (2007)

    Google Scholar 

  2. Hottinen, A., Hong, Y., Viterbo, E., Mehlführer, C., Mecklenbraüker, C.F.: A Comparison of High Rate Algebraic and Non-Orthogonal STBCs. In: 2007 ITG/IEEE WSA 2007, Vienna, Austria (2007)

    Google Scholar 

  3. Lu, H.F.F.: Explicit Constructions of Multi-Block Space-Time Codes that Achieve the Diversity-Multiplexing Tradeoff. In: 2006 IEEE ISIT, Seattle, pp. 1149–1153 (2006)

    Google Scholar 

  4. Yang, S., Belfiore, J.-C.: Optimal Space-Time Codes for the MIMO Amplify-and-Forward Cooperative Channel. IEEE Trans. Inform. Theory 53, 647–663 (2007)

    Article  MathSciNet  Google Scholar 

  5. Belfiore, J.-C., Rekaya, G.: Quaternionic Lattices for Space-Time Coding. In: IEEE ITW 2003, Paris, France (2003)

    Google Scholar 

  6. Lahtonen, J.: Dense MIMO Matrix Lattices and Class Field Theoretic Themes in Their Construction. In: IEEE ITW 2007, Bergen, Norway, pp. 96–100 (2007)

    Google Scholar 

  7. Elia, P., Kumar, K.R., Pawar, S.A., Kumar, P.V., Lu, H.F.F.: Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Inf. Theory 52, 3869–3884 (2006)

    Article  MathSciNet  Google Scholar 

  8. Zheng, L., Tse, D.: Diversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels. IEEE Trans. Inform. Theory 49, 1073–1096 (2003)

    Article  MATH  Google Scholar 

  9. Sethuraman, B.A., Rajan, B.S., Shashidhar, V.: Full-Diversity, High-Rate Space-Time Block Codes From Division Algebras. IEEE Trans. Inform. Theory 49, 2596–2616 (2003)

    Article  MathSciNet  Google Scholar 

  10. Belfiore, J.-C., Oggier, F., Rekaya, G., Viterbo, E.: Perfect Space-Time Block Codes. IEEE Trans. Inform. Theory 52, 3885–3902 (2006)

    Article  MathSciNet  Google Scholar 

  11. Kiran, T., Rajan, B.S.: STBC-Schemes with Non-Vanishing Determinant For Certain Number of Transmit Antennas. IEEE Trans. Inform. Theory 51, 2984–2992 (2005)

    Article  MathSciNet  Google Scholar 

  12. Lu, H.F.F., Elia, P., Kumar, K.R., Pawar, S.A., Kumar, P.V.: Space-Time Codes Meeting the Diversity-Multiplexing Gain Tradeoff with Low Signalling Complexity. In: 2005 CISS, Baltimore (2005)

    Google Scholar 

  13. Hollanti, C., Lahtonen, J., Ranto, K., Vehkalahti, R.: On the Densest MIMO Lattices from Cyclic Division Algebras. IEEE Trans. Inform. Theory (submitted 2006). http://arxiv.org/abs/cs.IT/0703052

  14. Albert, A.A.: Structure of Algebras. AMS, New York (1939)

    Google Scholar 

  15. Reiner, I.: Maximal Orders. Academic Press, New York (1975)

    MATH  Google Scholar 

  16. El Gamal, H., Hammons Jr., A.R.: A New Approach to Layered Space-Time Coding and Signal Processing. IEEE Trans. Inform. Theory 47, 2321–2334 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Serdar BoztaÅŸ Hsiao-Feng (Francis) Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hollanti, C., Lu, Hf.(. (2007). Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. In: BoztaÅŸ, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77224-8_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77223-1

  • Online ISBN: 978-3-540-77224-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics