dc.contributor.authorKumar, A. Anil
dc.contributor.authorMakur, Anamitra
dc.date.accessioned2013-09-17T02:49:20Z
dc.date.available2013-09-17T02:49:20Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationKumar, 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.
dc.identifier.issn1053-587Xen_US
dc.identifier.urihttp://hdl.handle.net/10220/13509
dc.description.abstractWe 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.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesIEEE transactions on signal processingen_US
dc.rights© 2012 IEEEen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering
dc.titleHermitian symmetric DFT codes : a new class of complex DFT codesen_US
dc.typeJournal Article
dc.contributor.researchTemasek Laboratoriesen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1109/TSP.2012.2186129


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record