Non-orthogonal full rank space-time block codes over Eisenstein-Jacobi integers for MIMO systems

dc.contributor.authorRaghavendra, M.A.N.S.
dc.contributor.authorSimha, G.D.G.
dc.contributor.authorShripathi, Acharya U.
dc.date.accessioned2020-03-30T10:22:26Z
dc.date.available2020-03-30T10:22:26Z
dc.date.issued2017
dc.description.abstractIn this work we present a full rank Space Time Block Codes with Non-orthogonal designs designated as NSTBCs constructed from cyclic codes over GF(qm). Rank-Preserving Eisenstein-Jacobi map is employed to map the codewords over finite field to codewords over complex field. A generalized procedure for designing NSTBCs for MIMO system containing Nt Transmit antennas and Nr receive antennas is obtained. The computational complexity of the MIMO system employing the presented NSTBC with ML detection has been derived and an upper bound on the average probability of error is presented. It is shown that under quasi-static Rayleigh flat fading channel conditions at an ABER of 10-4 the proposed NSTBC MIMO system provides a gain of approximately 3 dB in compared with C (4,2,4) code. � 2017 IEEE.en_US
dc.identifier.citationProceedings of 2017 4th International Conference on Electronics and Communication Systems, ICECS 2017, 2017, Vol., , pp.83-87en_US
dc.identifier.urihttps://idr.nitk.ac.in/jspui/handle/123456789/8575
dc.titleNon-orthogonal full rank space-time block codes over Eisenstein-Jacobi integers for MIMO systemsen_US
dc.typeBook chapteren_US

Files