Communication over fading dispersive channels
Massachusetts Institute of Technology, Research Laboratory of Electronics, 1967 - Computers - 142 pages
The transmission of digital information over a fading dispersive channel is considered, subject to a bandwidth constraint on the input signals. A specific signaling scheme is proposed, in which information is transmitted with signals formed by coding over a set of smaller basic signals, all of which excite approximately independent and orthogonal outputs. The problem is then modeled as one of block coding over successive independent uses of a diversity channel. Upper and lower bounds to the minimum error probability attainable by such a scheme are derived. These bounds are exponentially decreasing in terms of the time available for information transmission, and agree asymptotically for a range of rates. These bounds are used to interpret the significance of different signal and channel parameters, and the interplay between them. Some conclusions are drawn concerning the nature of good input signals, the major one being that any basic signal should be transmitted at one of a small number of discrete voltage levels. Several numerical examples are included, to illustrate how these results may be applied in the estimation of performance levels for practical channels. (Author).
What people are saying - Write a review
We haven't found any reviews in the usual places.
BOUNDS TO ERROR PROBABILITY
RESULTS AND INTERPRETATION
6 other sections not shown
approximately arbitrary asymptotically Attn bandwidth basic signals bound to error C. E. Shannon California channel model code word compute consider convex function decreasing defined density derived Director Doppler shift dxdxj equal eigenvalues evaluation exponent-rate curve exponentially expurgated bound fading channel FADING DISPERSIVE CHANNELS Fp(z G. H. Hardy Gallager Gaussian channel given goes to infinity guard spaces hence increasing independent inequality input signals integral Laboratory of Electronics large number lower bound Massachusetts memoryless channel minimization minimum N basic non-negative Note number of impulses obtain Officer U.S. optimization optimum p(x orthogonal p(xj parameters performance Pj(x problem Proof quadratic programming random-coding bound Research Laboratory resulting exponent scattering function scrambling Section shown signaling scheme statistically independent sufficient condition thereby proving upper and lower Washington Wright-Patterson AFB zero rate zero-rate