A family of fast-decodable MIDO codes from crossed-product algebras over ℚ

نویسندگان

  • Laura Luzzi
  • Frédérique E. Oggier
چکیده

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum Likelihood (ML) decoding complexity, full diversity and the nonvanishing determinant (NVD) property are mostly based on cyclic division algebras. In this paper, a new family of MIDO codes with the NVD property based on crossed-product algebras over Q is introduced. Fast decodability follows naturally from the structure of the codewords which consist of four generalized Alamouti blocks. The associated ML complexity order is the lowest known for full-rate MIDO codes (O(M) instead of O(M) with respect to the real constellation size M ). Numerical simulations show that these codes have a performance from comparable up to 1dB gain compared to the best known MIDO code with the same complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A family of fast-decodable MIDO codes from crossed-product algebras over Q

Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable devices. Previous MIDO code constructions with low Maximum Likelihood (ML) decoding complexity, full diversity and the nonvanishing determinant (NVD) property are mostly based on cyclic division algebras. In this paper, a n...

متن کامل

MMSE Optimal Space-Time Block Codes from Crossed Product Algebras

Design of Space-Time Block codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However the ML decoding complexity of STBCs become prohibitive large as the number of transmit and receive antennas increase. To solve this problem, orthogonal designs, single symbol ML decodable and double symbol ML decodable STBCs have been proposed in the liter...

متن کامل

The nonassociative algebras used to build fast-decodable space-time block codes

Let K/F and K/L be two cyclic Galois field extensions and D = (K/F, σ, c) a cyclic algebra. Given an invertible element d ∈ D, we present three families of unital nonassociative algebras over L ∩ F defined on the direct sum of n copies of D. Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes in papers by Srinath, Rajan, Markin, O...

متن کامل

Generalized Distributive Law for ML Decoding of Space-Time Block Codes

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known tech...

متن کامل

Pumpluen, Susanne (2014) How to obtain division algebras used for fast-decodable space-time block

We present families of unital algebras obtained through a doubling process from a cyclic central simple algebra D = (K/F, σ, c), employing a K-automorphism τ and an element d ∈ D. These algebras appear in the construction of iterated spacetime block codes. We give conditions when these iterated algebras are division which can be used to construct fully diverse iterated codes. We also briefly lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011