Abstract

Per-survivor processing (PSP) is now seen as an attractive approach to performing maximum-likelihood sequence estimation (MLSE) over mobile radio channels that are rapidly time varying. An optimal PSP strategy incorporates statistical channel modeling and Kalman filtering. For severely time-dispersive channels, this approach becomes prohibitively complex. A novel filtering algorithm is presented to approximate Kalman PSP. MLSE with the new scheme offers a large reduction in computational complexity, and achieves performance close to the optimal Kalman approach and superior to existing PSP schemes in rapidly fading channels. The exact expressions presented for the pairwise error probability of MLSE with Kalman PSP may be used to predict the detector performance without resorting to lengthly simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.