Title
On the performance of data receivers with a restricted detection delay
Abstract
It is well known that the performance of a data receiver for an intersymbol interference (ISI) channel can depend strongly on the detection delay δ. For a discrete-time communication system, this paper derives a lower bound on the bit-error probability as a function of δ. This “restricted delay bound” is governed by a “restricted-delay distance” d(δ). In many instances, it improves upon Forney's (1972) bound, which is governed by the minimum distance dmin. For instance, for partial-response channels, d(δ) does not converge to dmin even as δ→∞. For channels without spectral zeros, a finite detection delay suffices for d(S) to coincide with dmin. For all finite δ, d(δ) is determined by a finite number of error patterns and may be computed in a straightforward manner. Unlike dmin, d(δ) depends on the phase characteristics of the channel. Minimum phase is proved to maximize d(δ). The lower bound is generalized to discrete-time channels with colored noise and to continuous-time channels. The effect of transforming a continuous-time channel into a discrete-time channel is discussed. Transformation via a matched filter, as in the ISI canceller and a Viterbi detector due to Ungerboeck and MacKechnie (1973), is shown to result in poor restricted-delay properties. Implications of these results are illustrated by means of examples
Year
DOI
Venue
1994
10.1109/26.293683
Communications, IEEE Transactions  
Keywords
Field
DocType
data communication equipment,delays,discrete time systems,interference suppression,intersymbol interference,matched filters,receivers,signal detection,ISI canceller,Viterbi detector,bit-error probability,colored noise,continuous-time channels,data receivers,discrete-time channels,discrete-time communication system,error patterns,intersymbol interference channel,lower bound,matched filter,partial-response channel,phase characteristics,restricted detection delay,restricted-delay distance
Intersymbol interference,Detection theory,Computer science,Upper and lower bounds,Communication channel,Electronic engineering,Interference (wave propagation),Decoding methods,Matched filter,Viterbi algorithm
Journal
Volume
Issue
ISSN
42
6
0090-6778
Citations 
PageRank 
References 
5
1.13
11
Authors
3
Name
Order
Citations
PageRank
J. W. M. Bergmans17612.54
F. M. J. Willems2256.37
G. S. M. Kerpen351.13