Codes for MIMO transmission based on orthogonal sequences

Codes for MIMO transmission based on orthogonal sequences We consider MIMO communication systems with Rayleigh fading. We propose a new coded modulation based on orthogonal sequences and state a new decodability condition. We introduce concepts and constructions of permutation free (PF) and permutation and repetition free (PRF) codes. We also propose a construction of PRF codes with sign manipulation, whose code rate can exceed 1. For better analysis and construction of these codes we introduce a one-to-one mapping that transforms signal matrices to vectors over a finite field. We propose construction algorithms for PF and PRF codes. We build PF and PRF codes with large cardinality, which in several case achieve the maximum cardinality. Simulation of the constructed codes and estimation of their performance was done in Simulink environment. Results show high error-correcting capability, which often reaches that of STBC codes with full transmit diversity. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Codes for MIMO transmission based on orthogonal sequences

Loading next page...
 
/lp/springer_journal/codes-for-mimo-transmission-based-on-orthogonal-sequences-0q0KTOJRQL
Publisher
SP MAIK Nauka/Interperiodica
Copyright
Copyright © 2011 by Pleiades Publishing, Ltd.
Subject
Engineering; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering; Communications Engineering, Networks
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946011040016
Publisher site
See Article on Publisher Site

Abstract

We consider MIMO communication systems with Rayleigh fading. We propose a new coded modulation based on orthogonal sequences and state a new decodability condition. We introduce concepts and constructions of permutation free (PF) and permutation and repetition free (PRF) codes. We also propose a construction of PRF codes with sign manipulation, whose code rate can exceed 1. For better analysis and construction of these codes we introduce a one-to-one mapping that transforms signal matrices to vectors over a finite field. We propose construction algorithms for PF and PRF codes. We build PF and PRF codes with large cardinality, which in several case achieve the maximum cardinality. Simulation of the constructed codes and estimation of their performance was done in Simulink environment. Results show high error-correcting capability, which often reaches that of STBC codes with full transmit diversity.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jan 20, 2012

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off