Skip to main content
SpringerLink
Log in

Space Time Code Representation in Transform Domain

  • Conference paper
  • First Online:
Knowledge-Based Intelligent Information and Engineering Systems (KES 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3215))

  • 1052 Accesses

Abstract

In this paper, the space time block code is investigated in transform domain. We represent the orthogonal space time block codes by using a fast Hadamard transform. Additionally, the filter theory is considered to realize this transform.

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

Access this chapter

Log in via an institution
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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. Alamouti, S.M.: A Simple Transmit Diversity Technique for Wireless Communications. IEEE JSAC 16(8) (October 1998)

    Google Scholar 

  2. Tarokh, V., Seshadri, N., Calderbank, A.R.: Space-time codes for high data rate wireless communication: performance criteria and code construction. IEEE Trans. Inform. Theory (March 1998)

    Google Scholar 

  3. Tarokh, T., Jafarkhani, H., Calderbank, A.R.: Space Time Block Codes From Orthogonal Designs. IEEE Trans. Information Theory 45, 1456–1467 (1999)

    Article  MathSciNet  Google Scholar 

  4. Radon, J.: Lineare Scharen orthogonaler matrizen. In: Abhandlungen aus dem Mathematischen Seminar der Hamburgishen University, vol. I, pp. 1–14 (1922)

    Google Scholar 

  5. Jafarkhani, H.: A Quasi-orthogonal space time block code. IEEE Trans. Commun. 49(1), 1–4 (2001)

    Article  Google Scholar 

  6. Tirkkonen, O., Boariu, A., Hottinen, A.: Minimal non-orthogonality rate one space time block code for 3+ Tx antennas. In: ISSSTA 2000, September 2000, pp. 429–432 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information & Communication, Chonbuk National University, Chonju, 561-756

    Gi Yean Hwang, Jia Hou & Moon Ho Lee

Authors
  1. Gi Yean Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Moon Ho Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. KES International, 2nd Floor, 145-157 St John Street, EC1V 4PY, London, United Kingdom

    Mircea Gh. Negoita

  2. Centre for SMART systems Engineering Research Centre, University of Brighton, BN2 4GJ, Moulsecoomb, Brighton, UK

    Robert J. Howlett

  3. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, Mawson Lakes, 5095, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hwang, G.Y., Hou, J., Lee, M.H. (2004). Space Time Code Representation in Transform Domain. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30134-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30134-9_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23205-6

  • Online ISBN: 978-3-540-30134-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation