Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/115458
DC Field | Value | |
---|---|---|
dc.title | Multiple trellis coded differential unitary space-time modulation in Rayleigh flat fading | |
dc.contributor.author | Sun, Z. | |
dc.contributor.author | Tjhung, T.T. | |
dc.date.accessioned | 2014-12-12T07:15:51Z | |
dc.date.available | 2014-12-12T07:15:51Z | |
dc.date.issued | 2003 | |
dc.identifier.citation | Sun, Z.,Tjhung, T.T. (2003). Multiple trellis coded differential unitary space-time modulation in Rayleigh flat fading. ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings 4 : 353-356. ScholarBank@NUS Repository. | |
dc.identifier.issn | 15206149 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/115458 | |
dc.description.abstract | In this paper, we propose multiple trellis-coded differential unitary space-time modulation (MTC-DUSTM), by assigning κ ≥ 2 singal blocks to a single trellis branch. We present the derivation of the formulae for the pairwise error-event probability (PEP) and the bit error probability (BEP) for MTC-DUSTM. Design criteria and a systematic code design have also been proposed. When compared with the trellis coded differential unitary space-time modulation where κ = 1 signal block is assigned to a branch, we demonstrate that MTC-DUSTM has a better BEP performance when the two schemes have the same number of states. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | INSTITUTE FOR COMMUNICATIONS RESEARCH | |
dc.description.sourcetitle | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings | |
dc.description.volume | 4 | |
dc.description.page | 353-356 | |
dc.description.coden | IPROD | |
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.