Abelian codes over eisenstein-jacobi integers for MIMO systems

In this work we present construction of Space Time Block Codes (STBC) from Abelian codes. A well known Eisenstein-Jacobi rank preserving map is applied to map the codeword matrix symbols to symbols in the complex plane. We then propose an N T × N R MIMO (multiple input, multiple output) communicatio...

Full description

Saved in:
Bibliographic Details
Published in:2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI) pp. 1909 - 1912
Main Authors: Raghavendra, M.A.N.S., G.D., Goutham Simha, Sripati, Udupi
Format: Conference Proceeding
Language:English
Published: IEEE 01.09.2017
Subjects:
Abelian Code
Complexity theory
Cyclotomic-coset
Decoding
Fading channels
GFFT
MIMO
Receivers
Transforms
Upper bound
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this work we present construction of Space Time Block Codes (STBC) from Abelian codes. A well known Eisenstein-Jacobi rank preserving map is applied to map the codeword matrix symbols to symbols in the complex plane. We then propose an N T × N R MIMO (multiple input, multiple output) communication system employing the constructed STBC. An analysis on the receiver (decoder) computational complexity and an upper bound on the average probability of error is presented. Performance of the proposed system is evaluated for a 4 × 2 MIMO system. Simulation results show that at an average bit error rate (ABER) of 10 -4 the STBC over F 7 result in a coding gain of approximately 4 dB as compared to C(4, 2, 4) code.
DOI:10.1109/ICACCI.2017.8126123