Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: A mixed MAP/MLSE receiver for convolutional coded signals transmitted over a fading channel
Author: White, L.
Elliott, R.
Citation: IEEE Transactions on Signal Processing, 2002; 50(5):1205-1214
Publisher: IEEE-Inst Electrical Electronics Engineers Inc
Issue Date: 2002
ISSN: 1053-587X
Statement of
Langford B. White and Robert J. Elliott
Abstract: This paper addresses the problem of estimating a rapidly fading convolutionally coded signal such as might be found in a wireless telephony or data network. We model both the channel gain and the convolutionally coded signal as Markov processes and, thus, the noisy received signal as a hidden Markov process (HMP). Two now-classical methods for estimating finite-state hidden Markov processes are the Viterbi (1967) algorithm and the a posteriori probability (APP) filter. A hybrid recursive estimation procedure is derived whereby one hidden process (the encoder state in our application) is estimated using a Viterbi-type (i.e., sequence based) cost and the other (the fading process) using an APP-based cost such as maximum a posteriori probability. The paper presents the new algorithm as applied specifically to this problem but also formulates the problem in a more general setting. The algorithm is derived in this general setting using reference probability methods. Using simulations, performance of the optimal scheme is compared with a number of suboptimal techniques-decision-directed Kalman and HMP predictors and Kalman filter and HMP filter per-survivor processing techniques
Keywords: Convolutional decoding
fading channels
hidden Markov models
per-survivor processing
Description: Copyright © 2002 IEEE
DOI: 10.1109/78.995087
Published version:
Appears in Collections:Applied Mathematics publications
Aurora harvest 6
Electrical and Electronic Engineering publications

Files in This Item:
File Description SizeFormat 
hdl2405.pdf364.14 kBPublishers PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.