Hermitian symmetric DFT codes : a new class of complex DFT codes

We introduce a new class of real number codes derived from DFT matrix, Hermitian symmetric DFT (HSDFT) codes. We propose a new decoding algorithm based on coding-theoretic as well as subspace based approach. Decoding of HSDFT codes requires only real arithmetic operations and smaller dimension matri...

Full description

Saved in:
Bibliographic Details
Main Authors: Kumar, A. Anil, Makur, Anamitra
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/99377
http://hdl.handle.net/10220/13509
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-99377
record_format dspace
spelling sg-ntu-dr.10356-993772020-03-07T14:02:43Z Hermitian symmetric DFT codes : a new class of complex DFT codes Kumar, A. Anil Makur, Anamitra School of Electrical and Electronic Engineering Temasek Laboratories DRNTU::Engineering::Electrical and electronic engineering We introduce a new class of real number codes derived from DFT matrix, Hermitian symmetric DFT (HSDFT) codes. We propose a new decoding algorithm based on coding-theoretic as well as subspace based approach. Decoding of HSDFT codes requires only real arithmetic operations and smaller dimension matrices compared to the decoding of the state-of-art real BCH DFT (RBDFT) class of codes. HSDFT codes will also be shown to have more burst error correction capacity. For a Gauss-Markov source, on a binary symmetric channel at lower to moderate bit error rates (BERs), HSDFT codes show better performance than RBDFT codes, and on a Gilbert-Elliot channel HSDFT codes consistently perform better than RBDFT codes. 2013-09-17T02:49:20Z 2019-12-06T20:06:35Z 2013-09-17T02:49:20Z 2019-12-06T20:06:35Z 2012 2012 Journal Article Kumar, A. A., & Makur, A. (2012). Hermitian symmetric DFT codes : a new class of complex DFT codes. IEEE transactions on signal processing, 60(5), 2396-2407. 1053-587X https://hdl.handle.net/10356/99377 http://hdl.handle.net/10220/13509 10.1109/TSP.2012.2186129 en IEEE transactions on signal processing © 2012 IEEE
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Kumar, A. Anil
Makur, Anamitra
Hermitian symmetric DFT codes : a new class of complex DFT codes
description We introduce a new class of real number codes derived from DFT matrix, Hermitian symmetric DFT (HSDFT) codes. We propose a new decoding algorithm based on coding-theoretic as well as subspace based approach. Decoding of HSDFT codes requires only real arithmetic operations and smaller dimension matrices compared to the decoding of the state-of-art real BCH DFT (RBDFT) class of codes. HSDFT codes will also be shown to have more burst error correction capacity. For a Gauss-Markov source, on a binary symmetric channel at lower to moderate bit error rates (BERs), HSDFT codes show better performance than RBDFT codes, and on a Gilbert-Elliot channel HSDFT codes consistently perform better than RBDFT codes.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Kumar, A. Anil
Makur, Anamitra
format Article
author Kumar, A. Anil
Makur, Anamitra
author_sort Kumar, A. Anil
title Hermitian symmetric DFT codes : a new class of complex DFT codes
title_short Hermitian symmetric DFT codes : a new class of complex DFT codes
title_full Hermitian symmetric DFT codes : a new class of complex DFT codes
title_fullStr Hermitian symmetric DFT codes : a new class of complex DFT codes
title_full_unstemmed Hermitian symmetric DFT codes : a new class of complex DFT codes
title_sort hermitian symmetric dft codes : a new class of complex dft codes
publishDate 2013
url https://hdl.handle.net/10356/99377
http://hdl.handle.net/10220/13509
_version_ 1681048147533496320