Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/72099
DC Field | Value | |
---|---|---|
dc.title | Turbo differential space-time block codes with iterative demodulation and decoding | |
dc.contributor.author | Nallanathan, A. | |
dc.contributor.author | Yan, L.P. | |
dc.date.accessioned | 2014-06-19T03:31:25Z | |
dc.date.available | 2014-06-19T03:31:25Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Nallanathan, A.,Yan, L.P. (2005). Turbo differential space-time block codes with iterative demodulation and decoding. IEEE International Conference on Communications 3 : 1891-1895. ScholarBank@NUS Repository. | |
dc.identifier.issn | 05361486 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/72099 | |
dc.description.abstract | The advantage of differential space-time block codes (DSTBC) over conventional space-time block codes (STBC) is that the former does not require perfect channel state information (CSI). The trade-off is a penalty of approximately 3 dB in performance. Due to the recursive structure of DSTBC, iterative demodulation and decoding can be performed on a system of concatenated component DSTBC encoders. This paper proposes the parallel concatenation of two DSTBC blocks separated by an interleaver. It is shown that the 3 dB penalty can be sufficiently recovered within a few iterations. © 2005 IEEE. | |
dc.source | Scopus | |
dc.subject | Differential modulation | |
dc.subject | Group codes | |
dc.subject | Iterative decoding | |
dc.subject | Space-time coding | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.sourcetitle | IEEE International Conference on Communications | |
dc.description.volume | 3 | |
dc.description.page | 1891-1895 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.