Document Type

Article

Subject Area(s)

Electrical and Computer engineering

Abstract

Detection for the statistically known channel (SKC) is aimed at obtaining good performance in situations where our statistical knowledge of a time-varying channel is good, and where other equalization/detection schemes are either too complex to implement, or their performance is limited due to the rapidity of channel fading, or where we are simply unable to perform channel estimation. By using a statistical characterization of the channel, we develop a new detector that performs maximum-likelihood sequence estimation (MLSE) (given the channel model) on blocks of N symbols. Both symbol-spaced and fractionally spaced samples are used, to obtain two different detectors, that are generalizations of those devised for optimal block schemes on nondispersive channels. The detector that uses fractionally spaced samples is shown to outperform the detector that uses symbol-spaced samples. The performance of both appears to approach that of the corresponding known channel (KC) detector as the block length increases. We also numerically evaluate the SKC detector performance under conditions where the channel parameters (statistics) are incorrectly estimated, and show that the fractionally spaced detector is fairly robust to modeling errors. Finally, we devise a sliding block algorithm, for use when transmitting more than N symbols.

Rights

© IEEE Transactions on Communications, 1996, IEEE

Matolak, D., Wilson, S. (1996). Detection for a Statistically-Known, Time-Varying Dispersive Channel. IEEE Transactions on Communications, 44(12), 1673-1683.

http://dx.doi.org/10.1109/26.545897

Download

Share

COinS