Information-Lossless Space-Time Block Codes From Crossed-Product Algebras

نویسندگان

  • Vummintala Shashidhar
  • B. Sundar Rajan
  • B. A. Sethuraman
چکیده

It is known that the Alamouti code is the only complex orthogonal design (COD) which achieves capacity and that too for the case of two transmit and one receive antenna only. Damen et al. proposed a design for 2 transmit antennas, which achieves capacity for any number of receive antennas, calling the resulting STBC when used with a signal set an informationlossless STBC. In this paper, using crossed-product central simple algebras, we construct STBCs for arbitrary number of transmit antennas over an apriori specified signal set. Alamouti code and quasi-orthogonal designs are the simplest special cases of our constructions. We obtain a condition under which these STBCs from crossed-product algebras are information lossless. We give some classes of crossed-product algebras, from which the STBCs obtained are information lossless and also of fullrank. We present some simulation results for two, three and four transmit antennas to show that our STBCs perform better than some of the best known STBCs and also that these STBCs are approximately 1 dB away from the capacity of the channel with QAM symbols as input.

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

ثبت نام

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

منابع مشابه

High-Rate and Information-Lossless Space-Time Block Codes from Crossed-Product Algebras

It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. It has been shown that coding across both spatial and temporal domains together, called Space-Time Coding (STC), achieves, a diversity order equal to the product of the number of transmit and receive antennas. Space-Time Block Codes (STB...

متن کامل

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...

متن کامل

Cyclic Division Algebras: A Tool for Space-Time Coding

Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space–Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requir...

متن کامل

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

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...

متن کامل

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...

متن کامل

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


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

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2006