Please use this identifier to cite or link to this item:
http://hdl.handle.net/2289/6332
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Parvathi, C. | - |
dc.contributor.author | Balasubramanyam, R. | - |
dc.date.accessioned | 2015-10-28T11:22:00Z | - |
dc.date.available | 2015-10-28T11:22:00Z | - |
dc.date.issued | 2015-01 | - |
dc.identifier.citation | IETE Journal of Research, 2015, Vol.61, p56-64 | en |
dc.identifier.issn | 0377-2063 | - |
dc.identifier.issn | 0974-780X (Online) | - |
dc.identifier.uri | http://hdl.handle.net/2289/6332 | - |
dc.description | Restricted Access. | en |
dc.description.abstract | MIMO–STBC–OFDM systems mitigate inter symbol interference and frequency-selective fading caused by multi-path propagation in modern high-data-rate wireless communication. Error correction codes use redundancy to correct errors that still occur. No systematic analysis of their performance using a common link configuration is found in the literature. We fill this gap in this simulation study using a common MIMO–STBC–OFDM communication link, transferring data at a symbol rate of 100 Mbps. We find that (a) for all code rates, low-density parity-check code performs best with BPSK and to an extent with QPSK and (b) ½-rate convolutional code works well for all symbol mapping schemes. | en |
dc.language.iso | en | en |
dc.publisher | Taylor & Francis for IETE | en |
dc.relation.uri | http://dx.doi.org/10.1080/03772063.2014.985262 | en |
dc.rights | 2015 IETE | en |
dc.subject | Channel coding | en |
dc.subject | MIMO systems | en |
dc.subject | OFDM | en |
dc.subject | Space-time coding | en |
dc.title | A systematic study of coding performance in a MIMO-STBC-OFDM link | en |
dc.type | Article | en |
Appears in Collections: | Research Papers (A&A) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2015_IETEJORes_61_56.pdf Restricted Access | Restricted Access | 884.95 kB | Adobe PDF | View/Open Request a copy |
Items in RRI Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.