Please use this identifier to cite or link to this item:
|dc.title||Sequence estimation over the slow nonselective Rayleigh fading channel with diversity reception and its application to Viterbi decoding|
|dc.contributor.author||Kam, Pooi Yuen|
|dc.contributor.author||Ching, Hang Moh|
|dc.identifier.citation||Kam, Pooi Yuen, Ching, Hang Moh (1992-04). Sequence estimation over the slow nonselective Rayleigh fading channel with diversity reception and its application to Viterbi decoding. IEEE Journal on Selected Areas in Communications 10 (3) : 562-570. ScholarBank@NUS Repository. https://doi.org/10.1109/49.127778|
|dc.description.abstract||The authors consider minimum error probability detection of a data sequence transmitted using linear-suppressed carrier modulations, specifically phase-shift keying (PSK), over the Gaussian channel with slow nonselective Rayleigh fading. Complete channel interleaving/deinterleaving and diversity reception are assumed. The problem is considered with application to Viterbi decoding in particular. It is first shown that the two presently available receivers, namely, the conventional maximum likelihood (ML) receiver and the simultaneous estimation receiver, do not perform adequately for this problem. A two-stage receiver is proposed in which the unknown channel fading gains are estimated in the first stage prior to data sequence estimation in the second stage. This receiver is shown to perform adequately, and leads to an efficient receiver/decoder for Viterbi decoding of convolutionally trellis-coded sequences. The issue of optimum estimation of channel fading gains is clarified. The bit error probability of the receiver/decoder is analyzed, and numerical performance results are presented.|
|dc.description.sourcetitle||IEEE Journal on Selected Areas in Communications|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Aug 16, 2019
WEB OF SCIENCETM
checked on Aug 9, 2019
checked on Aug 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.