Please use this identifier to cite or link to this item:
|Title:||Performance analysis and computational complexity comparison of sequence detection receivers with no explicit channel estimation||Authors:||Wu, M.
|Keywords:||Channel-state information (CSI)
Decision-aided block detection (DABD)
Pilot-symbol-assisted block detection (PSABD)
|Issue Date:||Jun-2010||Citation:||Wu, M., Kam, P.Y. (2010-06). Performance analysis and computational complexity comparison of sequence detection receivers with no explicit channel estimation. IEEE Transactions on Vehicular Technology 59 (5) : 2625-2631. ScholarBank@NUS Repository. https://doi.org/10.1109/TVT.2010.2045907||Abstract:||We consider a single-inputmultiple-output (SIMO) fading channel that can be assumed static over a duration of L symbols. We show that the generalized likelihood ratio test (GLRT) receiver for detecting a block of L uncoded symbols does not require channel-state information (CSI). By deriving an exact closed-form pairwise error probability expression for the detector over slowly time-varying Rayleigh fading, we show that its performance approaches that of coherent detection with perfect CSI when L becomes large. To detect a very long sequence of S symbols over a channel that can be assumed to remain static only over L symbols, where S≫L, while keeping computational complexity low, we consider three pilot-based algorithms, namely, the trellis search algorithm, pilot-symbol-assisted block detection, and decision-aided block detection. We compare them with the two existing block-by-block detection algorithms, namely, lattice decoding and sphere decoding, and show the former's advantages in complexity and performance. © 2010 IEEE.||Source Title:||IEEE Transactions on Vehicular Technology||URI:||http://scholarbank.nus.edu.sg/handle/10635/57007||ISSN:||00189545||DOI:||10.1109/TVT.2010.2045907|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.